A Globally Convergent Filter Method for Nonlinear Programming
Authors:
- Clóvis C. GonzagaCGClóvis C. Gonzaga
- Elizabeth KarasEKElizabeth Karas
- Márcia VantiMVMárcia Vanti
- 1 January 2004
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 14 (3) , 646-669
Abstract
In this paper we present a filter algorithm for nonlinear programming and prove its global convergence to stationary points. Each iteration is composed of a feasibility phase, which reduces a measure of infeasibility, and an optimality phase, which reduces the objective function in a tangential approximation of the feasible set. These two phases are totally independent, and the only coupling between them is provided by the filter. The method is independent of the internal algorithms used in each iteration, as long as these algorithms satisfy reasonable assumptions on their efficiency. Under standard hypotheses, we show two results: for a filter with minimum size, the algorithm generates a stationary accumulation point; for a slightly larger filter, all accumulation points are stationary.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
- Inexact-Restoration Method with Lagrangian Tangent Decrease and New Merit Function for Nonlinear ProgrammingJournal of Optimization Theory and Applications, 2001
- A trust region method based on interior point techniques for nonlinear programmingMathematical Programming, 2000
- Inexact-Restoration Algorithm for Constrained Optimization1Journal of Optimization Theory and Applications, 2000
- Numerical Optimization1999
- An Interior Point Algorithm for Large-Scale Nonlinear ProgrammingSIAM Journal on Optimization, 1999
- A Trust Region Strategy for Equality Constrained Optimization1984
- CONVERGENCE PROPERTIES OF A CLASS OF MINIMIZATION ALGORITHMS1975
- The Gradient Projection Method for Nonlinear Programming. Part I. Linear ConstraintsJournal of the Society for Industrial and Applied Mathematics, 1960