%0 Journal Article
%T DIRECT ELLIPSOID METHOD FOR CONVEX QUADRATIC PROGRAM<br>二次规划的直接椭球算法
%A WU SHI-QUAN
%A GUO TIAN-DE
%A <br>吴士泉
%J 系统科学与数学
%D 1996
%I 
%X 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.
%K Direct ellipsoid method
%K computational complexity
%K interior point method
%K convex quadratic program<br>直接椭球算法，算法的复杂度，内点算法，凸二次规划
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=6E709DC38FA1D09A4B578DD0906875B5B44D4D294832BB8E&cid=37F46C35E03B4B86&jid=0CD45CC5E994895A7F41A783D4235EC2&aid=ABFED79D04BCF84B603A0688C6AD3F6D&yid=8A15F8B0AA0E5323&vid=7801E6FC5AE9020C&iid=CA4FD0336C81A37A&sid=6E5881F2FFE5E466&eid=EC481BF121090F0C&journal_id=1000-0577&journal_name=系统科学与数学&referenced_num=0&reference_num=0