On the complexity of a practical interior-point method

SIAM Journal on Optimization

Volumn 8, Issue 3, 1998, Pages 833-849

  Nash, Stephen G ^a   Sofer, Ariela ^a  

^a George Mason University   (United States)

Author keywords

Complexity; Convex programming; Interior point method; Large scale optimization; Self concordance; Truncated Newton method

Indexed keywords

EID: 0032328510     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623496306620     Document Type: Article

References (24)

1. M. G. BREITFELD AND D. SHANNO, Computational experience with penalty/barrier methods for nonlinear programming, Ann. Oper. Res., 62 (1996), pp. 439-464.
2. R. S. DEMBO AND T. STEIHAUG, Truncated-Newton algorithms for large-scale unconstrained optimization, Math. Programming, 26 (1983), pp. 190-212.
3. D. DEN HERTOG, Interior Point Approach to Linear, Quadratic and Convex Programming: Algorithms and Complexity, Kluwer Academic Publishers, Dordrecht, The Netherlands, 1994.
4. D. DEN HERTOG, F. JARRE, C. ROOS, AND T. TERLAKY, A sufficient condition for self-concordance, with application to some classes of structured convex programming problems, Math. Programming, 69 (1995), pp. 75-88.
5. A. V. FIACCO AND G. P. MCCORMICK, Nonlinear Programming: Sequential Unconstrained Minimization Techniques, John Wiley, Philadelphia, 1968.
6. O. GÜLER, On the self-concordance of the universal barrier function, SIAM J. Optim., 7 (1997), pp. 295-303.
7. S. HERZL AND M. J. TODD, Two interior-point algorithms for a class of convex programming problems, Optimization Methods and Software, 5 (1995), pp. 27-55.
8. F. JARRE, Interior Point Methods via Self-Concordance or Relative Lipschitz Condition, Habilitationsschrift, Bayerischen Julius-Maximilians-Universität Würzberg, 1994.
9. F. JARRE AND M. A. SAUNDERS, A practical interior-point method for convex programming, SIAM J. Optim., 5 (1995), pp. 149-171.
10. C. KANZOW, An unconstrained optimization technique for large-scale linearly constrained minimization problems, Computing, 53 (1994), pp. 101-117.
11. L. S. LASDON, J. PLUMMER AND G. YU, Primal-dual and primal interior point algorithms for general nonlinear programs, ORSA J. Comput., 7 (1995), pp. 321-332.
12. S. G. NASH AND A. SOFER, Assessing a search direction within a truncated-Newton method, Oper. Res. Lett., 9 (1990), pp. 219-221.
13. S. G. NASH AND A. SOFER, A barrier method for large-scale constrained optimization, ORSA J. Comput., 5 (1993), pp. 40-53.
14. S. G. NASH AND A. SOFER, Linear and Nonlinear Programming, McGraw-Hill, New York, 1996.
15. A. S. NEMIROVSKII, Interior Point Polynomial Time Methods in Convex Programming, Lecture notes, Faculty of Industrial Engineering and Management, Technion - The Israel Institute of Technology, 1994.
16. Y. NESTEROV AND A. S. NEMIROVSKII, Interior-Point Polynomial Algorithms in Convex Programming, SIAM, Philadelphia, 1994.
17. Y. E. NESTEROV AND M. J. TODD, Primal-dual interior point methods for self-scaled cones, SIAM J. Optim., 8 (1998), pp. 324-364.
18. F. POTRA AND R. SHENG, Homogeneous Interior-Point Algorithms for Semidefinite Programming, Reports on Computational Mathematics 82, Department of Mathematics, The University of Iowa, Iowa City, IA, 1995.
19. R. SAIGAL, An infinitely summable series implementation of interior-point methods, Math. Oper. Res., 20 (1998), pp. 597-616.
20. J. F. STURM AND S. ZHANG, On the Long Step Path-Following Method for Semidefinite Programming, Report 9638/A, Econometric Institute, Erasmus University, Rotterdam, The Netherlands, 1996.
21. L. VANDENBERGHE AND S. BOYD, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.
22. S. A. VAVASIS, Nonlinear Optimization: Complexity Issues, Oxford University Press, New York, 1991.
23. M. H. WRIGHT, Interior methods for constrained optimization, in Acta Numerica 1992, A. Iserles, ed., Cambridge University Press, New York, 1992, pp. 341-407.
24. Y. ZHANG, On extending some primal-dual interior point algorithms from linear programming to semidefinite programming, SIAM J. Optim., 8 (1998), pp. 365-386.