REVIEW 1 cited by
Exploring chordal sparsity in semidefinite programming with sparse plus low-rank data matrices
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Semidefinite programming (SDP) problems are challenging to solve because of their high dimensionality. However, solving sparse SDP problems with small tree-width are known to be relatively easier because: (1) they can be decomposed into smaller multi-block SDP problems through chordal conversion; (2) they have low-rank optimal solutions. In this paper, we study more general SDP problems whose coefficient matrices have sparse plus low-rank (SPLR) structure. We develop a unified framework to convert such problems into sparse SDP problems with bounded tree-width. Based on this, we derive rank bounds for SDP problems with SPLR structure, which are tight in the worst case.
Forward citations
Cited by 1 Pith paper
-
Convex relaxation approaches for high-dimensional optimal transport
High-dimensional optimal transport cost can be approximated by semidefinite programs built from sparse local moments, with exponentially decaying error for Gaussian measures with sparse precision.
Discussion (0). Continue with ORCID to comment.