7 problems
- 0 votes0 replies0 views
NP-hardness conjecture for computing PSD rank
Let be a nonnegative matrix. Its PSD rank is the smallest integer for which there exist real positive semidefinite matrices and…
- 0 votes0 replies0 views
Spectrahedron characterization of psd rank for normalized matrices
Let have rank and satisfy … Let and be the two polytopes corresponding to in the nested-polytope representation. Spectrahedro…
- 0 votes0 replies0 views
Rank-one factor existence for matrices of psd rank at most k
Rank-one factor abundance conjecture. Every such matrix has a psd factorization in which either at least matrices and matrices are rank one, or at least …
- 0 votes0 replies0 views
Geometric boundary characterization by rank loci
Let be a matrix represented as a slack matrix of nested polytopes . A spectrahedral shadow of size between and …
- 0 votes0 replies0 views
Rank conjecture for support matrices of psd-minimal polytopes
Let be a psd-minimal -polytope, and let its support matrix be the matrix with the same zero pattern as a slack matrix of . Support-matrix rank conjecture. The suppo…
- 0 votes0 replies1 view
Multiplicativity of PSD-rank under tensor products
Let and be nonnegative matrices, and let denote their tensor product. The positive semidefinite rank of a nonnegative matrix is the smallest for wh…
- 0 votes0 replies0 views
Superpolynomial PSD extension complexity of the traveling salesman polytope
A polytope has positive semidefinite extension complexity equal to the smallest such that is the projection of an affine slice of the cone of -dimensional positive s…