Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
From MaRDI portal
Publication:3624862
DOI10.1137/07069239XzbMath1162.65354WikidataQ56533360 ScholiaQ56533360MaRDI QIDQ3624862
Publication date: 30 April 2009
Published in: SIAM Journal on Matrix Analysis and Applications (Search for Journal in Brave)
algorithm; convergence; numerical examples; nonnegative matrix factorization; active set method; lower rank approximation; Karush-Kuhn-Tucker (KKT) conditions; nonnegativity constrained least squares; two-block coordinate descent method
Related Items
On the Set of Solutions of the Nonnegative Matrix Factorization Problem, A class of multilevel structured low-rank approximation arising in material processing, Sparse topical analysis of dyadic data using matrix tri-factorization, Graph dual regularization non-negative matrix factorization for co-clustering, Efficient nonnegative matrix factorization via projected Newton method, An alternating structured trust region algorithm for separable optimization problems with nonconvex constraints, A symmetric rank-one quasi-Newton method for nonnegative matrix factorization, Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications, Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework, Using underapproximations for sparse nonnegative matrix factorization, Random projections for the nonnegative least-squares problem, A very brief introduction to nonnegative tensors from the geometric viewpoint, Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization, DC-NMF: nonnegative matrix factorization based on divide-and-conquer for fast clustering and topic modeling, Integer matrix approximation and data mining, A unified global convergence analysis of multiplicative update rules for nonnegative matrix factorization, An inexact update method with double parameters for nonnegative matrix factorization, Optimal Bayesian clustering using non-negative matrix factorization, Regularized nonnegative shared subspace learning, Nonnegative tensor factorizations using an alternating direction method, Nonnegative rank factorization -- a heuristic approach via rank reduction, An efficient monotone projected Barzilai-Borwein method for nonnegative matrix factorization, SymNMF: nonnegative low-rank approximation of a similarity matrix for graph clustering, Alternating proximal gradient method for sparse nonnegative Tucker decomposition, Solving non-negative matrix factorization by alternating least squares with a modified strategy, A multilevel approach for nonnegative matrix factorization, Non-negative matrix factorization under equality constraints -- a study of industrial source identification, A convergent algorithm for orthogonal nonnegative matrix factorization, Regularized nonnegative matrix factorization: geometrical interpretation and application to spectral unmixing, Bounded Matrix Low Rank Approximation, Projection‐based model reduction for contact problems, Constructing New Weighted ℓ1-Algorithms for the Sparsest Points of Polyhedral Sets, Newton-based optimization for Kullback–Leibler nonnegative tensor factorizations
