Some Recent Developments in Spectrahedral Computation
From MaRDI portal
Publication:4556598
DOI10.1007/978-3-319-70566-8_30zbMath1402.52006OpenAlexW2793222967MaRDI QIDQ4556598
Publication date: 16 November 2018
Published in: Algorithmic and Experimental Methods in Algebra, Geometry, and Number Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-70566-8_30
Symbolic computation and algebraic computation (68W30) Semidefinite programming (90C22) Real algebraic sets (14P05) Effectivity, complexity and computational aspects of algebraic geometry (14Q20) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Polyhedral and algebraic methods in computational geometry
- Representing polynomials by positive linear functions on compact convex polyhedra
- Positive semidefinite biquadratic forms
- Matrix results on the Khatri-Rao and Tracy-Singh products
- On the complexity of some basic problems in computational convexity. I. Containment problems
- An exact duality theory for semidefinite programming and its complexity implications
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- On a positive semidefinite relaxation of the cut polytope
- Some geometric results in semidefinite programming
- The matricial relaxation of a linear matrix inequality
- Global Optimization with Polynomials and the Problem of Moments
- On Tractable Approximations of Uncertain Linear Matrix Inequalities Affected by Interval Uncertainty
- Sum of Squares Certificates for Containment of $\mathcal{H}$-Polytopes in $\mathcal{V}$-Polytopes
- Positive Maps and Separable Matrices
- Containment Problems for Polytopes and Spectrahedra
- Extending quantum operations
- Deciding Polyhedrality of Spectrahedra
- Linear matrix inequality representation of sets
- On the complexity of four polyhedral set containment problems
- Lectures on Polytopes
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Semidefinite Optimization and Convex Algebraic Geometry
- An Exact Duality Theory for Semidefinite Programming Based on Sums of Squares
- A Semidefinite Hierarchy for Containment of Spectrahedra
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Spectrahedral Containment and Operator Systems with Finite-Dimensional Realization
- Approximating amoebas and coamoebas by sums of squares
- The maximum numbers of faces of a convex polytope
