Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problem
From MaRDI portal
Publication:254874
DOI10.1016/j.laa.2016.02.016zbMath1391.65109arXiv1506.08387OpenAlexW2137605774MaRDI QIDQ254874
Publication date: 8 March 2016
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.08387
preconditioningseparabilitynonnegative matrix factorizationrobustness to noisesuccessive projection algorithm
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (2)
Efficient preconditioning for noisy separable nonnegative matrix factorization problems by successive projection based low-rank approximations ⋮ Assigning topics to documents by successive projections
Cites Work
- Unnamed Item
- Unnamed Item
- Handbook series linear algebra. Linear least squares solutions by Householder transformations
- Enhancing Pure-Pixel Identification Performance via Preconditioning
- On the Complexity of Nonnegative Matrix Factorization
- Rounding of Polytopes in the Real Number Model of Computation
- Semidefinite Programming Based Preconditioning for More Robust Near-Separable Nonnegative Matrix Factorization
- Computation of Minimum-Volume Covering Ellipsoids
- Computing a nonnegative matrix factorization -- provably
This page was built for publication: Robustness analysis of preconditioned successive projection algorithm for general form of separable NMF problem
