Classifying linear matrix inequalities via abstract operator systems
From MaRDI portal
Publication:6185975
Abstract: We systematically study how properties of abstract operator systems help classifying linear matrix inequality definitions of sets. Our main focus is on polyhedral cones, the 3-dimensional Lorentz cone, where we can completely describe all defining linear matrix inequalities, and on the cone of positive semidefinite matrices. Here we use results on isometries between matrix algebras to describe linear matrix inequality definitions of relatively small size. We conversely use the theory of operator systems to characterize special such isometries.
Recommendations
Cites work
- Algorithms in invariant theory
- Completely positive linear maps on complex matrices
- Deciding polyhedrality of spectrahedra
- Dilations, Linear Matrix Inequalities, the Matrix Cube Problem and Beta Distributions
- Dilations, inclusions of matrix convex sets, and completely positive maps
- Entangleability of cones
- Factorization of Singular Matrix Polynomials and Matrices with Circular Higher Rank Numerical Ranges
- Geometry of Linear Matrix Inequalities
- Injectivity and operator spaces
- Isometries between matrix algebras
- Matrix convexity: Operator analogues of the bipolar and Hahn-Banach theorems
- On the derivative cones of polyhedral cones
- Operator system structures on ordered spaces
- Semidefinite Optimization and Convex Algebraic Geometry
- Some geometric results in semidefinite programming
- Spectrahedral Containment and Operator Systems with Finite-Dimensional Realization
- Subalgebras of C\(^*\)-algebras. II
- The matricial relaxation of a linear matrix inequality
- The tracial Hahn-Banach theorem, polar duals, matrix convex sets, and projections of free spectrahedra
This page was built for publication: Classifying linear matrix inequalities via abstract operator systems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6185975)