Line Search Filter Methods for Nonlinear Programming: Local Convergence

نویسندگان

  • Andreas Wächter
  • Lorenz T. Biegler
چکیده

A line search method is proposed for nonlinear programming using Fletcher and Leyffer’s filter method, which replaces the traditional merit function. Global convergence properties of this method was analyzed in a companion paper. Here a simple modification of the method 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 strict local solutions is achieved.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Global and Local Convergence of Line Search Filter Methods for Nonlinear Programming

Line search methods for nonlinear programming using Fletcher and Leyffer’s filter method, which replaces the traditional merit function, are proposed and their global and local convergence properties are analyzed. Previous theoretical work on filter methods has considered trust region algorithms and only the question of global convergence. The presented framework is applied to barrier interior ...

متن کامل

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

Line search methods are proposed for nonlinear programming using Fletcher and Leyffer’s filter method, which replaces the traditional merit function. Their global convergence properties are analyzed. The presented framework is applied to active set SQP and barrier interior point algorithms. Under mild assumptions it is shown that every limit point of the sequence of iterates generated by the al...

متن کامل

A Filter Algorithm with Inexact Line Search

A filter algorithm with inexact line search is proposed for solving nonlinear programming problems. The filter is constructed by employing the norm of the gradient of the Lagrangian function to the infeasibility measure. Transition to superlinear local convergence is showed for the proposed filter algorithm without second-order correction. Under mild conditions, the global convergence can also ...

متن کامل

On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming

We present a primal-dual interior-point algorithm with a filter line-search method for nonlinear programming. Local and global convergence properties of this method were analyzed in previous work. Here we provide a comprehensive description of the algorithm, including the feasibility restoration phase for the filter method, second-order corrections, and inertia correction of the KKT matrix. Heu...

متن کامل

A Filter SQP Method: Local Convergence and Numerical Results

The work by Gould, Loh, and Robinson [A filter method with unified step computation for nonlinear optimization, SIAM J. Optim., 24 (2014), pp. 175–209 ] established global convergence of a new filter line search method for finding local first-order solutions to nonlinear and nonconvex constrained optimization problems. A key contribution of that work was that the search direction was computed u...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM Journal on Optimization

دوره 16  شماره 

صفحات  -

تاریخ انتشار 2005