Manhattan Nonnegative matrix factorization using the alternating direction method of multipliers

Nonnegative matrix factorization (NMF) was a classic model for dimensional reduction. Manhattan NMF is a variant version of NMF that uses a L
1
-norm cost function as the objective function instead of the L
2
-norm cost function. Manhattan NMF can be formulated as a nonconvex nonsmooth optimization problem. An algorithm framework for solving the Manhattan NMF problem based on the alternating direction method of multiplication is presented to us. Compared with the existed algorithm, our proposed algorithm is more effective by experiments on synthetic and real data sets.