Lower bounds on matrix factorization ranks via noncommutative polynomial optimization

Sander Gribling, David de Laat, Monique Laurent

We use techniques from (tracial noncommutative) polynomial optimization to formulate hierarchies of semidefinite programming lower bounds on matrix factorization ranks. In particul…