An SQP method for general nonlinear programs using only equality constrained subproblems

In this paper we describe a new version of a sequential equality constrained quadratic programming method for general nonlinear programs with mixed equality and inequality constraints. Compared with an older version [P. Spellucci, Han's method without solving QP, in: A. Auslender, W. Oettli, J. Steer (Eds), Optimization and Optimal Control, Lecture Notes in Control and Information Sciences, vol. 30, Springer, Berlin, 1981, pp. 123-141.] it is much simpler to implement and allows any kind of changes of the working set in every step. Our method relies on a strong regularity condition. As far as it is applicable the new approach is superior to conventional SOP-methods, as demonstrated by extensive numerical tests. (C) 1998 The Mathematical Programming Society, Inc. Published by Elsevier Science B.V.