Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization

DOI10.1007/s10898-016-0471-zzbMath1380.90228arXiv1506.08938OpenAlexW2213168259MaRDI QIDQ1675555

Tu Bao Ho, Duy Khuong Nguyen

Publication date: 2 November 2017

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1506.08938

zbMATH Keywords

non-negative matrix factorizationaccelerated anti-lopsided algorithmcooridinate descent algorithmparallel and distributed algorithm

Mathematics Subject Classification ID

Factorization of matrices (15A23) Nonconvex programming, global optimization (90C26)

Uses Software

• NeNMF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Descriptive matrix factorization for sustainability. Adopting the principle of opposites
• Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
• Algorithms and applications for approximate nonnegative matrix factorization
• Nonnegative matrix factorization for spectral data analysis
• A non-monotonic method for large-scale non-negative least squares
• Efficiency of Coordinate Descent Methods on Huge-Scale Optimization Problems
• Inexact block coordinate descent methods with application to non-negative matrix factorization
• Divergence Functions of Non negative Matrix Factorization: A Comparison Study
• Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
• Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
• NeNMF: An Optimal Gradient Method for Nonnegative Matrix Factorization
• Learning the parts of objects by non-negative matrix factorization
• Projected Gradient Methods for Nonnegative Matrix Factorization

This page was built for publication: Accelerated parallel and distributed algorithm using limited internal memory for nonnegative matrix factorization