A Bregman iterative algorithm for solving l^1 minimization problems
From MaRDI portal
Publication:2859933
Recommendations
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Iterative regularization with a general penalty term-theory and application to \(L^{1}\) and \(TV\) regularization
- The Split Bregman Method for L1-Regularized Problems
- Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
- Linearized Bregman iterations for compressed sensing
Cited in
(10)- Bregman iteration algorithm for sparse nonnegative matrix factorizations via alternating \(l_1\)-norm minimization
- Iterating Bregman Retractions
- Bregman iterative model using the \(G\)-norm
- Choice of the parameters in a primal-dual algorithm for Bregman iterated variational regularization
- A modified Bland's rule for solving \(l_1\) norm minimization
- Numerical aspects of the nonstationary modified linearized Bregman algorithm
- Application of a new accelerating Bregman iterative algorithm in the sparse least squares problems
- A new spectral method for \(l_1\)-regularized minimization
- A predictor-corrector algorithm based on Bregman iteration for sparse least squares problems
- Bregman iterative algorithms for 2D geosounding inversion
This page was built for publication: A Bregman iterative algorithm for solving \(l^1\) minimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2859933)
