A sequential quadratic programming algorithm with an additional equality constrained phase

A sequential quadratic programming (SQP) method is presented that aims to overcome some of the drawbacks of contemporary SQP methods. It avoids the diculties associated with indefinite quadratic programming subproblems by defining this subproblem to be always convex. The novel feature of the approach is the addition of an equality constrained phase that promotes fast convergence and improves performance in the presence of ill conditioning. This equality constrained phase uses exact second order information and can be implemented using either a direct solve or an iterative method. The paper studies the global and local convergence properties of the new algorithm and presents a set of numerical experiments to illustrate its practical performance.

[1]  Stephen M. Robinson,et al.  Perturbed Kuhn-Tucker points and rates of convergence for a class of nonlinear-programming algorithms , 1974, Math. Program..

[2]  M. J. D. Powell,et al.  A fast algorithm for nonlinearly constrained optimization calculations , 1978 .

[3]  Philip E. Gill,et al.  Practical optimization , 1981 .

[4]  K. Schittkowski.  The nonlinear programming method of Wilson, Han, and Powell with an augmented Lagrangian type line search function , 1982 .

[5]  C. Lemaréchal,et al.  The watchdog technique for forcing convergence in algorithms for constrained optimization , 1982 .

[6]  M. J. D. Powell,et al.  Variable Metric Methods for Constrained Optimization , 1982, ISMP.

[7]  John E. Dennis,et al.  Numerical methods for unconstrained optimization and nonlinear equations , 1983, Prentice Hall series in computational mathematics.

[8]  Arne Drud,et al.  CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems , 1985, Math. Program..

[9]  R. Fletcher.  Practical Methods of Optimization , 1988 .

[10]  Roger Fletcher,et al.  Nonlinear programming and nonsmooth optimization by successive linear programming , 1989, Math. Program..

[11]  James V. Burke,et al.  A robust sequential quadratic programming method , 1989, Math. Program..

[12]  E. Omojokun.  Trust region algorithms for optimization with nonlinear equality and inequality constraints , 1990 .

[13]  Paul T. Boggs,et al.  Sequential Quadratic Programming , 1995, Acta Numerica.

[14]  J. Frédéric Bonnans,et al.  Sequential Quadratic Programming with Penalization of the Displacement , 1995, SIAM J. Optim..

[15]  S. Lucidi,et al.  Quadratically and superlinearly convergent algorithms for the solution of inequality constrained minimization problems , 1995 .

[16]  Robert J. Vanderbei,et al.  An Interior-Point Algorithm for Nonconvex Nonlinear Programming , 1999, Comput. Optim. Appl..

[17]  Nicholas I. M. Gould,et al.  Constraint Preconditioning for Indefinite Linear Systems , 2000, SIAM J. Matrix Anal. Appl..

[18]  Stephen J. Wright,et al.  Numerical Optimization (Springer Series in Operations Research and Financial Engineering) , 2000 .

[19]  Nicholas I. M. Gould,et al.  Trust Region Methods , 2000, MOS-SIAM Series on Optimization.

[20]  Nicholas I. M. Gould,et al.  On the Solution of Equality Constrained Quadratic Programming Problems Arising in Optimization , 2001, SIAM J. Sci. Comput..

[21]  Thomas F. Coleman,et al.  A Preconditioned Conjugate Gradient Approach to Linear Equality Constrained Minimization , 2001, Comput. Optim. Appl..

[22]  D K Smith,et al.  Numerical Optimization , 2001, J. Oper. Res. Soc..

[23]  Sven Leyffer,et al.  Nonlinear programming without a penalty function , 2002, Math. Program..

[24]  Jorge J. Moré,et al.  Digital Object Identifier (DOI) 10.1007/s101070100263 , 2001 .

[25]  Michael A. Saunders,et al.  SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization , 2002, SIAM J. Optim..

[26]  Michael A. Saunders,et al.  USER’S GUIDE FOR SNOPT 5.3: A FORTRAN PACKAGE FOR LARGE-SCALE NONLINEAR PROGRAMMING , 2002 .

[27]  Roger Fletcher,et al.  On the global convergence of an SLP–filter algorithm that takes EQP steps , 2003, Math. Program..

[28]  Nicholas I. M. Gould,et al.  CUTEr and SifDec: A constrained and unconstrained testing environment, revisited , 2003, TOMS.

[29]  Nicholas I. M. Gould,et al.  An algorithm for nonlinear optimization using linear programming and equality constrained subproblems , 2004, Math. Program..

[30]  Nicholas I. M. Gould,et al.  Numerical methods for large-scale nonlinear optimization , 2005, Acta Numerica.

[31]  Nicholas I. M. Gould,et al.  On the Convergence of Successive Linear-Quadratic Programming Algorithms , 2005, SIAM J. Optim..

[32]  Donald Goldfarb,et al.  Interior-point ℓ2-penalty methods for nonlinear programming with strong global convergence properties , 2006, Math. Program..

[33]  Jorge Nocedal,et al.  An interior algorithm for nonlinear optimization that combines line search and trust region steps , 2006, Math. Program..

[34]  Jorge Nocedal,et al.  Knitro: An Integrated Package for Nonlinear Optimization , 2006 .

[35]  M. Friedlander,et al.  A Filter Active-Set Trust-Region Method , 2007 .

[36]  Jorge Nocedal,et al.  Steering exact penalty methods for nonlinear programming , 2008, Optim. Methods Softw..

[37]  Daniel P. Robinson,et al.  A second derivative SQP method with imposed descent , 2008 .

[38]  Nicholas I. M. Gould,et al.  A Second Derivative SQP Method: Global Convergence , 2010, SIAM J. Optim..

[39]  Nicholas I. M. Gould,et al.  A Second Derivative SQP Method: Local Convergence and Practical Issues , 2010, SIAM J. Optim..

[40]  Jorge Nocedal,et al.  A line search exact penalty method using steering rules , 2010, Mathematical Programming.

[41]  J. Nocedal,et al.  A Line Search Penalty Method for Nonlinear Optimization , .