Modified Interior-Point Method for Large-and-Sparse Low-Rank Semidefinite Programs

Abstract

Semidefinite programs (SDPs) are powerful theoretical tools that have been studied for over two decades, but their practical use remains limited due to computational difficulties in solving large-scale, realistic-sized problems. In this paper, we describe a modified interior-point method for the efficient solution of large-and-sparse low-rank SDPs, which finds applications in graph theory, approximation theory, control theory, sum-of-squares, etc. Given that the problem data is large-and-sparse, conjugate gradients (CG) can be used to avoid forming, storing, and factoring the large and fully-dense interior-point Hessian matrix, but the resulting convergence rate is usually slow due to ill-conditioning. Our central insight is that, for a rank-$k$, size-$n$ SDP, the Hessian matrix is ill-conditioned only due to a rank-$nk$ perturbation, which can be explicitly computed using a size-$n$ eigendecomposition. We construct a preconditioner to "correct" the low-rank perturbation, thereby allowing preconditioned CG to solve the Hessian equation in a few tens of iterations. This modification is incorporated within SeDuMi, and used to reduce the solution time and memory requirements of large-scale matrix-completion problems by several orders of magnitude.

8 pages, 2 figures

Cited by in corpus (4)

• Conic Optimization Theory: Convexification Techniques and Numerical Algorithms
• Graphical Lasso and Thresholding: Equivalence and Closed-form Solutions
• PNKH-B: A Projected Newton-Krylov Method for Large-Scale Bound-Constrained Optimization
• A Preconditioned Iterative Interior Point Approach to the Conic Bundle Subproblem