Line Search Filter Methods for Nonlinear Programming: Motivation and Global Convergence

  • Wächter A
  • Biegler L
  • 77


    Mendeley users who have this article in their library.
  • 184


    Citations of this article.


Line search methods are proposed for nonlinear programming using
Fletcher and Leyffer's filter method {[} Math. Program., 91 ( 2002), pp.
239 - 269], which replaces the traditional merit function. Their global
convergence properties are analyzed. The presented framework is applied
to active set sequential quadratic programming (SQP) and barrier
interior point algorithms. Under mild assumptions it is shown that every
limit point of the sequence of iterates generated by the algorithm is
feasible, and that there exists at least one limit point that is a
stationary point for the problem under consideration. A new alternative
filter approach employing the Lagrangian function instead of the
objective function with identical global convergence properties is
briefly discussed.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


  • Andreas Wächter

  • Lorenz T. Biegler

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free