arrow
Volume 24, Issue 5
A New SQP-Filter Method for Solving Nonlinear Programming Problems

Duoquan Li

J. Comp. Math., 24 (2006), pp. 609-634.

Published online: 2006-10

Export citation
  • Abstract

In [4], Fletcher and Leyffer present a new method that solves nonlinear programming problems without a penalty function by SQP-Filter algorithm. It has attracted much attention due to its good numerical results. In this paper we propose a new SQP-Filter method which can overcome Maratos effect more effectively. We give stricter acceptant criteria when the iterative points are far from the optimal points and looser ones vice-versa. About this new method, the proof of global convergence is also presented under standard assumptions. Numerical results show that our method is efficient.

  • AMS Subject Headings

  • Copyright

COPYRIGHT: © Global Science Press

  • Email address
  • BibTex
  • RIS
  • TXT
@Article{JCM-24-609, author = {}, title = {A New SQP-Filter Method for Solving Nonlinear Programming Problems}, journal = {Journal of Computational Mathematics}, year = {2006}, volume = {24}, number = {5}, pages = {609--634}, abstract = {

In [4], Fletcher and Leyffer present a new method that solves nonlinear programming problems without a penalty function by SQP-Filter algorithm. It has attracted much attention due to its good numerical results. In this paper we propose a new SQP-Filter method which can overcome Maratos effect more effectively. We give stricter acceptant criteria when the iterative points are far from the optimal points and looser ones vice-versa. About this new method, the proof of global convergence is also presented under standard assumptions. Numerical results show that our method is efficient.

}, issn = {1991-7139}, doi = {https://doi.org/}, url = {http://global-sci.org/intro/article_detail/jcm/8778.html} }
TY - JOUR T1 - A New SQP-Filter Method for Solving Nonlinear Programming Problems JO - Journal of Computational Mathematics VL - 5 SP - 609 EP - 634 PY - 2006 DA - 2006/10 SN - 24 DO - http://doi.org/ UR - https://global-sci.org/intro/article_detail/jcm/8778.html KW - Nonlinear programming, Sequential quadratic programming, Filter, Restoration phase, Maratos affects, Global convergence, Multi-objective optimization, Quadratic programming subproblem. AB -

In [4], Fletcher and Leyffer present a new method that solves nonlinear programming problems without a penalty function by SQP-Filter algorithm. It has attracted much attention due to its good numerical results. In this paper we propose a new SQP-Filter method which can overcome Maratos effect more effectively. We give stricter acceptant criteria when the iterative points are far from the optimal points and looser ones vice-versa. About this new method, the proof of global convergence is also presented under standard assumptions. Numerical results show that our method is efficient.

Duoquan Li. (1970). A New SQP-Filter Method for Solving Nonlinear Programming Problems. Journal of Computational Mathematics. 24 (5). 609-634. doi:
Copy to clipboard
The citation has been copied to your clipboard