Lower bounds on matrix factorization ranks via noncommutative polynomial optimization
From MaRDI portal
Publication:6289805
DOI10.1007/s10208-018-09410-yarXiv1708.01573WikidataQ128467519 ScholiaQ128467519MaRDI QIDQ6289805
Monique Laurent, David de Laat, Sander Gribling
Publication date: 4 August 2017
Factorization of matrices (15A23) Semidefinite programming (90C22) Numerical analysis (65-XX) Computer science (68-XX)
This page was built for publication: Lower bounds on matrix factorization ranks via noncommutative polynomial optimization