Failure of global convergence for a class of interior point methods for nonlinear programming

Mathematical Programming, Series B

Volumn 88, Issue 3, 2000, Pages 565-574

  Wächter, Andreas ^a   Biegler, Lorenz T ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

Global convergence; Interior point methods; Newton's method; Nonlinear optimization

Indexed keywords

EID: 0000892372     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00011386     Document Type: Article

References (12)

1. Byrd, R.H., Gilbert, J.Ch., Nocedal, J. (1996): A trust region method based on interior point techniques for nonlinear programming. Technical Report OTC 96/02, Optimization Technology Center, Northwestern University, Evanston, IL, USA. Revised August 1998
2. Byrd, R.H., Hribar, M.E., Nocedal, J. (1999): An interior point algorithm for large-scale nonlinear programming. SIAM J. Optim. 9, 877-900
3. Cervantes, A.M., Wächter, A., Tütüncü, R.H., Biegler, L.T. (2000): A reduced space interior point strategy for optimization of differential algebraic systems. Comput. Chem. Eng. 24, 39-51
4. El-Bakry, A.S., Tapia, R.A., Tsuchiya, T., Zhang, Y. (1996): On the formulation and theory of the Newton interior-point method for nonlinear programming. J. Optim. Theory Appl. 89, 507-541
5. Fiacco, A.V., McCormick, G.P. (1968): Nonlinear Programming: Sequential Unconstrained Minimization Techniques. John Wiley, New York, USA. Reprinted by SIAM Publications 1990
6. Forsgren, A., Gill, P.E. (1998): Primal-dual interior methods for nonconvex nonlinear programming. SIAM J. Optim. 8, 1132-1152
7. Gay, D.M., Overton, M.L., Wright, M.H. (1998): A primal-dual interior method for nonconvex nonlinear programming. In: Yuan, Y., ed., Advances in Nonlinear Programming. Kluwer Academic Publishers, Dordrecht, pp. 31-56
8. Nash, S.G., Sofer, A. (1993): A barrier method for large-scale constrained optimization. ORSA J. Comput. 5, 40-53
9. Powell, M.J.D. (1978): A fast algorithm for nonlinearly constrained optimization calculations. In: Watson, G.A., ed., Numerical Analysis, Dundee 1977. Vol. 630 of Lect. Notes Math., Springer, Berlin
10. Vanderbei, R.J., Shanno, D.F. (1999): An interior-point algorithm for nonconvex nonlinear programming. Comput. Optim. Appl. 13, 231-252
11. Yamashita, H. (1992): A globally convergent primal-dual interior-point method for constrained optimization. Technical report, Mathematical System Institute, Inc., Tokyo, Japan. Revised March 1994
12. Yamashita, H., Yabe, H., Tanabe, T. (1997): A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization. Technical report, Mathematical System Institute, Inc., Tokyo, Japan. Revised July 1998