A convergence analysis of the scaling-invariant primal-dual path-following algorithms for second-order cone programming

In this paper we study primal-dual path-following algorithms for second-order cone programming problems (SOCP). We extend the standard long-step/semilong-step/short-step primal-dual path-following alogorithms for LP and SDP to SOCP, and prove that the long-step algorithm using the NT direction and the HRVW/KSH/M direction have O(n log epsilon(-1)) iteration-complexity and O(n(3/2) log epsilon(-1)) iteration-complexity, respectively, to reduce the duality gap by a factor of 1/epsilon, where n is the number of the second-order cones. We also show that the short and semilong-step algorithms using the NT direction and the HRVW/KSH/M direction have O(root n log epsilon(-1)) and O(n log epsilon(-1)) iteration-complexities, respectively.