Multi-Parameter Surfaces of Analytic Centers and Long-Step Surface-Following Interior Point Methods

References

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