Accelerating Sparse Recovery by Reducing Chatter
From MaRDI portal
Publication:5143291
DOI10.1137/19M129111XMaRDI QIDQ5143291
Felix J. Herrmann, Emmanouil Daskalakis, Rachel Kuske
Publication date: 11 January 2021
Published in: SIAM Journal on Imaging Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/19m129111x
dynamical systems; nonsmooth dynamics; chatter; inconsistent linear systems; linearized Bregman; sparsity promotion; Kacmarz
65K05: Numerical mathematical programming methods
90C25: Convex programming
90C90: Applications of mathematical programming
94A08: Image processing (compression, reconstruction, etc.) in information and communication theory
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Randomized Kaczmarz solver for noisy linear systems
- A randomized Kaczmarz algorithm with exponential convergence
- Linear convergence of the randomized sparse Kaczmarz method
- Accelerating deep neural network training with inconsistent stochastic gradient descent
- Piecewise-smooth dynamical systems. Theory and applications
- Paved with good intentions: analysis of a randomized block Kaczmarz method
- Incremental Subgradient Methods for Nondifferentiable Optimization
- The Linearized Bregman Method via Split Feasibility Problems: Analysis and Generalizations
- Convergence of the linearized Bregman iteration for ℓ₁-norm minimization
- Sparse Optimization with Least-Squares Constraints
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Probing the Pareto Frontier for Basis Pursuit Solutions
- Sparsity and incoherence in compressive sampling
- Regularization and Variable Selection Via the Elastic Net
- Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
- Sparse Signal Reconstruction via Iterative Support Detection
