A new line search inexact restoration approach for nonlinear programming

A new general scheme for Inexact Restoration methods for Nonlinear Programming is introduced. After computing an inexactly restored point, the new iterate is determined in an approximate tangent affine subspace by means of a simple line search on a penalty function. This differs from previous methods, in which the tangent phase needs both a line search based on the objective function (or its Lagrangian) and a confirmation based on a penalty function or a filter decision scheme. Besides its simplicity the new scheme enjoys some nice theoretical properties. In particular, a key condition for the inexact restoration step could be weakened. To some extent this also enables the application of the new scheme to mathematical programs with complementarity constraints.

[1]  M. Teresa T. Monteiro,et al.  A filter inexact-restoration method for nonlinear programming , 2008 .

[2]  J. M. Martínez,et al.  Local Convergence of an Inexact-Restoration Method and Numerical Experiments , 2005 .

[3]  S. M. Robinson.  Stability Theory for Systems of Inequalities, Part II: Differentiable Nonlinear Systems , 1976 .

[4]  José Mario Martínez,et al.  Algorithm 813: SPG—Software for Convex-Constrained Optimization , 2001, TOMS.

[5]  Michal Kočvara,et al.  Nonsmooth approach to optimization problems with equilibrium constraints : theory, applications, and numerical results , 1998 .

[6]  J. Haslinger,et al.  Finite Element Approximation for Optimal Shape, Material and Topology Design , 1996 .

[7]  Zengxin Wei,et al.  On the Constant Positive Linear Dependence Condition and Its Application to SQP Methods , 1999, SIAM J. Optim..

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

[9]  José Mario Martínez,et al.  Nonmonotone Spectral Projected Gradient Methods on Convex Sets , 1999, SIAM J. Optim..

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

[11]  Elizabeth W. Karas,et al.  Global convergence of slanting filter methods for nonlinear programming , 2008, Appl. Math. Comput..

[12]  R. Andreani,et al.  On the Relation between Constant Positive Linear Dependence Condition and Quasinormality Constraint Qualification , 2005 .

[13]  M. Teresa T. Monteiro,et al.  A filter algorithm: comparison with NLP solvers , 2008, Int. J. Comput. Math..

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

[15]  J. M. Martínez,et al.  Inexact spectral projected gradient methods on convex sets , 2003 .

[16]  J. M. Martínez,et al.  Euler Discretization and Inexact Restoration for Optimal Control , 2007 .

[17]  José Mario Martínez,et al.  On the solution of mathematical programming problems with equilibrium constraints , 2001, Math. Methods Oper. Res..

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

[19]  José Mario Martínez,et al.  Spectral Projected Gradient Method with Inexact Restoration for Minimization with Nonconvex Constraints , 2009, SIAM J. Sci. Comput..

[20]  Roberto Andreani,et al.  An inexact-restoration method for nonlinear bilevel programming problems , 2009, Comput. Optim. Appl..