Complexity of convex optimization using geometry-based measures and a reference point

Mathematical Programming

Volumn 99, Issue 2, 2004, Pages 197-221

  Freund, Robert M ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Barrier method; Complexity; Convex optimization; Interior point Method

Indexed keywords

COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; MATHEMATICAL MODELS; OPTIMIZATION; THEOREM PROVING; VECTORS;

BARRIER METHODS; COMPLEXITY; CONVEX OPTIMIZATION; INTERIOR-POINT METHOD;

PROBLEM SOLVING;

EID: 21044445470     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10107-003-0435-1     Document Type: Article

References (10)

1. Freund, R.M.: On the primal-dual geometry of level sets in linear and conic optimization. SIAM J. Optimization, to appear
2. Freund, R.M., Vera, J.R.: Condition-based complexity of convex optimization in conic linear form via the ellipsoid algorithm. SIAM J. Optimization 10(1), 155-176 (1999)
3. Freund, R.M., Vera, J.R.: Some characterizations and properties of the "distance to ill-posedness" and the condition measure of a conic linear system. Math. Programming 86, 225-260 (1999)
4. Grötschel, M., Lovasz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, Berlin, 1988
5. Nesterov, Y., Nemirovskii, A.: Interior-Point Polynomial Algorithms in Convex Programming. Society for Industrial and Applied Mathematics (SIAM), Philadelphia, 1994
6. Renegar, J.: Some perturbation theory for linear programming. Math. Programming 65(1), 73-91 (1994)
7. Renegar, J.: Linear programming, complexity theory, and elementary functional analysis. Math. Programming 70(3), 279-351 (1995)
8. Renegar, J.: A Mathematical View of Interior-Point Methods in Convex Optimization. Society for Industrial and Applied Mathematics, Philadelphia, 2001
9. Ye, Y.: Toward probabilistic analysis of interior-point algorithms for linear programming. Math. Operations Res. 19, 38-52 (1994)
10. Yildirim, E.A., Wright, S.J.: Warm-start strategies in interior-point methods for linear programming. SIAM J. Optimization 12(3), 782-810 (2002)