Rounding of convex sets and efficient gradient methods for linear programming problems

Optimization Methods and Software

Volumn 23, Issue 1, 2008, Pages 109-128

  Nesterov, Yu ^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

COMPUTATIONAL COMPLEXITY; GRADIENT METHODS; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING; SET THEORY;

COMPLEXITY BOUNDS; CONVEX OPTIMIZATION; FULLY POLYNOMIAL APPROXIMATION SCHEMES; NONLINEAR OPTIMIZATION; OPTIMAL METHODS;

LINEAR PROGRAMMING;

EID: 37549070373     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780701550059     Document Type: Article

References (14)

1. K.M. Anstreicher, Ellipsoidal approximations of convex sets based on the volumetric barrier, CORE Discussion Paper 9745 UCL, Louvain-la-Neuve, Belgium.
2. A. Ben-Tal and A. Nemirovski, Lectures on Modern Convex Optimization: Analysis, Algorithms, Engineering Applications, SIAM-MPS Series in Optimization, SIAM, Philadelphia, 2001.
3. D. Bienstock, Potential Function Methods for Approximately Solving Linear Programming Problems. Theory and Practice, Kluwer Academic Publishers, Boston, 2002.
4. M.D. Grigoriadis and L.G. Khachiyan, Fast approximation schemes for convex programs with many blocks and coupling constraints, SIAM J. Optim. 4 (1994), 86-107.
5. F. John, Extremum problems with inequalities as subsidiary conditions, in Studies and Essays, Presented to R. Courant on his 60th Birthday January 8, 1948, Wiley Interscience, NewYork, 1948, pp. 187-204.
6. L.G. Khachiyan, Rounding of polytopes in the real number model of computation, Math. Oper. Res. 21(2) (1996), 307-320.
7. P. Kumar and E.A. Yildirim, Minimum volume enclosing ellipsoid and core sets, J. Optim. Theory Appli. 126(1) (2005), 1-21.
8. Yu. Nesterov, Unconstrained convex minimization in relative scale. CORE DP 2003/96, Math.Oper. Res. (submitted for publication).
9. _, Introductory Lectures on Convex Optimization. A Basic Course. Kluwer, Boston, 2004.
10. _, Smooth minimization of non-smooth functions, Math. Program. (A), 103(1) (2005), 127-152.
11. _, Excessive gap technique in non-smooth convex minimization, SIAM J. Optim. 16(1) (2005), 235-249.
12. Yu. Nesterov and A. Nemirovskii, Interior Point Polynomial Methods in Convex Programming: Theory and Applications, SIAM, Philadelphia, 1994.
13. S.A. Plotkin, D.B Shmoys, and E. Tardos, Fast approximation algorithms for fractional packing and covering problems Math. Oper. Res. 20 (1995), 257-301.
14. M.J. Todd and E.A. Yildirim, On Khachiyan's algorithm for the computation of minimum volume enclosing ellipsoids, Tech. Rep. TR 1435, School of Operations Research and Industrial Engineering, Cornell University, Ithaca, New York, USA, 2005. Discrete Applied Mathematics (in press).