@Article{JCM-24-5,
author = {},
title = {A New Constraints Identification Technique-Based QP-Free Algorithm for the Solution of Inequality Constrained Minimization Problems},
journal = {Journal of Computational Mathematics},
year = {2006},
volume = {24},
number = {5},
pages = {591--608},
abstract = {<p style="text-align: justify;">In this paper, we propose a feasible QP-free method for solving nonlinear inequality constrained optimization problems. A new working set is proposed to estimate the active set. Specially, to determine the working set, the new method makes use of the multiplier information from the previous iteration, eliminating the need to compute a multiplier function. At each iteration, two or three reduced symmetric systems of linear equations with a common coefficient matrix involving only constraints in the working set are solved, and when the iterate is sufficiently close to a KKT point, only two of them are involved. Moreover, the new algorithm is proved to be globally convergent to a KKT point under mild conditions. Without assuming the strict complementarity, the convergence rate is superlinear under a condition weaker than the strong second-order sufficiency condition. Numerical experiments illustrate the efficiency of the algorithm.</p>},
issn = {1991-7139},
doi = {https://doi.org/2006-JCM-8777},
url = {https://global-sci.com/article/85103/a-new-constraints-identification-technique-based-qp-free-algorithm-for-the-solution-of-inequality-constrained-minimization-problems}
}