JOURNAL ARTICLE

Boundedness of modified multiplicative updates for nonnegative matrix factorization

Abstract

There have been proposed various types of multiplicative updates for nonnegative matrix factorization. However, these updates have a serious drawback in common: they are not defined for all pairs of nonnegative matrices. Furthermore, due to this drawback, their global convergence in the sense of Zangwill's theorem cannot be proved theoretically. In this paper, we consider slightly modified versions of various multiplicative update rules, that are defined for all pairs of matrices in the domain, and show that many of them have the boundedness property. This property is a necessary condition for update rules to be globally convergent in the sense of Zangwill's theorem.

Keywords:
Multiplicative function Mathematics Convergence (economics) Matrix (chemical analysis) Property (philosophy) Non-negative matrix factorization Factorization Domain (mathematical analysis) Nonnegative matrix Matrix decomposition Discrete mathematics Symmetric matrix Algorithm

Metrics

3
Cited By
0.66
FWCI (Field Weighted Citation Impact)
10
Refs
0.74
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Matrix Theory and Algorithms
Physical Sciences →  Computer Science →  Computational Theory and Mathematics
Advanced Topics in Algebra
Physical Sciences →  Mathematics →  Algebra and Number Theory
Advanced Optimization Algorithms Research
Physical Sciences →  Mathematics →  Numerical Analysis

Related Documents

© 2026 ScienceGate Book Chapters — All rights reserved.