Newton’s Method for Solving Quadratic Programming Problems with Simple Constraints

Abstract

In this paper the convex quadratic programming problem with simple constraints, following judicious transformations of Karush-Kuhn-Tucker optimality conditions, is reduced to solving a system of smooth equations. In order to solve the obtained system of equations, the Newton’s method, which provides a quadratic speed of convergence, is applied.