Accelerating Sparse Recovery by Reducing Chatter

DOI10.1137/19M129111XMaRDI QIDQ5143291zbMATH OpenOpenAlexFDO

Authors Emmanouil Daskalakis, F. J. Herrmann, 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

zbMATH Keywords

chatterdynamical systemsinconsistent linear systemsKacmarzlinearized Bregmannonsmooth dynamicssparsity promotion

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Convex programming (90C25) Applications of mathematical programming (90C90) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cites work

• A randomized Kaczmarz algorithm with exponential convergence
• Accelerating deep neural network training with inconsistent stochastic gradient descent
• Adaptive subgradient methods for online learning and stochastic optimization
• Bifurcations in piecewise-smooth continuous systems
• Bregman Iterative Algorithms for \ell₁-Minimization with Applications to Compressed Sensing
• Convergence of the linearized Bregman iteration for \(\ell _1\)-norm minimization
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Incremental subgradient methods for nondifferentiable optimization
• Linear convergence of the randomized sparse Kaczmarz method
• Paved with good intentions: analysis of a randomized block Kaczmarz method
• Piecewise-smooth dynamical systems. Theory and applications
• Probing the Pareto frontier for basis pursuit solutions
• Randomized Kaczmarz solver for noisy linear systems
• Regularization and Variable Selection Via the Elastic Net
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Sparse Optimization with Least-Squares Constraints
• Sparse signal reconstruction via iterative support detection
• Sparsity and incoherence in compressive sampling
• The linearized Bregman method via split feasibility problems: analysis and generalizations

Cited in

(2)

• Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems
• Beyond the Bristol book: advances and perspectives in non-smooth dynamics and applications

Describes a project that uses

Uses Software

• SPGL1
• AdaGrad

This page was built for publication: Accelerating Sparse Recovery by Reducing Chatter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5143291)