Optimality conditions for quadratic programming

This paper establishes a set of necessary and sufficient conditions in order that a vectorx be a local minimum point to the general (not necessarily convex) quadratic programming problem:minimizepTx + 1/2xTQx, subject to the constraintsHx ≧ h.