@Article{JCM-20-3,
author = {Zi-You, Gao and Tian-De, Guo and He, Guo-Ping and Wu, Fang},
title = {Sequential Systems of Linear Equations Algorithm for Nonlinear Optimization Problems ㅡ Inequality Constrained Problems},
journal = {Journal of Computational Mathematics},
year = {2002},
volume = {20},
number = {3},
pages = {301--312},
abstract = {<p style="text-align: justify;">In this paper, a new superlinearly convergent algorithm of sequential systems of linear equations (SSLE) for nonlinear optimization problems with inequality constraints is proposed. Since the new algorithm only needs to solve several systems of linear equations gaving a same coefficient matrix per iteration, the computation amount of the algorithm is much less than that of the existing SQP algorithms per iteration. Moreover, for the SQP type algorithms, there exist so-called inconsistent problems, i.e., quadratic programming subproblems of the SQP algorithms may not have a solution at some iterations, but this phenomenon will not occur with the SSLE algorithms because the related systems of linear equations always have solutions. Some numerical results are reported.</p>},
issn = {1991-7139},
doi = {https://doi.org/2002-JCM-8919},
url = {https://global-sci.com/article/85409/sequential-systems-of-linear-equations-algorithm-for-nonlinear-optimization-problems-inequality-constrained-problems}
}