Nonnegative Matrix Factorization Requires Irrationality
From MaRDI portal
Publication:5283249
DOI10.1137/16M1078835zbMath1369.15020arXiv1605.06848OpenAlexW2963241018MaRDI QIDQ5283249
Ines Marusic, Mahsa Shirmohammadi, Stefan Kiefer, Dmitry Chistikov, James Worrell
Publication date: 21 July 2017
Published in: SIAM Journal on Applied Algebra and Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.06848
Factorization of matrices (15A23) Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Positive matrices and their generalizations; cones of matrices (15B48)
Related Items
Nonnegative Matrix Factorization Requires Irrationality, Alternating sign matrices, related (0,1)-matrices, and the Smith normal form, The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions, The role of rationality in integer-programming relaxations, Nonnegative rank depends on the field, Extension Complexity of Polytopes with Few Vertices or Facets
Cites Work
- Unnamed Item
- Unnamed Item
- Algebraic boundary of matrices of nonnegative rank at most three
- Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
- Expressing combinatorial optimization problems by linear programs
- On the geometric interpretation of the nonnegative rank
- Finding minimal convex nested polygons
- Nonnegative rank depends on the field
- Fixed points of the EM algorithm and nonnegative rank boundaries
- Computing a Nonnegative Matrix Factorization---Provably
- Stochastic factorizations, sandwiched simplices and the topology of the space of explanations
- Perturbation of Matrices and Nonnegative Rank with a View toward Statistical Models
- On the Complexity of Nonnegative Matrix Factorization
- On Rationality of Nonnegative Matrix Factorization
- On Restricted Nonnegative Matrix Factorization
- On the complexity of approximating and illuminating three-dimensional convex polyhedra
- Nonnegative Matrix Factorization Requires Irrationality
- Sparse and Unique Nonnegative Matrix Factorization Through Data Preprocessing
- An Almost Optimal Algorithm for Computing Nonnegative Rank