Positive semidefinite rank and nested spectrahedra
From MaRDI portal
Publication:5375914
DOI10.1080/03081087.2017.1381664zbMath1395.14041arXiv1512.08766OpenAlexW2963102930MaRDI QIDQ5375914
Kaie Kubjas, Elina Robeva, Richard Z. Robinson
Publication date: 17 September 2018
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1512.08766
Factorization of matrices (15A23) Positive matrices and their generalizations; cones of matrices (15B48) Semialgebraic sets and related spaces (14P10)
Related Items (2)
Cites Work
- Unnamed Item
- Heuristics for exact nonnegative matrix factorization
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
- Polytopes of minimum positive semidefinite rank
- Four-dimensional polytopes of minimum positive semidefinite rank
- Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
- Positive semidefinite rank
- Worst-case results for positive semidefinite rank
- Expressing combinatorial optimization problems by linear programs
- Determinantal rings
- On the geometric interpretation of the nonnegative rank
- Fixed points of the EM algorithm and nonnegative rank boundaries
- Approximate cone factorizations and lifts of polytopes
- Lower Bounds on the Size of Semidefinite Programming Relaxations
- Dualities in Convex Algebraic Geometry
- Equivariant Semidefinite Lifts and Sum-of-Squares Hierarchies
- On the Complexity of Nonnegative Matrix Factorization
- The Matching Polytope has Exponential Extension Complexity
- Lifts of Convex Sets and Cone Factorizations
- Generic Spectrahedral Shadows
- Linear vs. semidefinite extended formulations
This page was built for publication: Positive semidefinite rank and nested spectrahedra