A trust-region SQP method without a penalty or a filter for nonlinear programming

In this paper we present a new trust-region SQP algorithm for nonlinear programming. This method avoids using a penalty function, nor a filter, and instead establishes a new step acceptance mechanism. Under some reasonable assumptions, the method can be proved to be globally convergent to a KT point. Preliminary numerical experiments are presented that show the potential efficiency of the new approach.

[1]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[2]  Ya-Xiang Yuan,et al.  A Sequential Quadratic Programming Method Without A Penalty Function or a Filter for Nonlinear Equality Constrained Optimization , 2011, SIAM J. Optim..

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

[4]  C. Kanzow,et al.  Inexact Trust-Region Methods for Nonlinear Complementarity Problems , 1998 .

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

[6]  Shih-Ping Han.  A globally convergent method for nonlinear programming , 1975 .

[7]  Masao Fukushima,et al.  A Trust Region Method for Solving Generalized Complementarity Problems , 1998, SIAM J. Optim..

[8]  R. Fletcher,et al.  A nonmonotone filter method for nonlinear optimization , 2012, Comput. Optim. Appl..

[9]  Francisco A. M. Gomes,et al.  Dynamic Control of Infeasibility in Equality Constrained Optimization , 2008, SIAM J. Optim..

[10]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

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

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

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

[14]  Nicholas I. M. Gould,et al.  Nonlinear programming without a penalty function or a filter , 2010, Math. Program..

[15]  Stefan Ulbrich.  On the superlinear local convergence of a filter-SQP method , 2004, Math. Program..

[16]  Clóvis C. Gonzaga,et al.  A Globally Convergent Filter Method for Nonlinear Programming , 2003, SIAM J. Optim..

[17]  Lorenz T. Biegler,et al.  Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence , 2005, SIAM J. Optim..

[18]  Sven Leyffer,et al.  On the Global Convergence of a Filter--SQP Algorithm , 2002, SIAM J. Optim..

[19]  Klaus Schittkowski,et al.  Test examples for nonlinear programming codes , 1980 .

[21]  J. M. Martínez,et al.  Inexact-Restoration Method with Lagrangian Tangent Decrease and New Merit Function for Nonlinear Programming , 2001 .

[22]  Nicholas I. M. Gould,et al.  Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear Programming , 2002, SIAM J. Optim..

[23]  Ya-Xiang Yuan,et al.  Trust Region Algorithms for Nonlinear Equations , 1994 .