DIRECT ELLIPSOID METHOD FOR CONVEX QUADRATIC PROGRAM
二次规划的直接椭球算法

This paper shows how to apply the ellipsoid method directly to the convex quadratic program, and proves that the direct ellipsoid method can be terminated at an approximate optimal point in at most O(n2 L) iterations with a total of O(n4L) arithmetic operations.