Line search filter methods for nonlinear programming: Local convergence

Andreas Wächter*, Lorenz T. Biegler

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

142 Scopus citations

Abstract

A line search method is proposed for nonlinear programming using Fletcher and Leyffer's filter method, which replaces the traditional merit function. A simple modification of the method proposed in a companion paper [SIAM J. Optim., 16 (2005), pp. 1-31] introducing second order correction steps is presented. It is shown that the proposed method does not suffer from the Maratos effect, so that fast local convergence to second order sufficient local solutions is achieved.

Original languageEnglish (US)
Pages (from-to)32-48
Number of pages17
JournalSIAM Journal on Optimization
Volume16
Issue number1
DOIs
StatePublished - 2006

Keywords

  • Filter method
  • Line search
  • Local convergence
  • Maratos effect
  • Nonconvex constrained optimization
  • Nonlinear programming
  • Second order correction

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science

Fingerprint Dive into the research topics of 'Line search filter methods for nonlinear programming: Local convergence'. Together they form a unique fingerprint.

Cite this