Methods for Nonlinear Constraints in Optimization Calculations

        Ten years ago, the broad consensus among researchers in constrained optimization was that sequential quadratic programming (SQP) methods were the methods of choice. While, in the long term, this position may be justified, the past ten years have exposed a number of difficulties with the SQP approach. Moreover, alternative methods have shown themselves capable of solving large-scale problems. In this paper, we shall outline the defects with SQP methods, and discuss the alternatives. In particular, we shall indicate how our understanding of the subproblems which inevitably arise in constrained optimization calculations has improved. We shall also consider the impact of interior-point methods for inequality constrained problems, described elsewhere in this volume, and argue that these methods likely provide a more useful Newton model for such problems than do traditional SQP methods. Finally, we shall consider trust-region methods for constrained problems, and the impact of automatic differentiation on algorithm design.

By: A. R. Conn, Nicholas I. M. Gould (CERFACS, France) and Ph. L. Toint (Facultes Univ. ND de la Paix, France)

Published in: RC20519 in 1996

This Research Report is not available electronically. Please request a copy from the contact listed below. IBM employees should contact ITIRC for a copy.

Questions about this service can be mailed to .