Self-scaled bounds for atomic cone ranks: applications to nonnegative rank and cp-rank
The nonnegative rank of a matrix A is the smallest integer r such that A can be written as the sum of r rank-one nonnegative matrices. The nonnegative rank has received a lot of attention recently due to its application in optimization, probability and communication complexity. In this paper we stud...
Main Authors: | Fawzi, Hamza, Parrilo, Pablo A. |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
Format: | Article |
Language: | English |
Published: |
Springer Berlin Heidelberg
2016
|
Online Access: | http://hdl.handle.net/1721.1/103632 https://orcid.org/0000-0001-6026-4102 https://orcid.org/0000-0003-1132-8477 |
Similar Items
-
Lower bounds on nonnegative rank via nonnegative nuclear norms
by: Fawzi, Hamza, et al.
Published: (2016) -
Positive semidefinite rank
by: Gouveia, João, et al.
Published: (2017) -
An Almost Optimal Algorithm for Computing Nonnegative Rank
by: Moitra, Ankur
Published: (2017) -
Rank-Sparsity Incoherence for Matrix Decomposition
by: Chandrasekaran, Venkat, et al.
Published: (2011) -
Sparse and low-rank matrix decompositions
by: Chandrasekaran, Venkat, et al.
Published: (2010)