Discovery - University of Dundee - Online Publications

Library & Learning Centre

On the global convergence of an SLP-filter algorithm that takes EQP steps

On the global convergence of an SLP-filter algorithm that takes EQP steps

Research output: Contribution to journalArticle

View graph of relations


  • Choong Ming Chin
  • Roger Fletcher

Research units


Original languageEnglish
Number of pages17
JournalMathematical Programming
Journal publication dateApr 2003


A global convergence proof is presented for a class of trust region filter-type methods for nonlinear programming. Such methods are characterized by their use of the dominance concept of multiobjective optimization, instead of a penalty parameter whose adjustment can be problematic, The methods are based on successively solving linear programming subproblems for which effective software is readily available. The methods also permit the use of steps calculated on the basis of an equality constrained quadratic programming model, which enables rapid convergence to take place for problems in which second order information is important.

The proof technique is presented in a fairly general context, allowing a range of specific algorithm choices associated with choosing the quadratic model, updating the trust region radius and with feasibility restoration.


Library & Learning Centre

Contact | Accessibility | Policy