On the global convergence of an SLP–filter algorithm that takes EQP steps

Abstract. A global convergence proof is presented for a class of trust region filter–type methods for nonlinear programming. Such methods are characterized by their use of the dominance concept of multiobjective optimization, instead of a penalty parameter whose adjustment can be problematic. The methods are based on successively solving linear programming subproblems for which effective software is readily available. The methods also permit the use of steps calculated on the basis of an equality constrained quadratic programming model, which enables rapid convergence to take place for problems in which second order information is important. The proof technique is presented in a fairly general context, allowing a range of specific algorithm choices associated with choosing the quadratic model, updating the trust region radius and with feasibility restoration.

[1]  K. Madsen.  An Algorithm for Minimax Solution of Overdetermined Systems of Non-linear Equations , 1975 .

[2]  Richard A. Tapia,et al.  A trust region strategy for nonlinear equality constrained op-timization , 1984 .

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

[4]  M. El-Alem.  A global convergence theory for the Celis-Dennis-Tapia trust-region algorithm for constrained optimization , 1991 .

[5]  Ya-Xiang Yuan,et al.  A trust region algorithm for equality constrained optimization , 1990, Math. Program..

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

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

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

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

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

[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]  Stefan Ulbrich,et al.  Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty function , 2003, Math. Program..

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

[14]  Charles Audet,et al.  A Pattern Search Filter Method for Nonlinear Programming without Derivatives , 2001, SIAM J. Optim..

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