A New Long-Step Path-Following Interior-Point Method with O(vnL) Iteration-Complexity Bound for Semidefinite Programming

Zengzhe Feng, Liang Fang. A New Long-Step Path-Following Interior-Point Method with O(vnL) Iteration-Complexity Bound for Semidefinite Programming. In Haiying Wang, Kay-Soon Low, Kexin Wei, Junqing Sun, editors, Fifth International Conference on Natural Computation, ICNC 2009, Tianjian, China, 14-16 August 2009, 6 Volumes. pages 293-298, IEEE Computer Society, 2009. [doi]

Abstract

Abstract is missing.