A Newton-type method for convex quadratic programming

Abstract

In this paper it is talked over Newton-type method for the problem of minimizing a convex quadratic function subject to linear constraints. The determination of the Karush-Kuhn-Tucker system solution is reduced to the solving of a nonlinear system of equations with continuously differentiable functions.