On the convergence of a sequential quadratic programming method with an augmented lagrangian line search function
- 1 January 1983
- journal article
- research article
- Published by Taylor & Francis in Mathematische Operationsforschung und Statistik. Series Optimization
- Vol. 14 (2), 197-216
- https://doi.org/10.1080/02331938308842847
Abstract
Sequential quadratic programming methods as developed by Wilson, Han, and Powell have gained considerable attention in the last few years mainly because of their outstanding numerical performance. Although the theoretical convergence aspects of this method and its various modifications have been investigated in the literature, there still remain some open questions which will be treated in this paper. The convergence theory to be presented, takes into account the additional variable introduced in the quadratic programming subproblem to avoid inconsistency, the one-dimensional minimization procedure, and, in particular, an “ active set” strategy to avoid the recalculation of unnecessary gradients. This paper also contains a detailed mathematical description of a nonlinear programming algorithm which has been implemented by the author. the usage of the code and detailed numerical test results are presented in [5].Keywords
This publication has 7 references indexed in Scilit:
- Test Examples for Nonlinear Programming CodesPublished by Springer Nature ,1981
- Some examples of cycling in variable metric methods for constrained minimizationMathematical Programming, 1979
- THE CONVERGENCE OF VARIABLE METRIC METHODS FOR NONLINEARLY CONSTRAINED OPTIMIZATION CALCULATIONSPublished by Elsevier ,1978
- A fast algorithm for nonlinearly constrained optimization calculationsPublished by Springer Nature ,1978
- On the Convergence of Some Constrained Minimization Algorithms Based on Recursive Quadratic ProgrammingIMA Journal of Applied Mathematics, 1978
- A globally convergent method for nonlinear programmingJournal of Optimization Theory and Applications, 1977
- Superlinearly convergent variable metric algorithms for general nonlinear programming problemsMathematical Programming, 1976