Global convergence of a tri-dimensional filter SQP algorithm based on the line search method

  • Shen C
  • Xue W
  • Pu D
  • 3


    Mendeley users who have this article in their library.
  • 18


    Citations of this article.


In this paper, we propose a new filter line search SQP method in which the violations of equality and inequality constraints are considered separately. Thus the filter in our algorithm is composed by three components: objective function value, equality and inequality constraints violations. The filter with three components accepts reasonable steps flexibly, comparing that with two components. The new filter shares some features with the Chin and Fletcher's approach, namely the "slanting envelope" and the "inclusion property". Under mild conditions, the filter line search SQP method is proven to be globally convergent. Numerical experiments also show the efficiency of our method. © 2008 IMACS.

Author-supplied keywords

  • Backtracking
  • Constrained optimization problem
  • Filter
  • Line search method
  • SQP

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free