An Almost Optimal Algorithm for Computing Nonnegative Rank
From MaRDI portal
Publication:5741813
DOI10.1137/1.9781611973105.104zbMath1422.68130arXiv1205.0044OpenAlexW2626435674MaRDI QIDQ5741813
Publication date: 15 May 2019
Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.0044
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (10)
Heuristics for exact nonnegative matrix factorization ⋮ Algebraic boundary of matrices of nonnegative rank at most three ⋮ Common information and unique disjointness ⋮ A polynomial-time algorithm for computing low CP-rank decompositions ⋮ Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions ⋮ Conic optimization-based algorithms for nonnegative matrix factorization ⋮ Nonnegative rank depends on the field ⋮ An Almost Optimal Algorithm for Computing Nonnegative Rank ⋮ Positive semidefinite rank ⋮ Computing a Nonnegative Matrix Factorization---Provably
This page was built for publication: An Almost Optimal Algorithm for Computing Nonnegative Rank
