The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions

Using elementary linear algebra, we develop a technique that leads to solutions of two widely known problems on nonnegative matrices. First, we give a short proof of the result by Vavasis stating that the nonnegative rank of a matrix is NP-hard to compute. This proof is essentially contained in the paper by Jiang and Ravikumar, who discussed this topic in different terms fifteen years before the work of Vavasis. Secondly, we present a solution of the problem of Cohen and Rothblum on rational nonnegative factorizations, which was posed in 1993 and remained open.

[1]  Moshe Lewenstein,et al.  Uniquely Restricted Matchings , 2001, Algorithmica.

[2]  Bernd Sturmfels,et al.  FIXED POINTS OF THE EM ALGORITHM AND NONNEGATIVE RANK BOUNDARIES , 2013, 1312.5634.

[3]  Samuel Fiorini,et al.  Combinatorial bounds on nonnegative rank and extended formulations , 2011, Discret. Math..

[4]  Yaroslav Shitov.  Nonnegative rank depends on the field II , 2016 .

[5]  Hamza Fawzi,et al.  Rational and real positive semidefinite rank can be different , 2014, Oper. Res. Lett..

[6]  V. Kaibel.  Extended Formulations in Combinatorial Optimization , 2011, 1104.1023.

[7]  J. Orlin.  Contentment in graph theory: Covering graphs with cliques , 1977 .

[8]  Hans Raj Tiwary,et al.  Exponential Lower Bounds for Polytopes in Combinatorial Optimization , 2011, J. ACM.

[9]  Parinya Chalermsook,et al.  Nearly Tight Approximability Results for Minimum Biclique Cover and Partition , 2014, ESA.

[10]  A. Berman.  Rank Factorization of Nonnegative Matrices , 1973 .

[11]  David A. Gregory,et al.  Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices , 1991, J. Comb. Theory B.

[12]  Stephen A. Vavasis,et al.  On the Complexity of Nonnegative Matrix Factorization , 2007, SIAM J. Optim..

[13]  Mihalis Yannakakis,et al.  Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.

[14]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[15]  Tao Jiang,et al.  Minimal NFA Problems are Hard , 1991, SIAM J. Comput..

[16]  Joel E. Cohen,et al.  Nonnegative ranks, decompositions, and factorizations of nonnegative matrices , 1993 .

[17]  Yaroslav Shitov.  On the complexity of Boolean matrix ranks , 2013, ArXiv.

[18]  Thomas Rothvoß,et al.  Some 0/1 polytopes need exponential size extended formulations , 2011, Math. Program..

[19]  James Worrell,et al.  Nonnegative Matrix Factorization Requires Irrationality , 2017, SIAM J. Appl. Algebra Geom..

[20]  H. Sebastian Seung,et al.  Learning the parts of objects by non-negative matrix factorization , 1999, Nature.