@Article{JCM-21-247,
author = {Juliang Zhang and Xiangsun Zhang},
title = {A Robust SQP Method for Optimization with Inequality Constraints},
journal = {Journal of Computational Mathematics},
year = {2003},
volume = {21},
number = {2},
pages = {247--256},
abstract = {<p style="text-align: justify;">A new algorithm for inequality constrained optimization is presented, which solves a linear programming subproblem and a quadratic subproblem at each iteration. The algorithm can circumvent the difficulties associated with the possible inconsistency of $QP$ subproblem of the original $SQP$ method. Moreover, the algorithm can converge to a point which satisfies a certain first-order necessary condition even if the original problem is itself infeasible. Under certain condition, some global convergence results are proved and local superlinear convergence results are also obtained. Preliminary numerical results are reported.</p>},
issn = {1991-7139},
doi = {https://doi.org/},
url = {http://global-sci.org/intro/article_detail/jcm/10279.html}
}