Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating l₁-norm minimization
DOI10.1007/S11045-011-0147-2zbMATH Open1337.65038OpenAlexW1981885934WikidataQ114224597 ScholiaQ114224597MaRDI QIDQ490274FDOQ490274
Publication date: 22 January 2015
Published in: Multidimensional Systems and Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11045-011-0147-2
Recommendations
- Multi-block Bregman proximal alternating linearized minimization and its application to orthogonal nonnegative matrix factorization
- A Bregman iterative algorithm for solving \(l^1\) minimization problems
- \(A^-\)-linearized Bregman iteration algorithm
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Novel proximal gradient methods for nonnegative matrix factorization with sparsity constraints
- scientific article; zbMATH DE number 5631077
- Alternating proximal gradient method for sparse nonnegative Tucker decomposition
- Application of a new accelerating Bregman iterative algorithm in the sparse least squares problems
- Nonconvex sorted \(\ell_1\) minimization for sparse approximation
Nontrigonometric harmonic analysis involving wavelets and other special systems (42C40) Computational methods for sparse matrices (65F50) Application of orthogonal and other special functions (94A11)
Cites Work
- Title not available (Why is that?)
- Independent component analysis, a new concept?
- Stable signal recovery from incomplete and inaccurate measurements
- Title not available (Why is that?)
- Learning the parts of objects by non-negative matrix factorization
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Linearized Bregman iterations for compressed sensing
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- Linearized Bregman Iterations for Frame-Based Image Deblurring
- Hierarchical ALS Algorithms for Nonnegative Matrix and 3D Tensor Factorization
- Introducing a weighted non-negative matrix factorization for image classification
- Fast linearized Bregman iteration for compressive sensing and sparse denoising
- Nonnegative matrix factorization for spectral data analysis
- Local feature analysis: a general statistical theory for object representation
Cited In (5)
- A coupled variational model for image denoising using a duality strategy and split Bregman
- Image decomposition combining a total variational filter and a Tikhonov quadratic filter
- Split Bregman algorithms for sparse group lasso with application to MRI reconstruction
- Split Bregman algorithms for multiple measurement vector problem
- Neighbors isometric embedding nonnegative matrix factorization for image representation
This page was built for publication: Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating \(l_1\)-norm minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490274)
