Semidefinite Descriptions of the Convex Hull of Rotation Matrices
Authors:
- J. SaundersonJSJ. Saunderson
- P. A. ParriloPPP. A. Parrilo
- A. S. WillskyAWA. S. Willsky
- 1 January 2015
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Optimization
- Vol. 25 (3) , 1314-1343
Abstract
We study the convex hull of $SO(n)$, the set of $n\times n$ orthogonal matrices with unit determinant, from the point of view of semidefinite programming. We show that the convex hull of $SO(n)$ is doubly spectrahedral, i.e., both it and its polar have a description as the intersection of a cone of positive semidefinite matrices with an affine subspace. Our spectrahedral representations are explicit and are of minimum size, in the sense that there are no smaller spectrahedral representations of these convex bodies.
Keywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Worst-case results for positive semidefinite rankMathematical Programming, 2015
- Lifts of Convex Sets and Cone FactorizationsMathematics of Operations Research, 2013
- Extended formulations in combinatorial optimizationAnnals of Operations Research, 2013
- Positive Polynomials and Projections of SpectrahedraSIAM Journal on Optimization, 2011
- Sums of squares and moment problems in equivariant situationsTransactions of the American Mathematical Society, 2008
- Symmetry groups, semidefinite programs, and sums of squaresJournal of Pure and Applied Algebra, 2004
- Relating Homogeneous Cones and Positive Definite Cones via T-AlgebrasSIAM Journal on Optimization, 2003
- Convex hulls of orbits of representations of finite groups and combinatorial optimizationFunctional Analysis and Its Applications, 1988
- Clifford modulesTopology, 1964
- Doubly Stochastic Matrices and the Diagonal of a Rotation MatrixAmerican Journal of Mathematics, 1954