SQP methods for large-scale nonlinear programming
     

                N.I.M. Gould and Ph. L. Toint

                 Report 99/05   16 August 1999

We compare and contrast a number of recent sequential quadratic programming
(SQP) methods that have been proposed for the solution of large-scale
nonlinear programming problems.  Both line-search and trust-region approaches
are considered, as are the implications of interior-point and quadratic
programming methods.