Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization

标题
Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization
作者
关键词
Matrix factorization ranks, Nonnegative rank, Positive semidefinite rank, Completely positive rank, Completely positive semidefinite rank, Noncommutative polynomial optimization, 15A48, 15A23, 90C22
出版物
出版商
Springer Nature
发表日期
2019-02-01
DOI
10.1007/s10208-018-09410-y

向作者/读者发起求助以获取更多资源

Reprint

联系作者

Discover Peeref hubs

Discuss science. Find collaborators. Network.

Join a conversation

Publish scientific posters with Peeref

Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.

Learn More