A smoothing Newton-type algorithm of stronger convergence for the quadratically constrained convex quadratic programming

摘要

In this paper we propose a smoothing Newton-type algorithm for the problem of minimizing a convex quadratic function subject to finitely many convex quadratic inequality constraints. The algorithm is shown to converge globally and possess stronger local superlinear convergence. Preliminary numerical results are also reported.