Multi-parameter surfaces of analytic centers and long-step surface-following interior point methods

Mathematics of Operations Research

Volumn 23, Issue 1, 1998, Pages 1-38

  Nesterov, Yu ^a   Nemirovski, A ^b  

^a UNIVERSITÉ CATHOLIQUE DE LOUVAIN   (Belgium)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Convex optimization; Geometric programming; Interior point methods; Method of analytic centers; Polynomial time methods; Quadratic programming; Semidefinite programming

Indexed keywords

POLYNOMIALS;

ANALYTIC CENTER METHOD; INTERIOR POINT METHOD;

OPERATIONS RESEARCH;

EID: 0032001695     PISSN: 0364765X     EISSN: None     Source Type: Journal    
DOI: 10.1287/moor.23.1.1     Document Type: Article

References (7)

1. 3 L) operations. N. Megiddo, ed., Progress in Mathematical Programming: Interior Point and Related Methods, Springer-Verlag, New York, 1-29.
2. Mizuno, S., M. J. Todd, Y. Ye (1995). A surface of analytic centers and primal-dual infeasible-interior-point algorithms for linear programming. Math. Oper. Res. 20 135-162.
3. Nesterov, Yu., A. Nemirovski (1994). Interior Point Polynomial Methods in Convex Programming: Theory and Applications. SIAM Series in Applied Mathematics, SIAM, Philadelphia.
4. _ (1993). Long-step strategies in interior point potential reduction methods, Report, Departement d'Economie Commericale et Industrielle, Universite de Geneve, Geneve.
5. _, M. Todd (1994). Self-scaled cones and interior-point methods in nonlinear programming, CORE Discussion Paper # 9462, Louvain-la-Neuve, Belgium.
6. _, _ (1995). Primal-dual interior point methods for self-scaled cones, Technical Report # 1125, School of OR and IE, Cornell University, Ithaca, New York.
7. Renegar, J. (1988). A polynomial time algorithm, based on Newton's method, for linear programming. Math. Programming 40 55-93.