A dual split Bregman method for fast $\ell ^1$ minimization
From MaRDI portal
Publication:5326502
DOI10.1090/S0025-5718-2013-02700-7zbMath1270.49026MaRDI QIDQ5326502
Yi Yang, Michael Moeller, Stanley J. Osher
Publication date: 6 August 2013
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-2013-02700-7
optimization algorithms; sparsity; compressed sensing; calculus of variation; \(\ell^1\)-minimization
65F22: Ill-posedness and regularization problems in numerical linear algebra
90C25: Convex programming
49M29: Numerical methods involving duality
65K10: Numerical optimization and variational techniques
Related Items
A time continuation based fast approximate algorithm for compressed sensing related optimization, Accelerated Bregman method for linearly constrained \(\ell _1-\ell _2\) minimization, Split Bregman method for minimization of fast multiphase image segmentation model for inhomogeneous images, Inexact accelerated augmented Lagrangian methods, Linearized Krylov subspace Bregman iteration with nonnegativity constraint, Fast sparse reconstruction: Greedy inverse scale space flows, Eventual linear convergence of the Douglas-Rachford iteration for basis pursuit
Cites Work
- Unnamed Item
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- On the convergence rate of Douglas-Rachford operator splitting method
- Error estimation for Bregman iterations and inverse scale space methods in image restoration
- Fast linearized Bregman iteration for compressive sensing and sparse denoising
- Accelerated linearized Bregman method
- Nonlinear inverse scale space methods
- On the $O(1/n)$ Convergence Rate of the Douglas–Rachford Alternating Direction Method
- A Variational Approach for Sharpening High Dimensional Images
- Analysis and Generalizations of the Linearized Bregman Method
- Linearized Bregman iterations for compressed sensing
- Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
- The Split Bregman Method for L1-Regularized Problems
- Decoding by Linear Programming
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Split Bregman Methods and Frame Based Image Restoration
- An adaptive inverse scale space method for compressed sensing
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- An Iterative Regularization Method for Total Variation-Based Image Restoration
- Compressed sensing
