A primal-dual trust-region algorithm for non-convex nonlinear programming

Mathematical Programming, Series B

Volumn 87, Issue 2, 2000, Pages 215-249

  Conn, Andrew R ^a   Gould, Nicholas I M ^b   Orban, Dominique ^c   Toint, Philippe L ^d  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b RUTHERFORD APPLETON LABORATORY   (United Kingdom)

^c CERFACS   (France)

^d UNIVERSITY OF NAMUR   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000317378     PISSN: 00255610     EISSN: None     Source Type: Journal    
DOI: 10.1007/s101070050112     Document Type: Article

References (20)

1. Andersen, E.D., Gondzio, J., Mészáros, C., Xu, X. (1996): Implementation of interior point methods for large scale linear programming. In: Terlaky, T., ed., Interior Point Methods in Mathematical Programming. Kluwer Academic Publishers, Dordrecht, The Netherlands, pp. 189-252
2. El Bakry, A.S., Tapia, R.A., Tsuchiya, T., Zhang, Y. (1996): On the formulation and theory of Newton interior point methods for nonlinear programming. J. Optim. Theory Appl. 89, 507-541
3. Bongartz, I., Conn, A.R., Gould, N.I.M., Toint, Ph.L. (1995): CUTE: Constrained and Unconstrained Testing Environment. Trans. Am. Math. Soc. Math. Software 21, 123-160
4. Byrd, R.H., Hribar, M.E., Nocedal, J. (1997): An interior point algorithm for large scale nonlinear programming. Technical Report OTC 97/05, Optimization Technology Center, Northwestern University, Evanston, Illinois, USA
5. Conn, A.R., Gould, N.I.M., Toint, Ph.L. (1999): A primal-dual algorithm for minimizing a non-convex function subject to bound and linear equality constraints. In: Di Pillo, G., Giannessi, F., eds., Nonlinear Optimization and Applications 2. To appear, Kluwer Academic Publishers, Dordrecht, The Netherlands
6. Dussault, J.P. (1995): Numerical stability and efficiency of penalty algorithms. SIAM J. Numer. Anal. 32, 296-317
7. Fletcher, R. (1981): Practical Methods of Optimization: Constrained Optimization. J. Wiley and Sons, Chichester and New York
8. Forsgren, A., Gill, P.E. (1998): Primal-dual interior methods for nonconvex nonlinear programming. SIAM J. Optim. 8, 1132-1152
9. Gay, D.M., Overton, M.L., Wright, M.H. (1998): A primal-dual interior method for nonconvex nonlinear programming. In: Yuan, Y., ed., Proceedings of the 1996 International Conference on Nonlinear Programming, Beijing, China. Kluwer Academic Publishers, Dordrecht, The Netherlands, pp. 31-56
10. Gill, P.E., Murray, W., Wright, M.H. (1981): Practical Optimization. Academic Press, London, New York
11. Gould, N.I.M. (1985): On practical conditions for the existence and uniqueness of solutions to the general equality quadratic-programming problem. Math. Program. 32, 90-99
12. Gould, N.I.M. (1989): On the convergence of a sequential penalty function method for constrained minimization. SIAM J. Numer. Anal. 26, 107-128
13. Gould, N.I.M. (1991): An algorithm for large-scale quadratic programming. IMA J. Numer. Anal. 11, 299-324
14. Gould, N.I.M., Hribar, M.E., Nocedal, J. (1998): On the solution of equality constrained quadratic problems arising in optimization. Technical Report RAL-TR-98-069, Rutherford Appleton Laboratory, Chilton, Oxfordshire, England
15. Gould, N.I.M., Lucidi, S., Roma, M., Toint, Ph.L. (1999): Solving the trust-region subproblem using the Lanczos method. SIAM J. Optim. 9, 504-525
16. Gould, N.I.M., Toint, Ph.L. (1999): A note on the second-order convergence of optimization algorithms using barrier functions. Math. Program. 85, 433-438
17. Mifflin, R. (1975): Convergence bounds for nonlinear programming algorithms. Math. Program. 8, 251-271
18. Vanderbei, R.J., Shanno, D.F. (1997): An interior point algorithm for nonconvex nonlinear programming. Technical Report SOR 97-21, Program in Statistics and Operations Research, Princeton University, New Jersey, USA
19. Wright, M.H. (1992): Interior methods for constrained optimization. Acta Numer. 1, 341-407
20. 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 Systems Inc., Shinjuku-ku, Tokyo, Japan, July 1997