Feasible interior methods using slacks for nonlinear optimization

Computational Optimization and Applications

Volumn 26, Issue 1, 2003, Pages 35-61

  Byrd, Richard H ^a   Nocedal, Jorge ^b   Waltz, Richard A ^b  

^a UCB 450   (United States)

^b Northwestern University   (United States)

Author keywords

Barrier method; Constrained optimization; Feasible method; Interior point method; Large scale optimization; Nonlinear programming; Primal dual method; Sequential quadratic programming; Trust region method

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; ITERATIVE METHODS;

CONSTRAINED OPTIMIZATION; FEASIBLE INTERIOR POINT METHODS; LARGE SCALE OPTIMIZATION; SLACK BASED METHODS;

QUADRATIC PROGRAMMING;

EID: 0141539364     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1025136421370     Document Type: Article

References (23)

1. P. Armand, J.-Ch. Gilbert, and S. Jan-Jégou, "A feasible BFGS interior point algorithm for solving strongly convex minimization problems," SIAM Journal on Optimization, vol. 11, pp. 199-222, 2000.
2. I. Bongartz, A.R. Conn, N.I.M. Gould, and Ph.L. Toint, "CUTE: Constrained and unconstrained testing environment," ACM Transactions on Mathematical Software, vol. 21, no. 1, pp. 123-160, 1995.
3. R.H. Byrd, Robust Trust Region Methods for Constrained Optimization, Third SIAM Conference on Optimization, Houston, Texas, May 1987.
4. R.H. Byrd, J. Ch. Gilbert, and J. Nocedal, "A trust region method based on interior point techniques for nonlinear programming," Mathematical Programming, vol. 89, no. 1, pp. 149-185, 2000.
5. R.H. Byrd, M.E. Hribar, and J. Nocedal, "An interior point algorithm for large scale nonlinear programming," SIAM Journal on Optimization, vol. 9, no. 4 pp. 877-900, 1999.
6. M.R. Celis, J.E. Dennis, and R.A. Tapia, "A trust region strategy for nonlinear equality constrained optimization," In Numerical Optimization 1984, P.T. Boggs, R.H. Byrd, and R.B. Schnabel (Eds.), pp. 71-82, pp. 71-82, SIAM: Philadelphia, USA, 1985.
7. A.R. Conn, N.I.M. Gould, D. Orban, and Ph.L. Toint, "A primal-dual trust-region algorithm for non-convex nonlinear programming," Mathematical Programming, vol. 87, no. 2, pp. 215-249, 2000.
8. A.R. Conn, N.I.M. Gould, and Ph. Toint, Trust-Region Methods, MPS-SIAM Series on Optimization. SIAM publications: Philadelphia, PA, USA, 2000.
9. A.R. Conn, N.I.M. Gould, and Ph.L. Toint, "A primal-dual algorithm for minimizing a nonconvex function subject to bound and linear equality constraints," In Nonlinear Optimization and Related Topics, G. Di Pillo and F. Giannessi (Eds.), pp. 15-50, Kluwer Academic Publishers: Dordrecht, the Netherlands, 1999.
10. A.S. El-Bakry, R.A. Tapia, T. Tsuchiya, and Y. Zhang, "On the formulation and theory of the Newton interior-point method for nonlinear programming," Journal of Optimization Theory and Applications, vol. 89, no. 3, pp. 507-541, June 1996.
11. A.V. Fiacco and G.P. McCormick. Nonlinear Programming: Sequential Unconstrained Minimization Techniques. J. Wiley and Sons: Chichester, England, 1968, Reprinted as Classics in Applied Mathematics 4, SIAM: Philadelphia, USA, 1990.
12. A. Forsgren and P.E. Gill, "Primal-dual interior methods for nonconvex nonlinear programming," SIAM Journal on Optimization, vol. 8, no. 4, pp. 1132-1152, 1998.
13. D.M. Gay, M. L. Overton, and M. H. Wright, "A primal-dual interior method for non-convex nonlinear programming," In Advances in Nonlinear Programming, Y. Yuan (Ed.), pp. 31-56, Kluwer Academic Publishers: Dordrecht, The Netherlands, 1998.
14. Harwell Subroutine Library, A Catalogue of Subroutines (HSL 2000), AEA Technology, Harwell: Oxfordshire, England, 2000.
15. C.T. Lawrence and A.L. Tits, "Nonlinear equality constraints in feasible sequential quadratic programming," Optimization Methods and Software, vol. 6, no. 4, pp. 265-282, 1996.
16. C.T. Lawrence and A. L. Tits, "A computationally efficient feasible sequential quadratic programming algorithm," Technical report, Institute for Systems Research Technical Report TR 98-46, University of Maryland, College Park, 1998.
17. E.O. Omojokun, "Trust region algorithms for optimization with nonlinear equality and inequality constraints," PhD thesis, University of Colorado, Boulder, Colorado, USA, 1989.
18. M.J.D. Powell, "A hybrid method for nonlinear equations," In Numerical Methods for Nonlinear Algebraic Equations, P. Rabinowitz (Ed.), pp. 87-114, Gordon and Breach: London, 1970.
19. M.J.D. Powell and Y. Yuan, "A trust region algorithm for equality constrained optimization," Mathematical Programming, vol. 49, no. 2, pp. 189-213, 1990.
20. R.J. Vanderbei and D. F. Shanno, "An interior point algorithm for nonconvex nonlinear programming," Computational Optimization and Applications, vol. 13, pp. 231-252, 1999.
21. A. Vardi, "A trust region algorithm for equality constrained minimization: Convergence properties and implementation," SIAM Journal on Numerical Analysis, vol. 22, no. 3, pp. 575-591, 1985.
22. H. Yamashita and H. Yabe, "Superlinear and quadratic convergence of some primal-dual interior point methods for constrained optimization," Mathematical Programming, Series A, vol. 75, no. 3, pp. 377-397, 1996.
23. H. Yamashita, H. Yabe, and T. Tanabe, "A globally and superlinearly convergent primal-dual point trust region method for large scale constrained optimization," Technical report, Mathematical Systems, Inc., Sinjuku-ku, Tokyo, Japan, 1997.