Exploiting Sparsity in Semidefinite Programming via Matrix Completion I

A critical disadvantage of primal-dual interior-point methods compared to dual interior-point methods for large scale semidefinite programs (SDPs) has been that the primal positive semidefinite mat...