Deciding Polyhedrality of Spectrahedra
From MaRDI portal
Publication:2949514
DOI10.1137/120904172zbMath1330.90068arXiv1102.4367OpenAlexW1668282207MaRDI QIDQ2949514
Philipp Rostalski, Avinash Bhardwaj, Raman Sanyal
Publication date: 1 October 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1102.4367
Related Items (6)
Some Recent Developments in Spectrahedral Computation ⋮ Self-Dual Polyhedral Cones and Their Slack Matrices ⋮ Classifying linear matrix inequalities via abstract operator systems ⋮ Approximating Nonnegative Polynomials via Spectral Sparsification ⋮ Characterizing Bad Semidefinite Programs: Normal Forms and Short Proofs ⋮ A Semidefinite Hierarchy for Containment of Spectrahedra
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polytopes of minimum positive semidefinite rank
- A numerical algorithm for block-diagonal decomposition of matrix \(*\)-algebras with application to semidefinite programming
- Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming
- Common eigenvectors of two matrices
- Semidefinite characterization and computation of zero-dimensional real radical ideals
- An exact duality theory for semidefinite programming and its complexity implications
- Some geometric results in semidefinite programming
- Containment Problems for Polytopes and Spectrahedra
- Theta Bodies for Polynomial Ideals
- Dualities in Convex Algebraic Geometry
- Linear matrix inequality representation of sets
- Lectures on Polytopes
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones
- On the Facial Structure of the Set of Correlation Matrices
- Linear vs. semidefinite extended formulations
- Handbook of semidefinite programming. Theory, algorithms, and applications
This page was built for publication: Deciding Polyhedrality of Spectrahedra
