Mathematical Programming Computation, Volume 11, Issue 3, September 2019

Font Size:  Small  Medium  Large

Sieve-SDP: a simple facial reduction algorithm to preprocess semidefinite programs

Yuzixuan Zhu, Gábor Pataki, Quoc Tran-Dinh

Abstract


We introduce Sieve-SDP, a simple facial reduction algorithm to preprocess semidefinite programs (SDPs). Sieve-SDP inspects the constraints of the problem to detect lack of strict feasibility, deletes redundant rows and columns, and reduces the size of the variable matrix. It often detects infeasibility. It does not rely on any optimization solver: the only subroutine it needs is Cholesky factorization, hence it can be implemented in a few lines of code in machine precision. We present extensive computational results on several problem collections from the literature, with many SDPs coming from polynomial optimization.

Full Text: PDF

mpc footer
© MPS 2008-2019