In this paper, a new variant of the interior ellipsoid method for convex quadratic programming is developed. Compared to the algorithm proposed by Ye and Tse,the sub-problem of new algorithm is a linear programming which is easy to solve, although both have the same complexity.
Karmarkar, N. A New Polynomial-time Algorithm for Linear Programming, Combinatorica, 1984, 4:373-395.
Todd, Michael J. and Burell. An Extension of Karmarkar's Algorithm for Linear Programming Using Dual Variables, Algorithmica, 1986, 1:409-424.
Monteiro, R.D.C. and Adler, I. Interior Path Following Primal-dual Algorithm, part Ⅱ:Convex Quadratic Programming, Mathematical Programming, 1989, 44:43-66.
Barnes, E.R. A Variation on Karmarkar's Algorithm for Solving Linear Programming Problems,Mathematical Programming, 1986, 36:174-182.
Ye, Y. and Tse, E. An Extension of Karmarkar's Algorithm for Convex Quadratic Programming,Mathematical Programming, 1989, 47:157-179.
Dikin, LI. Iterative Solution of Problems of Linear and Quadratic Programming, Soviet Math. Dokl.,1967, 8:674-675.
Goldfarb, D. and Liu. An O(n3L) Primal Interior Point Algorithm for Convex Quadratic Programming. Mathematical Programming, 1991, 49:325-340.
Kapoor, S. and Vaidya, P. Fast Algorithm for Convex Quadratic Programming and Multicommodity Flows, Proceedings of the 18th Annual ACM Symposium on the Theory of Computing, 1986, 197-159.
Ben Daya, M. and Shetty, C.M. Polynomial Barrier Function Algorithm for Convex Quadratic Programming, Manuscript, School of Industrial and Systems Engineering, Georgia Institute of Technology (Atlanta, GA, 1988).
Ye, Y. Further Development on the Interior Algorithm for Convex Quadratic Programming, Manuscript, Department of Engineering-Economic Systems, Stanford, CA, 1987.
Mehrotra, S. and Sun, J. An Algorithm for Convex Quadratic Programming that Requies O(n3.5L) Arithmetic Operations, Mathematics of Operations Research, 1990, 15:342-363.
Gonzaga, C.C. An Algorithm for Solving Linear Programming Problems in O(n3.5L) Operations, in Megiddo, ed., Advances in Mathematical Programming-Interior Point and Related Method Chapter 1,Springer, Berlin, 1989.
Jarre, F. On the Convergence of the Method of Analytic Centers When Applied to Convex Quadatic Programs, Mathematical Programming, 1991, 49:341-358.