Global convergence of a modified HALS algorithm for nonnegative matrix factorization

Takumi Kimura, Norikazu Takahashi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

9 Citations (Scopus)

Abstract

Hierarchical alternating least squares (HALS) algorithms are efficient computational methods for nonnegative matrix factorization (NMF). Given an initial solution, HALS algorithms update the solution block by block iteratively so that the error decreases monotonically. However, update rules in HALS algorithms are not well-defined. In addition, due to this problem, the convergence of the sequence of solutions to a stationary point cannot be proved theoretically. In this paper, we consider the HALS algorithm for the Frobenius norm-based NMF, and prove that a modified version has the global convergence property in the sense of Zangwill.

Original languageEnglish
Title of host publication2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2015
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages21-24
Number of pages4
ISBN (Electronic)9781479919635
DOIs
Publication statusPublished - 2015
Event6th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2015 - Cancun, Mexico
Duration: Dec 13 2015Dec 16 2015

Publication series

Name2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2015

Other

Other6th IEEE International Workshop on Computational Advances in Multi-Sensor Adaptive Processing, CAMSAP 2015
Country/TerritoryMexico
CityCancun
Period12/13/1512/16/15

ASJC Scopus subject areas

  • Signal Processing
  • Computational Mathematics

Fingerprint

Dive into the research topics of 'Global convergence of a modified HALS algorithm for nonnegative matrix factorization'. Together they form a unique fingerprint.

Cite this