The Nonnegative Matrix Factorization: Regularization and Complexity

DOI10.1137/14099841XzbMath1386.65123OpenAlexW2338670514WikidataQ57434556 ScholiaQ57434556MaRDI QIDQ2804995

Kazufumi Ito, A. K. Landi

Publication date: 9 May 2016

Published in: SIAM Journal on Scientific Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/14099841x

zbMATH Keywords

complexityregularizationnonnegative matrix factorizationprimal-dual active set

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Factorization of matrices (15A23) Numerical mathematical programming methods (65K05)

Related Items

Unilateral Orthogonal Nonnegative Matrix Factorization

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms and applications for approximate nonnegative matrix factorization
• On the equivalence between non-negative matrix factorization and probabilistic latent semantic indexing
• Model selection and Akaike's information criterion (AIC): The general theory and its analytical extensions
• Inverse Problems
• Lagrange Multiplier Approach to Variational Problems and Applications
• Can the strengths of AIC and BIC be shared? A conflict between model indentification and regression estimation
• Primal-Dual Strategy for Constrained Optimal Control Problems
• The Primal-Dual Active Set Strategy as a Semismooth Newton Method
• Learning the parts of objects by non-negative matrix factorization
• Local Mapping Relations and Global Implicit Function Theorems