A Globally Convergent Filter Method for Nonlinear Programming

In this paper we present a filter algorithm for nonlinear programming and prove its global convergence to stationary points. Each iteration is composed of a feasibility phase, which reduces a measure of infeasibility, and an optimality phase, which reduces the objective function in a tangential approximation of the feasible set. These two phases are totally independent, and the only coupling between them is provided by the filter. The method is independent of the internal algorithms used in each iteration, as long as these algorithms satisfy reasonable assumptions on their efficiency. Under standard hypotheses, we show two results: for a filter with minimum size, the algorithm generates a stationary accumulation point; for a slightly larger filter, all accumulation points are stationary.

[1]  J. M. Martínez,et al.  Inexact-Restoration Algorithm for Constrained Optimization1 , 2000 .

[2]  Benar Fux Svaiter,et al.  A Practical Optimality Condition Without Constraint Qualifications for Nonlinear Programming , 2003 .

[3]  M. Powell.  CONVERGENCE PROPERTIES OF A CLASS OF MINIMIZATION ALGORITHMS , 1975 .

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

[5]  L. Vicente,et al.  A Globally Convergent Primal-Dual Interior-Point Filter Method for Nonconvex Nonlinear Programming , 2000 .

[6]  Stefan Ulbrich,et al.  A globally convergent primal-dual interior-point filter method for nonlinear programming , 2004, Math. Program..

[7]  Jorge Nocedal,et al.  A trust region method based on interior point techniques for nonlinear programming , 2000, Math. Program..

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

[9]  Jorge Nocedal,et al.  An Interior Point Algorithm for Large-Scale Nonlinear Programming , 1999, SIAM J. Optim..

[10]  J. B. Rosen.  The Gradient Projection Method for Nonlinear Programming. Part I. Linear Constraints , 1960 .

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

[12]  M. R. Celis.  A TRUST REGION STRATEGY FOR NONLINEAR EQUALITY CONSTRAINED OPTIMIZATION (NONLINEAR PROGRAMMING, SEQUENTIAL QUADRATIC) , 1985 .

[13]  J. B. Rosen.  The gradient projection method for nonlinear programming: Part II , 1961 .

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

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

[16]  José Mario Martínez,et al.  Inexact Restoration Methods for Nonlinear Programming: Advances and Perspectives , 2005 .

[17]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

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