Dimension reduction for semidefinite programs via Jordan algebras

From MaRDI portal
Publication:2188241

DOI10.1007/S10107-019-01372-5zbMATH Open1468.90080arXiv1608.02090OpenAlexW2524488792WikidataQ128276840 ScholiaQ128276840MaRDI QIDQ2188241FDOQ2188241

Pablo A. Parrilo, Frank Permenter

Publication date: 10 June 2020

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Abstract: We propose a new method for simplifying semidefinite programs (SDP) inspired by symmetry reduction. Specifically, we show if an orthogonal projection map satisfies certain invariance conditions, restricting to its range yields an equivalent primal-dual pair over a lower-dimensional symmetric cone---namely, the cone-of-squares of a Jordan subalgebra of symmetric matrices. We present a simple algorithm for minimizing the rank of this projection and hence the dimension of this subalgebra. We also show that minimizing rank optimizes the direct-sum decomposition of the algebra into simple ideals, yielding an optimal "block-diagonalization" of the SDP. Finally, we give combinatorial versions of our algorithm that execute at reduced computational cost and illustrate effectiveness of an implementation on examples. Through the theory of Jordan algebras, the proposed method easily extends to linear and second-order-cone programming and, more generally, symmetric cone optimization.


Full work available at URL: https://arxiv.org/abs/1608.02090




Recommendations




Cites Work


Cited In (5)

Uses Software





This page was built for publication: Dimension reduction for semidefinite programs via Jordan algebras

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188241)