A global convergence analysis of an algorithm for large-scale nonlinear optimization problems

SIAM Journal on Optimization

Volumn 9, Issue 4, 1999, Pages 833-862

  Boggs, Paul T ^a   Kearsley, Anthony J ^b   Tolle, Jon W ^c  

^a SANDIA NATIONAL LABORATORIES   (United States)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY OF NORTH CAROLINA   (United States)

Author keywords

Global convergence; Large scale problems; Merit function; Sequential quadratic programming

Indexed keywords

EID: 0033412823     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623497316026     Document Type: Article

References (17)

1. P. T. BOGGS, P. D. DOMICH, AND J. E. ROGERS, An interior-point method for general large scale quadratic programming problems, Ann. Oper. Res., 62 (1996), pp. 419-437.
2. P. T. BOGGS, A. J. KEARSLEY, AND J. W. TOLLE, A practical algorithm for general large scale nonlinear optimization problems, SIAM J. Optim., 9 (1999), pp 755-778.
3. P. T. BOGGS AND J. W. TOLLE, A strategy for global convergence in a sequential quadratic programming algorithm, SIAM J. Numer. Anal., 26 (1989), pp. 600-623.
4. P. T. BOGGS AND J. W. TOLLE, Convergence properties of a class of rank-two updates, SIAM J. Optim., 4 (1994), pp. 262-287.
5. P. T. BOGGS AND J. W. TOLLE, Sequential quadratic programming, in Acta Numerica, 1995, Cambridge University Press, Cambridge, 1995, pp. 1-51.
6. P. T. BOGGS, J. W. TOLLE, AND A. J. KEARSLEY, On the convergence of a trust region SQP algorithm for nonlinearly constrained optimization problems, in Proceedings of the 17th IFIP TC7 Conference on System Modeling and Optimization, J. Dolezal, ed., Chapman and Hall, London, 1995, pp. 1-14.
7. P. T. BOGGS, J. W. TOLLE, AND P. WANG, On the local convergence of quasi-Newton methods for constrained optimization, SIAM J. Control Optim., 20 (1982), pp. 161-171.
8. R. H. BYRD, R. A. TAPIA, AND Y. ZHANG, An SQP augmented Lagrangian BFGS algorithm for constrained optimization, SIAM J. Optim., 2 (1992), pp. 210-241.
9. A. R. CONN, N. I. M. GOULD, AND P. T. TOINT, Lancelot: A Fortran Package for Large-Scale Nonlinear Optimization, Springer Ser. Comput. Math. 17, Springer-Verlag, Heidelberg, New York, 1992.
10. A. EL-BAKRY, R. A. TAPIA, T. TSUCHYIA, AND Y. ZHANG, On the formulation and theory of the primal-dual Newton interior-point method for nonlinear programming, J. Optim. Theory Appl., 89 (1996), pp. 507-541.
11. R. FRANKE AND E. ARNOLD, Applying new numerical algorithms to the solution of discrete-time optimal control problems, in Computer-Intensive Methods in Control and Signal Processing: The Curse of Dimensionality, K. Warwick and M. Kárný, eds., Birkhäuser Verlag, Basel, 1997, pp. 105-118.
12. P. GILL, W. MURRAY, AND M. SAUNDERS, SNOPT: An SQP Algorithm for Large Scale Constrained Optimization, Preprint NA97-2, University of California, San Diego, 1997.
13. A. J. KEARSLEY, The Use of Optimization Techniques in the Solution of Partial Differential Equations from Science and Engineering, Ph.D. thesis, Rice University, Houston, TX, 1996.
14. W. MURRAY AND F. J. PRIETO, A sequential quadratic programming algorithm using an incomplete solution of the subproblem, SIAM J. Optim., 5 (1995), pp. 590-640.
15. B. A. MURTAGH AND M. A. SAUNDERS, MINOS 5.4 User's Guide, SOL, Department of Operations Research SOL 83-20R, Stanford University, Stanford, CA, revised 1995.
16. S. G. NASH AND A. SOFER, Linear and Nonlinear Programming, McGraw-Hill, New York, 1995.
17. J. NOCEDAL, Theory of algorithms for unconstrained optimization, in Acta Numerica, 1992, Cambridge University Press, Cambridge, 1992, pp. 199-242.