Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization

Sander Gribling, David de Laat, Monique Laurent

Research output: Working paperOther research output

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.
Original languageEnglish
Place of PublicationIthaca
PublisherCornell University Library
Number of pages45
Publication statusPublished - 4 Aug 2017

Publication series

NamearXiv
Volume1708.01573

Keywords

  • optimization and control

Fingerprint Dive into the research topics of 'Lower Bounds on Matrix Factorization Ranks via Noncommutative Polynomial Optimization'. Together they form a unique fingerprint.

Cite this