@Article{JCM-22-5,
author = {Pu, Dingguo and Zhou, Yan and Zhang, Haiyan},
title = {A QP Free Feasible Method},
journal = {Journal of Computational Mathematics},
year = {2004},
volume = {22},
number = {5},
pages = {651--660},
abstract = {<p style="text-align: justify;">In [12], a QP free feasible method was proposed for the minimization of a smooth function subject to smooth inequality constraints. This method is based on the solutions of linear systems of equations, the reformulation of the KKT optimality conditions by using the Fischer-Burmeister NCP function. This method ensures the feasibility of all iterations. In this paper, we modify the method in [12] slightly to obtain the local convergence under some weaker conditions. In particular, this method is implementable and globally convergent without assuming the linear independence of the gradients of active constrained functions and the uniformly positive definiteness of the submatrix obtained by the Newton or Quasi Newton methods. We also prove that the method has superlinear convergence rate under some mild conditions. Some preliminary numerical results indicate that this new QP free feasible method is quite promising. &nbsp;</p>},
issn = {1991-7139},
doi = {https://doi.org/2004-JCM-8864},
url = {https://global-sci.com/article/85251/a-qp-free-feasible-method}
}