Alternating block linearized Bregman iterations for regularized nonnegative matrix factorization
From MaRDI portal
Publication:6574508
Cites work
- A descent lemma beyond Lipschitz gradient continuity: first-order methods revisited and applications
- Analysis and generalizations of the linearized Bregman method
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Convergence of a block coordinate descent method for nondifferentiable minimization
- First order methods beyond convexity and Lipschitz gradient continuity with applications to quadratic inverse problems
- Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
- Inertial proximal alternating linearized minimization (iPALM) for nonconvex and nonsmooth problems
- Learning the parts of objects by non-negative matrix factorization
- Novel proximal gradient methods for nonnegative matrix factorization with sparsity constraints
- Projected Gradient Methods for Nonnegative Matrix Factorization
- Proximal Alternating Minimization and Projection Methods for Nonconvex Problems: An Approach Based on the Kurdyka-Łojasiewicz Inequality
- Proximal alternating linearized minimization for nonconvex and nonsmooth problems
- Revisiting linearized Bregman iterations under Lipschitz-like convexity condition
This page was built for publication: Alternating block linearized Bregman iterations for regularized nonnegative matrix factorization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6574508)
