Optimization Online


Nonmonotone Filter Method for Nonlinear Optimization

Chungen Chen(shenchungen***at***gmail.com)
Roger Fletcher(fletcher***at***maths.dundee.ac.uk)
Sven Leyffer(leyffer***at***mcs.anl.gov)

Abstract: We propose a new nonmonotone filter method to promote global and fast local convergence for sequential quadratic programming algorithms. Our method uses two filters: a global g-filter for global convergence, and a local nonmonotone l-filter that allows us to establish fast local convergence. We show how to switch between the two filters efficiently, and we prove global and superlinear local convergence. A special feature of the proposed method is that it does not require second-order correction steps. We present preliminary numerical results comparing our implementation with a classical filter SQP method.

Keywords: Nonlinear optimization, nonmonotone filter, global convergence, local convergence

Category 1: Nonlinear Optimization

Category 2: Nonlinear Optimization (Constrained Nonlinear Optimization )

Citation: Preprint ANL/MCS-P1679-0909, Argonne National Laboratory, Mathematics and Computer Science Division, September 2009.

Download: [PDF]

Entry Submitted: 10/27/2009
Entry Accepted: 10/27/2009
Entry Last Modified: 10/27/2009

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