2012/07/02 by V. Krishnamurthy, Vijay Krishnamurthy, Krishnamurthy, Vijay +3
Computer Science · Mathematics · #Advanced Optimization Algorithms Research #Matrix Theory and Algorithms #Statistical and numerical algorithms #math.OC
paper · pdf · doi:10.48550/arxiv.1207.0318
Discussion paper. Rejected by NIPS in 2007
arxiv created 2012/07/02 · arxiv updated 2012/07/03
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.