Some algorithms for the convex quadratic programming problem via the ABS approach
This paper considers solving the convex quadratic programming problem. We solve the quadratic programming problem with only equality constraints by an ABS approach, using the active set strategy. The computational cost of some of the proposed algorithms is considerably less than the cost of classical recommended methods.
quadratic programming abs method kuhn tucker equations