Bounded matrix low rank approximation
From MaRDI portal
Publication:2807180
low rank approximationalternating least squaresconvergencesingular value decompositionalgorithmstochastic gradient descent
Recommendations
Cites work
- scientific article; zbMATH DE number 1818892 (Why is no real title available?)
- scientific article; zbMATH DE number 961607 (Why is no real title available?)
- Fast nonnegative matrix factorization: an active-set-like method and comparisons
- Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
- Nonnegative Matrix Factorization Based on Alternating Nonnegativity Constrained Least Squares and Active Set Method
- On the convergence of the block nonlinear Gauss-Seidel method under convex constraints
- Projected Gradient Methods for Nonnegative Matrix Factorization
Cited in
(6)- Hybrid clustering based on content and connection structure using joint nonnegative matrix factorization
- Structured low rank approximation of a Bezout matrix
- Low-Rank Matrix Approximation Using Point-Wise Operators
- Lower bounds for matrix factorization
- LLORMA: local low-rank matrix approximation
- Lower bounds for matrix factorization
This page was built for publication: Bounded matrix low rank approximation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2807180)