Some recent developments in spectrahedral computation
From MaRDI portal
Recommendations
Cites work
- A semidefinite hierarchy for containment of spectrahedra
- An exact duality theory for semidefinite programming and its complexity implications
- An exact duality theory for semidefinite programming based on sums of squares
- Approximating amoebas and coamoebas by sums of squares
- Aspects of semidefinite programming. Interior point algorithms and selected applications
- Containment problems for polytopes and spectrahedra
- Convergent Relaxations of Polynomial Matrix Inequalities and Static Output Feedback
- Deciding polyhedrality of spectrahedra
- Extending quantum operations
- Global optimization with polynomials and the problem of moments
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 2008526 (Why is no real title available?)
- scientific article; zbMATH DE number 1489798 (Why is no real title available?)
- scientific article; zbMATH DE number 1534289 (Why is no real title available?)
- scientific article; zbMATH DE number 1849957 (Why is no real title available?)
- Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- Lectures on Polytopes
- Linear matrix inequality representation of sets
- Matrix results on the Khatri-Rao and Tracy-Singh products
- On a positive semidefinite relaxation of the cut polytope
- On the complexity of four polyhedral set containment problems
- On the complexity of some basic problems in computational convexity. I. Containment problems
- On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty
- Polyhedral and algebraic methods in computational geometry
- polymake: a framework for analyzing convex polytopes
- Positive maps and separable matrices
- Positive semidefinite biquadratic forms
- Representing polynomials by positive linear functions on compact convex polyhedra
- Semidefinite Optimization and Convex Algebraic Geometry
- Some geometric results in semidefinite programming
- Spectrahedral Containment and Operator Systems with Finite-Dimensional Realization
- Sum of squares certificates for containment of \(\mathcal{H}\)-polytopes in \(\mathcal{V}\)-polytopes
- The matricial relaxation of a linear matrix inequality
- The maximum numbers of faces of a convex polytope
Cited in
(9)- Some geometric results in semidefinite programming
- Irreducible infeasible subsystems of semidefinite systems
- Deciding polyhedrality of spectrahedra
- Spectrahedral approximations of convex hulls of algebraic sets
- Positive polynomials and projections of spectrahedra
- scientific article; zbMATH DE number 1182566 (Why is no real title available?)
- A semidefinite hierarchy for containment of spectrahedra
- Polyhedral approximation of spectrahedral shadows via homogenization
- The geometry of spectrahedra
This page was built for publication: Some recent developments in spectrahedral computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4556598)
