Adaptive Barrier Strategies for Nonlinear Interior Methods

This paper considers strategies for selecting the barrier parameter at every iteration of an interior-point method for nonlinear programming. Numerical experiments suggest that adaptive choices, such as Mehrotra’s probing procedure, outperform static strategies that hold the barrier parameter fixed until a barrier optimality test is satisfied. A new adaptive strategy is proposed based on the minimization of a quality function. The paper also proposes a globalization framework that ensures the convergence of adaptive interior methods. The barrier update strategies proposed in this paper are applicable to a wide class of interior methods and are tested in the two distinct algorithmic frameworks provided by the ipopt and knitro software packages.

[1]  Anthony V. Fiacco,et al.  Nonlinear programming;: Sequential unconstrained minimization techniques , 1968 .

[2]  Sanjay Mehrotra,et al.  On the Implementation of a Primal-Dual Interior Point Method , 1992, SIAM J. Optim..

[3]  T. Tsuchiya,et al.  On the formulation and theory of the Newton interior-point method for nonlinear programming , 1996 .

[4]  Stephen J. Wright.  Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

[5]  Stephen J. Wright,et al.  PCx user guide , 1997 .

[6]  Hiroshi Yamashita.  A globally convergent primal-dual interior point method for constrained optimization , 1998 .

[7]  Michael L. Overton,et al.  A Primal-dual Interior Method for Nonconvex Nonlinear Programming , 1998 .

[8]  Anders Forsgren,et al.  Primal-Dual Interior Methods for Nonconvex Nonlinear Programming , 1998, SIAM J. Optim..

[9]  Robert J. Vanderbei,et al.  An Interior-Point Algorithm for Nonconvex Nonlinear Programming , 1999, Comput. Optim. Appl..

[10]  Csaba Mészáros,et al.  Steplengths in interior-point algorithms of quadratic programming , 1999, Oper. Res. Lett..

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

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

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

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

[15]  Andreas Wächter,et al.  A Primal-Dual Interior-Point Method for Nonlinear Programming with Strong Global and Local Convergence Properties , 2003, SIAM J. Optim..

[16]  David G. Luenberger,et al.  Linear and Nonlinear Programming: Second Edition , 2003 .

[17]  Nicholas I. M. Gould,et al.  CUTEr and SifDec: A constrained and unconstrained testing environment, revisited , 2003, TOMS.

[18]  Lorenz T. Biegler,et al.  Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence , 2005, SIAM J. Optim..

[19]  Hiroshi Yamashita,et al.  A globally and superlinearly convergent primal-dual interior point trust region method for large scale constrained optimization , 2005, Math. Program..

[20]  Donald Goldfarb,et al.  Interior-point ℓ2-penalty methods for nonlinear programming with strong global convergence properties , 2006, Math. Program..

[21]  Jorge Nocedal,et al.  An interior algorithm for nonlinear optimization that combines line search and trust region steps , 2006, Math. Program..

[22]  Jorge Nocedal,et al.  Steplength selection in interior-point methods for quadratic programming , 2007, Appl. Math. Lett..

[23]  Nicholas I. M. Gould,et al.  An Interior-Point l 1 -Penalty Method for Nonlinear Optimization , 2010 .