Multiplicative update for a class of constrained optimization problems related to NMF and its global convergence

摘要

Multiplicative updates are widely used for nonnegative matrix factorization (NMF) as an efficient computational method. In this paper, we consider a class of constrained optimization problems in which a polynomial function of the product of two matrices is minimized subject to the nonnegativity constraints. These problems are closely related to NMF because the polynomial function covers many error function used for NMF. We first derive a multiplicative update rule for those problems by using the unified method developed by Yang and Oja. We next prove that a modified version of the update rule has the global convergence property in the sense of Zangwill under certain conditions. This result can be applied to many existing multiplicative update rules for NMF to guarantee their global convergence.