@Article{JCM-15-2,
author = {},
title = {An SQP Algorithm with Nonmonotone Line Search for General Nonlinear Constrained Optimization Problem},
journal = {Journal of Computational Mathematics},
year = {1997},
volume = {15},
number = {2},
pages = {179--192},
abstract = {<p style="text-align: justify;">In this paper, an SQP type algorithm with a new nonmonotone line search technique for general constrained optimization problems is presented. The new algorithm does not have to solve the second order correction subproblems for each iterations, but still can circumvent the so-called Maratos effect. The algorithm&#39;s global convergence and superlinear convergent rate have been proved. In addition, we can prove that, after a few iterations, correction subproblems need not be solved, so computation amount of the algorithm will be decreased much more. Numerical experiments show that the new algorithm is effective.</p>},
issn = {1991-7139},
doi = {https://doi.org/1997-JCM-9198},
url = {https://global-sci.com/article/85742/an-sqp-algorithm-with-nonmonotone-line-search-for-general-nonlinear-constrained-optimization-problem}
}