Feasible Sequential Quadratic Programming for Finely Discretized Problems from SIP
Feasible Sequential Quadratic Programming for Finely Discretized Problems from SIP
Loading...
Files
Publication or External Link
Date
1997
Authors
Lawrence, Craig T.
Tits, A.L.
Advisor
Citation
DRUM DOI
Abstract
A sequential Quadratic Programming algorithm designed to efficiently solve nonlinear optimization problems with many inequality constraints, e.g. problems arising from finely discretized Semi-Infinite Programming, is described and analyzed. The key features of the algorithm are (i) that only a few of the constraints are used in the QP sub-problems at each iteration, and (ii) that every iterate satisfies all constraints.