Containment Problems for Polytopes and Spectrahedra
From MaRDI portal
Publication:2848183
DOI10.1137/120874898zbMath1296.68177arXiv1204.4313OpenAlexW2962695108MaRDI QIDQ2848183
Christian Trabandt, Kai Kellner, Thorsten Theobald
Publication date: 25 September 2013
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1204.4313
Semidefinite programming (90C22) Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (13)
The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra ⋮ Finding Minimum Volume Circumscribing Ellipsoids Using Generalized Copositive Programming ⋮ Some Recent Developments in Spectrahedral Computation ⋮ Deciding Polyhedrality of Spectrahedra ⋮ Spectrahedral Containment and Operator Systems with Finite-Dimensional Realization ⋮ Deciding Robust Feasibility and Infeasibility Using a Set Containment Approach: An Application to Stationary Passive Gas Network Operations ⋮ Dilations, Linear Matrix Inequalities, the Matrix Cube Problem and Beta Distributions ⋮ Conic stability of polynomials and positive maps ⋮ Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes ⋮ A Matrix Positivstellensatz with Lifting Polynomials ⋮ On set containment characterizations for sets described by set-valued maps with applications ⋮ On the co-NP-completeness of the zonotope containment problem ⋮ A Semidefinite Hierarchy for Containment of Spectrahedra
This page was built for publication: Containment Problems for Polytopes and Spectrahedra
