Analysis of a reversed Coleman-Conn reduced SQP method
journal contributionposted on 01.01.1997, 00:00 by Lorenz T. Biegler
Abstract: "We propose a quasi-Newton algorithm for solving large optimization problems with nonlinear equality constraints. It is designed for problems with few degrees of freedom, and is motivated by the need to use sparse matrix factorizations. The algorithm incorporates a correction vector that approximates the cross term Z[superscript T]WYp[subscript y] in order to estimate the curvature in both the range and null spaces of the constraints. The algorithm can be considered to be, in some sense, a practical implementation of an algorithm of Coleman and Conn. We give conditions under which local and superlinear convergence is obtained."