Global Convergence of a Non-monotone Trust-Region Filter Algorithm for Nonlinear Programming

A non-monotone variant of the trust-region SQP-filter algorithm analyzed in Fletcher et al (SIAM J. Opt. 13(3), 2002, pp. 653–659) is defined, that directly uses the dominated area of the filter as an acceptability criterion for trial points. It is proved that, under reasonable assumptions and for all possible choices of the starting point, the algorithm generates at least a subsequence converging to a first-order critical point.

[1]  A. Vardi.  A Trust Region Algorithm for Equality Constrained Minimization: Convergence Properties and Implementation , 1985 .

[2]  Richard H. Byrd,et al.  A Trust Region Algorithm for Nonlinearly Constrained Optimization , 1987 .

[3]  P. Toint.  Global Convergence of a a of Trust-Region Methods for Nonconvex Minimization in Hilbert Space , 1988 .

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

[5]  Nicholas I. M. Gould,et al.  Global Convergence of a Class of Trust Region Algorithms for Optimization Using Inexact Projections on Convex Constraints , 1993, SIAM J. Optim..

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

[7]  Richard A. Tapia,et al.  An Inexact Trust-Region Feasible-Point Algorithm for Nonlinear Systems of Equalities and Inequalitie , 1995 .

[8]  Annick Sartenaer,et al.  Automatic Determination of an Initial Trust Region in Nonlinear Programming , 1997, SIAM J. Sci. Comput..

[9]  Philippe L. Toint,et al.  Non-monotone trust-region algorithms for nonlinear optimization subject to convex constraints , 1997, Math. Program..

[10]  John E. Dennis,et al.  On the Convergence Theory of Trust-Region-Based Algorithms for Equality-Constrained Optimization , 1997, SIAM J. Optim..

[11]  John E. Dennis,et al.  A Global Convergence Theory for General Trust-Region-Based Algorithms for Equality Constrained Optimization , 1997, SIAM J. Optim..

[12]  Sven Leyffer,et al.  User manual for filterSQP , 1998 .

[13]  J. E. DENNIS,et al.  A Trust-Region Approach to Nonlinear Systems of Equalities and Inequalities , 1999, SIAM J. Optim..

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

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

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

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

[18]  Lorenz T. Biegler,et al.  Global and Local Convergence of Line Search Filter Methods for Nonlinear Programming , 2002 .

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

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