Descent methods for nonnegative matrix factorization

DOI10.1007/978-94-007-0602-6_13MaRDI QIDQ2913167zbMATHOpenAlexFDO

Authors Ngoc-Diep Ho, Paul van Dooren, Vincent D. Blondel

Publication date 26 September 2012

Published in Lecture Notes in Electrical Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-94-007-0602-6_13

zbMATH Keywords

numerical examplesnonnegative matrix factorizationdescent methodfast block coordinate methodrank-one residue iteration

Mathematics Subject Classification ID

Factorization of matrices (15A23) Iterative numerical methods for linear systems (65F10)

Recommendations

• Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
• Inexact block coordinate descent methods with application to non-negative matrix factorization
• An inexact update method with double parameters for nonnegative matrix factorization
• A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
• Projected Gradient Methods for Nonnegative Matrix Factorization

Cites work

• scientific article; zbMATH DE number 1818892 (Why is no real title available?)
• scientific article; zbMATH DE number 4115838 (Why is no real title available?)
• scientific article; zbMATH DE number 883145 (Why is no real title available?)
• scientific article; zbMATH DE number 961607 (Why is no real title available?)
• A continuous characterization of the maximum-edge biclique problem
• Algorithms and applications for approximate nonnegative matrix factorization
• Descent methods for nonnegative matrix factorization
• Efficient MATLAB Computations with Sparse and Factored Tensors
• Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
• Interior-point gradient method for large-scale totally nonnegative least squares problems
• Learning the parts of objects by non-negative matrix factorization
• Non-negative matrix factorization with sparseness constraints
• Nonnegative matrix factorization for spectral data analysis
• On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices
• Projected Gradient Methods for Nonnegative Matrix Factorization

Cited in

(10)

• A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion
• Cyclic coordinate-update algorithms for fixed-point problems: analysis and applications
• Unilateral Orthogonal Nonnegative Matrix Factorization
• Algorithms for nonnegative matrix and tensor factorizations: a unified view based on block coordinate descent framework
• Robust Manhattan non-negative matrix factorization for image recovery and representation
• Descent methods for nonnegative matrix factorization
• A globally convergent algorithm for nonconvex optimization based on block coordinate update
• Descent methods for Nonnegative Matrix Factorization
• Inexact block coordinate descent methods with application to non-negative matrix factorization
• A mixed iteration for nonnegative matrix factorizations

Describes a project that uses

Uses Software

• TensorToolbox
• NMFLAB

This page was built for publication: Descent methods for nonnegative matrix factorization

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