Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
arXiv:1708.01573
Abstract
We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particular, we consider the nonnegative rank, the positive semidefinite rank, and their symmetric analogues: the completely positive rank and the completely positive semidefinite rank. We study the convergence properties of our hierarchies, compare them extensively to known lower bounds, and provide some (numerical) examples.
arXiv comment51 pages, 2 figures. The source file includes two implementations of all bounds constructed in this paper, one in Matlab and one in Julia
References in corpus (12)
- Connes' embedding conjecture and sums of hermitian squares
- On the Geometric Interpretation of the Nonnegative Rank
- The A-truncated K-moment problem
- Introduction to Nonnegative Matrix Factorization
- New results on the cp rank and related properties of co(mpletely)positive matrices
- Quantum Bilinear Optimization
- Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
- A universality theorem for nonnegative matrix factorizations
- Lower bounds on nonnegative rank via nonnegative nuclear norms
- Algorithms for Positive Semidefinite Factorization
- Non-closure of the set of quantum correlations via graphs
- Correlation matrices, Clifford algebras, and completely positive semidefinite rank