Semidefinite Descriptions of the Convex Hull of Rotation Matrices
From MaRDI portal
Publication:5501229
DOI10.1137/14096339XzbMath1317.90231arXiv1403.4914MaRDI QIDQ5501229
Alan S. Willsky, James Saunderson, Pablo A. Parrilo
Publication date: 3 August 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.4914
Semidefinite programming (90C22) Convex programming (90C25) Convex functions and convex programs in convex geometry (52A41) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items (13)
Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies ⋮ Spectrahedral representation of polar orbitopes ⋮ Synchronization over Cartan Motion Groups via Contraction ⋮ A factorization method for completely positive matrices ⋮ CvxPnPL: a unified convex solution to the absolute pose estimation problem from point and line correspondences ⋮ Lagrangian Duality in Complex Pose Graph Optimization ⋮ Synchronization problems in computer vision with closed-form solutions ⋮ Spectrahedral Shadows ⋮ Optimal Size of Linear Matrix Inequalities in Semidefinite Approaches to Polynomial Optimization ⋮ A diffusion generated method for orthogonal matrix-valued fields ⋮ Semidefinite Descriptions of the Convex Hull of Rotation Matrices ⋮ Non-unique games over compact groups and orientation estimation in cryo-EM ⋮ Spectral Synchronization of Multiple Views in SE(3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Worst-case results for positive semidefinite rank
- Convex hulls of orbits and orientations of a moving protein domain
- Sums of random symmetric matrices and quadratic optimization under orthogonality constraints
- On defining sets of vertices of the hypercube by linear inequalities
- Convex hulls of orbits of representations of finite groups and combinatorial optimization
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Symmetry groups, semidefinite programs, and sums of squares
- Tutorials on emerging methodologies and applications in operations research. Selected papers presented at INFORMS 2004, Denver, CO, USA, October 24--27, 2004.
- Some geometric results in semidefinite programming
- Algebraic boundaries of \(\mathrm{SO}(2)\)-orbitopes
- Hyperbolic programs, and their derivative relaxations
- Clifford modules
- On the Existence of 0/1 Polytopes with High Semidefinite Extension Complexity
- ORBITOPES
- Positive Polynomials and Projections of Spectrahedra
- Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies
- Sums of squares and moment problems in equivariant situations
- Relating Homogeneous Cones and Positive Definite Cones via T-Algebras
- SDPT3 — A Matlab software package for semidefinite programming, Version 1.3
- Semidefinite Optimization and Convex Algebraic Geometry
- Lifts of Convex Sets and Cone Factorizations
- Efficient rounding for the noncommutative grothendieck inequality
- Semidefinite Descriptions of the Convex Hull of Rotation Matrices
- Doubly Stochastic Matrices and the Diagonal of a Rotation Matrix
- Extended formulations in combinatorial optimization
This page was built for publication: Semidefinite Descriptions of the Convex Hull of Rotation Matrices
