@Article{JCM-24-5,
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 = {<p style="text-align: justify;">In&nbsp;[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.</p>},
issn = {1991-7139},
doi = {https://doi.org/2006-JCM-8778},
url = {https://global-sci.com/article/85104/a-new-sqp-filter-method-for-solving-nonlinear-programming-problems}
}