Hard thresholding pursuit algorithms: number of iterations

DOI10.1016/j.acha.2016.03.002zbMath1346.65012OpenAlexW2296052754MaRDI QIDQ739467

Jean-Luc Bouchot, Simon Foucart, Pawel Hitczenko

Publication date: 18 August 2016

Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.705.1885

zbMATH Keywords

iterative algorithmssparse matricescompressive sensinghard thresholdingrandom measurementsnonuniform sparse recoveryuniform sparse recovery

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Inverse problems in linear algebra (15A29) Iterative numerical methods for linear systems (65F10)

Related Items

Conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery, On the number of iterations for convergence of CoSaMP and subspace pursuit algorithms, Adaptive multi-penalty regularization based on a generalized Lasso path, Sparse signal recovery from phaseless measurements via hard thresholding pursuit, The finite steps of convergence of the fast thresholding algorithms with \(f\)-feedbacks in compressed sensing, A theoretical study of COmpRessed SolvING for advection-diffusion-reaction problems, A Generalized Class of Hard Thresholding Algorithms for Sparse Signal Recovery, Improved RIP-based bounds for guaranteed performance of two compressed sensing algorithms, Newton-type optimal thresholding algorithms for sparse optimization problems, HARFE: hard-ridge random feature expansion, Iterative hard thresholding for compressed data separation, Flavors of Compressive Sensing, The convergence guarantee of the iterative hard thresholding algorithm with suboptimal feedbacks for large systems, Fusion frames and distributed sparsity, Optimal $k$-Thresholding Algorithms for Sparse Optimization Problems, Binary sparse signal recovery with binary matching pursuit ^*, Partial gradient optimal thresholding algorithms for a class of sparse optimization problems, Hierarchical compressed sensing

Uses Software

• CoSaMP

Cites Work

• A mathematical introduction to compressive sensing
• Iterative hard thresholding for compressed sensing
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• A simple proof of the restricted isometry property for random matrices
• Nonuniform support recovery from noisy random measurements by orthogonal matching pursuit
• Stability and instance optimality for Gaussian measurements in compressed sensing
• Variations on a theorem of Candès, Romberg and Tao
• Counting faces of randomly projected polytopes when the projection radically lowers dimension
• Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• A Probabilistic and RIPless Theory of Compressed Sensing
• Sparse Recovery With Orthogonal Matching Pursuit Under RIP