Sequential quadratic programming for large-scale nonlinear optimization

Journal of Computational and Applied Mathematics

Volumn 124, Issue 1-2, 2000, Pages 123-137

  Boggs, Paul T ^a   Tolle, Jon W ^b  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; LAGRANGE MULTIPLIERS; MATHEMATICAL MODELS; NONLINEAR EQUATIONS; OPTIMIZATION;

INTERIOR-POINT METHODS; NEWTON METHODS; SEQUENTIAL QUADRATIC PROGRAMMING (SQP); TRUST REGION METHODS CONVERGENCE;

QUADRATIC PROGRAMMING;

EID: 0034538592     PISSN: 03770427     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-0427(00)00429-5     Document Type: Article

References (21)

1. L.T. Biegler J. Nocedal C. Schmid A reduced Hessian method for large-scale constrained optimization SIAM J. Optim. 5 2 1995 314 347
2. P.T. Boggs P.D. Domich J.E. Rogers An interior-point method for general large scale quadratic programming problems Ann. Oper. Res. 62 1996 419 437
3. P.T. Boggs A.J. Kearsley J.W. Tolle A global convergence analysis of an algorithm for large scale nonlinear programming problems SIAM. J. Optim. 9 4 1999 833 862
4. P.T. Boggs. A.J. Kearsley J.W. Tolle A practical algorithm for general large scale nonlinear optimization problems SIAM J. Optim. 9 3 1999 755 778
5. P.T. Boggs J.W. Tolle Sequential quadratic programming Acta Numer. 1995 1995 1 52
6. P.T. Boggs J.W. Tolle P. Wang On the local convergence of quasi-Newton methods for constrained optimizations SIAM J. Control Optim. 20 1982 161 171
7. R.H. Byrd, J.C. Gilbert, J. Nocedal, A trust region method based on interior point techniques for nonlinear programming, Technical Report OTC 96-02, Northwestern University, August 1998.
8. R. Chamberlain C. Lemarechal H.C. Pedersen M.J.D. Powell The watchdog technique for forcing convergence in algorithms for constrained optimization Math. Programming Study 16 1982 1 17
9. R.S. Dembo S.C. Eisenstat T. Steihaug Inexact Newton methods SIAM J. Numer. Anal. 19 1982 400 408
10. M. El-Alem A robust trust-region algorithm with a nonmonotonic penalty parameter scheme for constrained optimization SIAM J. Optim. 5 2 1995 348 378
11. R. Fletcher, S. Leyffer, P. Toint, On the global convergence of an SLP-filter algorithm, Report, University of Dundee, 1998.
12. P. Gill, W. Murray, M. Saunders, SNOPT: an SQP algorithm for large scale constrained optimization, preprint NA97-2, University of California, San Diego, 1997.
13. N.I.M. Gould, M.E. Hribar, J. Nocedal, On the solution of equality constrained quadratic programming problems arising in optimization, Technical Report OTC 98/06, Argonne National Laboratory and Northwestern University, 1998.
14. M. Lalee J. Nocedal T. Plantenga On the implementation of an algorithm for large-scale equality constrained optimization SIAM J. Optim. 8 3 1998 682 706
15. C.T. Lawrence, A.T. Tits, A computationally efficient feasible sequential quadratic programming algorithm, preprint, University of Maryland, 1998.
16. H.J. Martinez Z. Parada R.A. Tapia On the characterization of q-superlinear convergence of quasi-Newton interior-point methods for nonlinear programming Bol. Soc. Mat. Mexicana 1 3 1995 137 148
17. S.G. Nash A. Sofer Linear and Nonlinear Programming 1995 McGraw-Hill New York
18. J. Nocedal Theory of algorithms for unconstrained optimization Acta Numer. 1991 1992 199 242
19. D.F. Shanno, R.J. Vanderbei, An interior-point algorithm for nonconvex nonlinear programming, preprint, Princeton University, 1998.
20. R.J. Vanderbei, LOQO: an interior-point code for quadratic programming, Technical Report SOR 94-15, Princeton University, 1994.
21. D.P. Young, D.E. Keyes, Newton's method and design optimization, preprint, Old Dominion University, 1998.