Line Search Filter Methods for Nonlinear Programming: Local Convergence
Authors:
- Andreas WächterAWAndreas Wächter
- Lorenz T. BieglerLBLorenz T. Biegler
- 1 January 2005
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 16 (1) , 32-48
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.Keywords
This publication has 10 references indexed in Scilit:
- Nonlinear programming without a penalty functionMathematical Programming, 2002
- Global Convergence of a Trust-Region SQP-Filter Algorithm for General Nonlinear ProgrammingSIAM Journal on Optimization, 2002
- On the Global Convergence of a Filter--SQP AlgorithmSIAM Journal on Optimization, 2002
- Trust Region Methods2000
- Numerical Optimization1999
- Projected Hessian Updating Algorithms for Nonlinearly Constrained OptimizationSIAM Journal on Numerical Analysis, 1985
- On the Local Convergence of Quasi-Newton Methods for Constrained OptimizationSIAM Journal on Control and Optimization, 1982
- The watchdog technique for forcing convergence in algorithms for constrained optimization1982
- A globally convergent method for nonlinear programmingJournal of Optimization Theory and Applications, 1977
- Quasi-Newton Methods, Motivation and TheorySIAM Review, 1977