Convex Algorithms for Nonnegative Matrix Factorization
classification
🧮 math.OC
keywords
algorithmsmatrixnonnegativeproblemconvexfactorizationapproximationapproximations
read the original 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 paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.