Global and local convergence of a filter line search method for nonlinear programming
- 21 March 2007
- journal article
- research article
- Published by Taylor & Francis in Optimization Methods and Software
- Vol. 22 (3) , 365-390
Abstract
A framework for proving global convergence for a class of line search filter-type methods for nonlinear programming is presented without assuming that the Jacobian has full rank everywhere. The underlying method is based on the filter concept where trial points are accepted, provided there is a sufficient decrease in the objective function or constraints violation function. The proposed methods solve a sequence of quadratic programming subproblems via line search techniques to induce global convergence. Under mild conditions, we will also show that the algorithm converges two step superlinearly when the iterates are near to the solution.Keywords
This publication has 23 references indexed in Scilit:
- A globally convergent primal-dual interior-point filter method for nonlinear programmingMathematical Programming, 2003
- On the global convergence of an SLP-filter algorithm that takes EQP stepsMathematical Programming, 2003
- Non-monotone trust region methods for nonlinear equality constrained optimization without a penalty functionMathematical Programming, 2003
- 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
- A Nonmonotone Line Search Technique for Newton’s MethodSIAM Journal on Numerical Analysis, 1986
- Nonlinear programming via an exact penalty function: Asymptotic analysisMathematical Programming, 1982
- Reduced quasi-Newton methods with feasibility improvement for nonlinearly constrained optimization1982
- The watchdog technique for forcing convergence in algorithms for constrained optimization1982