ABSTRACT
In addition, when there are no constraints and variables are unrestricted, the quadratic programming problem is
minimize cTx+ 12x TQx
subject to x ∈ Rn. This problem will be referred to as the unconstrained quadratic program-
ming problem (UQP).
