A Faster Small Treewidth SDP Solver

Abstract

Semidefinite programming is a fundamental tool in optimization and theoretical computer science. It has been extensively used as a black-box for solving many problems, such as embedding, complexity, learning, and discrepancy. One natural setting of semidefinite programming is the small treewidth setting. The best previous SDP solver under small treewidth setting is due to Zhang-Lavaei '18, which takes $n^{1.5}{\tau }^{6.5}$ time. In this work, we show how to solve a semidefinite programming with $n\times n$ variables, $m$ constraints and $\tau$ treewidth in $n{\tau }^{2\omega +0.5}$ time, where $\omega <2.373$ denotes the exponent of matrix multiplication. We give the first SDP solver that runs in time in linear in number of variables under this setting. In addition, we improve the running time that solves a linear programming with tau treewidth from $n{\tau }^2$ (Dong-Lee-Ye '21) to $n{\tau }^{(\omega +1)/2}$.