Parallel Nonnegative Matrix Factorization via Newton Iteration

DOI10.1142/S0129626416500146MaRDI QIDQ4598926zbMATH OpenFDO

Authors Markus Flatz, Marián Vajteršic

Publication date 15 December 2017

Published in Parallel Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S0129626416500146

zbMATH Keywords

parallel algorithmsNewton iterationnonnegative matrix factorization (NMF)computational linear algebraKarush-Kuhn-Tucker conditions (KKT)

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Factorization of matrices (15A23)

Recommendations

• scientific article; zbMATH DE number 6379366
• Parallel nonnegative matrix factorization algorithm on the distributed memory platform
• Efficient nonnegative matrix factorization via projected Newton method
• Efficient Parallel Nonnegative Least Squares on Multicore Architectures
• Parallel Newton methods for the nonlinear complementarity problem
• Nesterov-Based Alternating Optimization for Nonnegative Tensor Factorization: Algorithm and Parallel Implementation
• Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization

Cited in

(6)

• Factors imbalance iterative for nonnegative matrix factorization
• Global convergence of modified multiplicative updates for nonnegative matrix factorization
• Multi-agent solver for non-negative matrix factorization based on optimization.
• Efficient Parallel Nonnegative Least Squares on Multicore Architectures
• Parallel nonnegative matrix factorization algorithm on the distributed memory platform
• Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization

This page was built for publication: Parallel Nonnegative Matrix Factorization via Newton Iteration

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4598926)