Rational and real positive semidefinite rank can be different

DOI10.1016/J.ORL.2015.11.012MaRDI QIDQ1785467zbMATH OpenOpenAlexFDO

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

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

matrix factorizationpositive semidefinite ranksemidefinite programming

Mathematics Subject Classification ID

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

Abstract: Given a nonnegative matrix M with rational entries, we consider two quantities: the usual positive semidefinite (psd) rank, where the matrix is factored through the cone of real symmetric psd matrices, and the rational-restricted psd rank, where the matrix factors are required to be rational symmetric psd matrices. It is clear that the rational-restricted psd rank is always an upper bound to the usual psd rank. We show that this inequality may be strict by exhibiting a matrix with psd rank four whose rational-restricted psd rank is strictly greater than four.

Recommendations

• Real rank versus nonnegative rank
• Positive semidefinite rank
• Completely positive semidefinite rank
• Semi-nonnegative rank for real matrices and its connection to the usual rank
• scientific article; zbMATH DE number 89392
• Rank inequalities for positive semidefinite matrices
• The positive semidefinite Grothendieck problem with rank constraint
• Matrices with positive semidefinite real part
• Positive semidefinite rank and nested spectrahedra
• Rang Reel de Certaines Extensions

Cites work

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

Cited in

(6)

• Algorithms for positive semidefinite factorization
• Heuristics for exact nonnegative matrix factorization
• The nonnegative rank of a matrix: hard problems, easy solutions
• The complexity of positive semidefinite matrix factorization
• Further \(\exists{\mathbb{R}} \)-complete problems with PSD matrix factorizations
• Positive semidefinite rank

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785467)