Unconstrained convex minimization in relative scale

Mathematics of Operations Research

Volumn 34, Issue 1, 2009, Pages 180-193

  Nesterov, Yurii ^a  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

Author keywords

Complexity bounds; Convex optimization; Fully polynomial approximation schemes; Gradient methods; Nonlinear optimization; Optimal methods; Relative accuracy

Indexed keywords

COMPLEXITY BOUNDS; FULLY POLYNOMIAL APPROXIMATION SCHEMES; NONLINEAR OPTIMIZATION; OPTIMAL METHODS; RELATIVE ACCURACY;

CONVEX OPTIMIZATION; GRADIENT METHODS; LINEAR PROGRAMMING; LINEARIZATION; MODEL STRUCTURES; POLYNOMIAL APPROXIMATION;

OPTIMIZATION;

EID: 67649935308     PISSN: 0364765X     EISSN: 15265471     Source Type: Journal    
DOI: 10.1287/moor.1080.0348     Document Type: Article

References (10)

1. Ben-Tal, A., A. Nemirovski. 2001. Lectures on Modern Convex Optimization: Analysis, Algorithms; Engineering Applications. SIAM, Boston.
2. Bienstock, D. 2002. Potential Function Methods for Approximately Solving Linear Programming Problems. Theory and Practice. Kluwer Academic Publishers, Boston.
3. Grigoriadis, M. D., L. G. Khachiyan. 1994. Fast approximation schemes for convex programs with many blocks and coupling constraints. SIAM J. Optim. 4 86-107.
4. Hiriart-Urruty, J.-B., C. Lemarechal. 1993. Convex Analysis and Minimization Algorithms, Part 1. Springer Verlag, Berlin.
5. Nemirovskij, A. S., D. B. Yudin. 1983. Problem Complexity and Method Efficiency in Optimization. John Wiley & Sons, New York.
6. Nesterov, Yu. 2004. Introductory Lectures on Convex Optimization: A Basic Course. Kluwer, Boston.
7. Nesterov, Yu. 2005. Excessive gap technique in nonsmooth convex minimization. SIAM J. Optim. 16(1) 235-249.
8. Nesterov, Yu. 2005. Smooth minimization of non-smooth functions. Math. Programming 103(1) 127-152.
9. Nesterov, Yu., A. Nemirovskii. 1994. Interior Point Polynomial Methods in Convex Programming: Theory and Applications. SIAM, Philadelphia.
10. Plotkin, S. A., D. B. Shmoys, E. Tardos. 1995. Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 20 257-301.