|
Abstract
|
In this paper, a new full-Newton step feasible interior-point method for convex quadratic
programming is presented and analyzed. The idea behind this method is to replace the complementarity condition with a non-negative weight vector and use the algebraic equivalent transformation
for the obtained equation. Under the selection of appropriate parameters, the quadratic rate of convergence of the new algorithm is established. In addition, the iteration complexity of the algorithm is
obtained. Finally, some numerical results are presented to demonstrate the practical performance of
the proposed algorithm
|