paper

Support-based lower bounds for the positive semidefinite rank of a nonnegative matrix

arXiv:1203.3961

Abstract

The positive semidefinite rank of a nonnegative -matrix~ is the minimum number~ such that there exist positive semidefinite -matrices , such that $S(k,\ell) = \mbox{tr}(A_k^* B_\ell)$. The most important, lower bound technique for nonnegative rank is solely based on the support of the matrix S, i.e., its zero/non-zero pattern. In this paper, we characterize the power of lower bounds on positive semidefinite rank based on solely on the support.

arXiv comment9 pages

References in corpus (3)

Cited by in corpus (9)