Nonnegative matrix factorization using ADMM: Algorithm and convergence analysis

Davood Hajinezhad, Tsung-Hui Chang, Xiangfeng Wang, Qingjiang Shi, Mingyi HongICASSP 2016 · OpenReview

Abstract

The nonnegative matrix factorization (NMF) has been a popular model for a wide range of signal processing and machine learning problems. It is usually formulated as a nonconvex cost minimization problem. This work settles the convergence issue of a popular algorithm based on the alternating direction method of multipliers proposed in Boyd et al 2011. We show that the algorithm converges globally to the set of KKT solutions whenever certain penalty parameter ρ satisfies ρ > 1. We further extend the algorithm and its analysis to the problem where the observation matrix contains missing values. Numerical experiments on real and synthetic data sets demonstrate the effectiveness of the algorithms under investigation.
BibTeX
@inproceedings{hajinezhad2016nonnegative,
  author = {Davood Hajinezhad and Tsung-Hui Chang and Xiangfeng Wang and Qingjiang Shi and Mingyi Hong},
  title = {{Nonnegative matrix factorization using ADMM: Algorithm and convergence analysis}},
  booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
  year = {2016},
  url = {https://openreview.net/forum?id=VGINmxOI76},
}

Loading related content...

Figure