Iterative hard thresholding based on randomized Kaczmarz method

DOI10.1007/S00034-014-9934-YzbMATH Open1358.94042OpenAlexW1981253261MaRDI QIDQ736906FDOQ736906

Authors: Zhuosheng Zhang, Yongchao Yu, Shumin Zhao 

Publication date: 5 August 2016

Published in: Circuits, Systems, and Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00034-014-9934-y

Recommendations

• Iterative hard thresholding for compressed sensing
• Linear convergence of the randomized sparse Kaczmarz method
• Hard thresholding pursuit: an algorithm for compressive sensing
• Two-point step-size iterative soft-thresholding method for sparse reconstruction
• Randomized sparse block Kaczmarz as randomized dual block-coordinate descent

zbMATH Keywords

compressed sensingiterative hard thresholdingsparse signal recoveryrandomized Kaczmarz method

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites Work

• A randomized Kaczmarz algorithm with exponential convergence
• Title not available (Why is that?)
• Sparse and redundant representations. From theory to applications in signal and image processing.
• From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
• Iterative hard thresholding for compressed sensing
• Iterative thresholding for sparse approximations
• Hard thresholding pursuit: an algorithm for compressive sensing
• Sparse Signal Reconstruction via ECME Hard Thresholding

This page was built for publication: Iterative hard thresholding based on randomized Kaczmarz method

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