Lower bounds on matrix factorization ranks via noncommutative polynomial optimization

Understand

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.