Name
Abstract | ||
|---|---|---|
•An inexact subgradient algorithm is proposed for the quasi-convex programming.•We establish the convergence property, finite convergence and efficiency estimates.•The Hölder condition is assumed instead of usc when the constraint set X is compact.•The generalized weak sharp minima is introduced and utilized when X is noncompact.•We apply the proposed algorithm to solve the Cobb–Douglas production efficiency problem. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1016/j.ejor.2014.05.017 | European Journal of Operational Research |
Keywords | Field | DocType |
Subgradient method,Quasi-convex optimization,Noise,Weak sharp minima | Convergence (routing),Mathematical optimization,Subgradient method,Maxima and minima,Constrained optimization problem,Iterated function,Convex optimization,Mathematics,Bounded function,Computation | Journal |
Volume | Issue | ISSN |
240 | 2 | 0377-2217 |
Citations | PageRank | References |
5 | 0.43 | 16 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yaohua Hu | 1 | 14 | 4.35 |
| Xiaoqi Yang | 2 | 126 | 20.85 |
| Chee-Khian Sim | 3 | 23 | 5.43 |