Uniqueness of Nonnegative Matrix Factorizations by Rigidity Theory
DOI10.1137/19M1279472zbMath1458.15028arXiv1902.02868WikidataQ114074239 ScholiaQ114074239MaRDI QIDQ5150834
Publication date: 15 February 2021
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1902.02868
semialgebraic setsrigidity theorycompletely positive factorizationsnonnegative matrix factorizations
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) Semialgebraic sets and related spaces (14P10) Group actions on affine varieties (14R20)
Related Items (3)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Heuristics for exact nonnegative matrix factorization
- Nonnegative ranks, decompositions, and factorizations of nonnegative matrices
- The rigidity of graphs. II
- Expressing combinatorial optimization problems by linear programs
- On the geometric interpretation of the nonnegative rank
- Fixed points of the EM algorithm and nonnegative rank boundaries
- Nonnegative matrix factorization for spectral data analysis
- Stochastic factorizations, sandwiched simplices and the topology of the space of explanations
- Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
- On the Complexity of Nonnegative Matrix Factorization
- A Convex Analysis-Based Minimum-Volume Enclosing Simplex Algorithm for Hyperspectral Unmixing
- Blind Separation of Quasi-Stationary Sources: Exploiting Convex Geometry in Covariance Domain
- Learning the parts of objects by non-negative matrix factorization
- Sparse and Unique Nonnegative Matrix Factorization Through Data Preprocessing
- An Almost Optimal Algorithm for Computing Nonnegative Rank
This page was built for publication: Uniqueness of Nonnegative Matrix Factorizations by Rigidity Theory
