A comparative analysis of some methods for solving quadratic programming problems

Abstract

The problem of quadratic programming is that of minimizing a convex function subject linear constraints. It is one of the simplest cases of nonlinear programming.