A sequential quadratic programming algorithm using an incomplete solution of the subproblem

We analyze sequential quadratic programming (SQP) methods to solve nonlinear constrained optimization problems that are more flexible in their definition than standard SQP methods. The type of flexibility introduced is motivated by the necessity to deviate from the standard approach when solving large problems. Specifically we no longer require a minimizer of the QP subproblem to be determined or particular Lagrange multiplier estimates to be used. Our main focus is on an SQP algorithm that uses a particular augmented Lagrangian merit function. New results are derived for this algorithm under weaker conditions than previously assumed; in particular, it is not assumed that the iterates lie on a compact setThis research was supported by National Science Foundation grant DDMo9204208, Department of Energy grant DE-FG03-92ER25117, Office of Naval Research grant N00014-90-J-1242, and the Bank of SpainPublicad