Adaptive Barrier Update Strategies for Nonlinear Interior Methods

  • Authors:
  • Jorge Nocedal;Andreas Wächter;Richard A. Waltz

  • Affiliations:
  • nocedal@eecs.northwestern.edu and rwaltz@usc.edu;andreasw@watson.ibm.com;-

  • Venue:
  • SIAM Journal on Optimization
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper considers strategies for selecting the barrier parameter at every iteration of an interior-point method for nonlinear programming. Numerical experiments suggest that heuristic adaptive choices, such as Mehrotra's probing procedure, outperform monotone 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, and examines convergence failures of the Mehrotra predictor-corrector algorithm. 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.