A^--linearized Bregman iteration algorithm
From MaRDI portal
Publication:3071307
Recommendations
- Linearized Bregman iterations for compressed sensing
- Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
- Fast linearized Bregman iteration for compressive sensing and sparse denoising
- Accelerated linearized Bregman method
- Analysis and generalizations of the linearized Bregman method
Cited in
(14)- Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating \(l_1\)-norm minimization
- Linearized Bregman iterations for compressed sensing
- 2D complex sparse reconstruction algorithm with LBI and its application
- Linearized Krylov subspace Bregman iteration with nonnegativity constraint
- Iterating Bregman Retractions
- Reweighted minimization model for MR image reconstruction with split Bregman method
- Error forgetting of Bregman iteration
- Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
- Revisiting linearized Bregman iterations under Lipschitz-like convexity condition
- A chaotic iterative algorithm based on linearized Bregman iteration for image deblurring
- Fast linearized Bregman iteration for compressive sensing and sparse denoising
- Application of a new accelerating Bregman iterative algorithm in the sparse least squares problems
- An improved algorithm for basis pursuit problem and its applications
- A predictor-corrector algorithm based on Bregman iteration for sparse least squares problems
This page was built for publication: \(A^-\)-linearized Bregman iteration algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3071307)
