Assessing the reliability of general-purpose Inexact Restoration methods

Inexact Restoration methods have been proved to be effective to solve constrained optimization problems in which some structure of the feasible set induces a natural way of recovering feasibility from arbitrary infeasible points. Sometimes natural ways of dealing with minimization over tangent approximations of the feasible set are also employed. A recent paper Banihashemi and Kaya (2013)] suggests that the Inexact Restoration approach can be competitive with well-established nonlinear programming solvers when applied to certain control problems without any problem-oriented procedure for restoring feasibility. This result motivated us to revisit the idea of designing general-purpose Inexact Restoration methods, especially for large-scale problems. In this paper we introduce affordable algorithms of Inexact Restoration type for solving arbitrary nonlinear programming problems and we perform the first experiments that aim to assess their reliability. Initially, we define a purely local Inexact Restoration algorithm with quadratic convergence. Then, we modify the local algorithm in order to increase the chances of success of both the restoration and the optimization phase. This hybrid algorithm is intermediate between the local algorithm and a globally convergent one for which, under suitable assumptions, convergence to KKT points can be proved.

[1]  C. Yalçin Kaya,et al.  Inexact Restoration for Runge-Kutta Discretization of Optimal Control Problems , 2010, SIAM J. Numer. Anal..

[2]  Andreas Fischer,et al.  A new line search inexact restoration approach for nonlinear programming , 2010, Comput. Optim. Appl..

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

[4]  L. F. Bueno.  A Flexible Inexact Restoration Method and Application to Multiobjective Constrained Optimization , 2014 .

[5]  Elvio A. Pilotta,et al.  Numerical comparison of merit function with filter criterion in inexact restoration algorithms using hard-spheres problems , 2009, Comput. Optim. Appl..

[6]  C. Lanczos.  An iteration method for the solution of the eigenvalue problem of linear differential and integral operators , 1950 .

[7]  Lorenz T. Biegler,et al.  On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming , 2006, Math. Program..

[8]  E. W. Karas,et al.  Local convergence of filter methods for equality constrained non-linear programming , 2010 .

[9]  R. Mifflin.  Semismooth and Semiconvex Functions in Constrained Optimization , 1977 .

[10]  C. Yalçin Kaya,et al.  Inexact Restoration for Euler Discretization of Box-Constrained Optimal Control Problems , 2013, J. Optim. Theory Appl..

[11]  Liqun Qi,et al.  A nonsmooth version of Newton's method , 1993, Math. Program..

[12]  José Mario Martínez,et al.  On Augmented Lagrangian Methods with General Lower-Level Constraints , 2007, SIAM J. Optim..

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

[14]  K. Jittorntrum.  Sequential algorithms in nonlinear programming , 1978, Bulletin of the Australian Mathematical Society.

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

[16]  J. M. Martínez,et al.  On sequential optimality conditions for smooth constrained optimization , 2011 .

[17]  José Mario Martínez,et al.  A Flexible Inexact-Restoration Method for Constrained Optimization , 2015, J. Optim. Theory Appl..

[18]  José Mario Martínez,et al.  Augmented Lagrangian methods under the constant positive linear dependence constraint qualification , 2007, Math. Program..

[19]  Liqun Qi,et al.  Convergence Analysis of Some Algorithms for Solving Nonsmooth Equations , 1993, Math. Oper. Res..

[20]  José Mario Martínez,et al.  Inexact Restoration Method for Derivative-Free Optimization with Smooth Constraints , 2013, SIAM J. Optim..

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

[22]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[23]  José Mario Martínez,et al.  Generalization of the Methods of Brent and Brown for Solving Nonlinear Simultaneous Equations , 1979 .

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

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

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

[27]  José Mario Martínez,et al.  Outer Trust-Region Method for Constrained Optimization , 2011, J. Optim. Theory Appl..

[28]  Paulo J. S. Silva,et al.  Two New Weak Constraint Qualifications and Applications , 2012, SIAM J. Optim..

[29]  K. Jittorntrum.  Solution point differentiability without strict complementarity in nonlinear programming , 1984 .

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

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

[32]  José Mario Martínez,et al.  Inexact restoration method for minimization problems arising in electronic structure calculations , 2011, Comput. Optim. Appl..

[33]  Alexey F. Izmailov,et al.  Some composite-step constrained optimization methods interpreted via the perturbed sequential quadratic programming framework , 2015, Optim. Methods Softw..

[34]  Anthony V. Fiacco,et al.  Introduction to Sensitivity and Stability Analysis in Nonlinear Programming , 2012 .