Optimization Online


A Brief History of Filter Methods

R Fletcher (fletcher***at***maths.dundee.ac.uk)
S. Leyffer (LEYFFER***at***MCS.ANL.GOV)
Ph. L. Toint (philippe.toint***at***fundp.ac.be)

Abstract: We consider the question of global convergence of iterative methods for nonlinear programming problems. Traditionally, penalty functions have been used to enforce global convergence. In this paper we review a recent alternative, so-called filter methods. Instead of combing the objective and constraint violation into a single function, filter methods view nonlinear optimization as a biobjective optimization problem that minimizes the objective and the constraint violation. We outline the main ideas and convergence results of filter methods and indicate other areas where filter methods have been used successfully.

Keywords: Large-scale nonlinear programming, interior-point methods, sequential quadratic programming, filter methods

Category 1: Nonlinear Optimization

Category 2: Nonlinear Optimization (Constrained Nonlinear Optimization )

Citation: Preprint ANL/MCS-P1372-0906, Argonne National Laboratory, Mathematics and Computer Science Division, September 2006.

Download: [PDF]

Entry Submitted: 10/10/2006
Entry Accepted: 10/10/2006
Entry Last Modified: 10/10/2006

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society