Rational and real positive semidefinite rank can be different

DOI10.1016/j.orl.2015.11.012zbMath1408.15016arXiv1404.4864OpenAlexW1816515239MaRDI QIDQ1785467

Hamza Fawzi, Richard Z. Robinson, João Gouveia

Publication date: 28 September 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1404.4864

zbMATH Keywords

semidefinite programmingmatrix factorizationpositive semidefinite rank

Mathematics Subject Classification ID

Positive matrices and their generalizations; cones of matrices (15B48)

Related Items

Heuristics for exact nonnegative matrix factorization ⋮ The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions ⋮ The Complexity of Positive Semidefinite Matrix Factorization ⋮ Algorithms for positive semidefinite factorization ⋮ Positive semidefinite rank

Cites Work

• Polytopes of minimum positive semidefinite rank
• Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
• Positive semidefinite rank
• Lifts of Convex Sets and Cone Factorizations
• Linear vs. semidefinite extended formulations

This page was built for publication: Rational and real positive semidefinite rank can be different