Convex Algorithms for Nonnegative Matrix Factorization
From MaRDI portal
Publication:6234091
arXiv1207.0318MaRDI QIDQ6234091FDOQ6234091
Vijay Krishnamurthy, Alexandre d'Aspremont
Publication date: 2 July 2012
Abstract: We derive approximation algorithms for the nonnegative matrix factorization problem, i.e. the problem of factorizing a matrix as the product of two matrices with nonnegative coefficients. We form convex approximations of this problem which can be solved efficiently and test our algorithms on some classic numerical examples.
This page was built for publication: Convex Algorithms for Nonnegative Matrix Factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6234091)
