A Semidefinite Hierarchy for Containment of Spectrahedra
From MaRDI portal
Publication:5254998
DOI10.1137/140971634zbMath1323.90048arXiv1308.5076OpenAlexW1596891174MaRDI QIDQ5254998
Kai Kellner, Christian Trabandt, Thorsten Theobald
Publication date: 11 June 2015
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1308.5076
Related Items
Some Recent Developments in Spectrahedral Computation, Spectrahedral Containment and Operator Systems with Finite-Dimensional Realization, Conic stability of polynomials and positive maps, Noncommutative polynomials describing convex sets, Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes, A Matrix Positivstellensatz with Lifting Polynomials, Positive Maps and Separable Matrices
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The convex Positivstellensatz in a free algebra
- Quantum convex support
- Worst-case results for positive semidefinite rank
- Semidefinite representation of convex sets
- Extension of positive maps into B(\({\mathcal H})\)
- Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces
- Positive semidefinite biquadratic forms
- Nonextendible positive maps
- Positive maps of low dimensional matrix algebras
- On the complexity of some basic problems in computational convexity. I. Containment problems
- An exact duality theory for semidefinite programming and its complexity implications
- On implementing a primal-dual interior-point method for conic quadratic optimization
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Set containment characterization
- On a positive semidefinite relaxation of the cut polytope
- Some geometric results in semidefinite programming
- The matricial relaxation of a linear matrix inequality
- Computational complexity of inner and outer \(j\)-radii of polytopes in finite-dimensional normed spaces
- Matrix sum-of-squares relaxations for robust semi-definite programs
- Positive linear maps of operator algebras
- Subalgebras of \(C^ *\)-algebras
- Global Optimization with Polynomials and the Problem of Moments
- On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty
- Containment Problems for Polytopes and Spectrahedra
- Deciding Polyhedrality of Spectrahedra
- Cones of positive maps and their duality relations
- Knowledge-based semidefinite linear programming classifiers
- Linear matrix inequality representation of sets
- On the complexity of four polyhedral set containment problems
- Characterizing Set Containments Involving Infinite Convex Constraints and Reverse-Convex Constraints
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Optimization and Convex Algebraic Geometry
- Pre- and Post-Processing Sum-of-Squares Programs in Practice
- An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
