Descent Methods for Nonnegative Matrix Factorization

DOI10.1007/978-94-007-0602-6_13zbMath1251.65049OpenAlexW1919585499MaRDI QIDQ2913167

Ngoc-Diep Ho, Blondel, Vincent D., Paul Van Dooren

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 examplesdescent methodnonnegative matrix factorizationfast block coordinate methodrank-one residue iteration

Mathematics Subject Classification ID

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

Related Items (4)

Descent Methods for Nonnegative Matrix Factorization ⋮ Robust Manhattan non-negative matrix factorization for image recovery and representation ⋮ A globally convergent algorithm for nonconvex optimization based on block coordinate update ⋮ Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications

Uses Software

• TensorToolbox
• NMFLAB

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices
• A continuous characterization of the maximum-edge biclique problem
• Interior-point gradient method for large-scale totally nonnegative least squares problems
• Algorithms and applications for approximate nonnegative matrix factorization
• Nonnegative matrix factorization for spectral data analysis
• Descent Methods for Nonnegative Matrix Factorization
• Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
• Efficient MATLAB Computations with Sparse and Factored Tensors
• Learning the parts of objects by non-negative matrix factorization
• Projected Gradient Methods for Nonnegative Matrix Factorization

This page was built for publication: Descent Methods for Nonnegative Matrix Factorization