Hyperbolic Relaxation of $k$-Locally Positive Semidefinite Matrices
Grigoriy Blekherman, Santanu S. Dey, Kevin Shu, and Shengding Sun

TL;DR
This paper introduces a hyperbolic relaxation approach for $k$-locally PSD matrices, providing new bounds and structural insights that improve understanding of their eigenvalues and relation to PSD matrices.
Contribution
It establishes a convex cone containing eigenvalues of $k$-locally PSD matrices, improves bounds on their distance to PSD matrices, and characterizes the structure of matrices on the boundary of this cone.
Findings
Eigenvalues of $k$-locally PSD matrices lie in a hyperbolicity cone.
The relaxation is tight for $k = n - 1$ case.
Structural theorem for matrices with zero principal minors.
Abstract
A successful computational approach for solving large-scale positive semidefinite (PSD) programs is to enforce PSD-ness on only a collection of submatrices. For our study, we let be the convex cone of symmetric matrices where all principal submatrices are PSD. We call a matrix in this -\emph{locally PSD}. In order to compare to the of PSD matrices, we study eigenvalues of -{locally PSD} matrices. The key insight in this paper is that there is a convex cone so that if , then the vector of eigenvalues of is contained in . The cone is the hyperbolicity cone of the elementary symmetric polynomial (where ) with respect to the all ones vector. Using this insight, we are able to improve previously known…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Optimization Algorithms Research · RNA Interference and Gene Delivery · Sparse and Compressive Sensing Techniques
