Descent methods for nonnegative matrix factorization
From MaRDI portal
Publication:2913167
DOI10.1007/978-94-007-0602-6_13zbMATH Open1251.65049OpenAlexW1919585499MaRDI QIDQ2913167FDOQ2913167
Ngoc-Diep Ho, Vincent D. Blondel, 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
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
numerical examplesnonnegative matrix factorizationdescent methodfast block coordinate methodrank-one residue iteration
Cites Work
- Efficient MATLAB Computations with Sparse and Factored Tensors
- Title not available (Why is that?)
- Title not available (Why is that?)
- Algorithms and applications for approximate nonnegative matrix factorization
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Title not available (Why is that?)
- Learning the parts of objects by non-negative matrix factorization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Interior-point gradient method for large-scale totally nonnegative least squares problems
- On reduced rank nonnegative matrix factorization for symmetric nonnegative matrices
- Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
- Nonnegative matrix factorization for spectral data analysis
- A continuous characterization of the maximum-edge biclique problem
- Descent Methods for Nonnegative Matrix Factorization
Cited In (6)
- Cyclic Coordinate-Update Algorithms for Fixed-Point Problems: Analysis and Applications
- Unilateral Orthogonal 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
- Descent methods for Nonnegative Matrix Factorization
- Descent Methods for Nonnegative Matrix Factorization
Uses Software
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)