Hard thresholding pursuit algorithms: number of iterations

DOI10.1016/J.ACHA.2016.03.002zbMATH Open1346.65012OpenAlexW2296052754MaRDI QIDQ739467FDOQ739467

Paweł Hitczenko, Jean-Luc Bouchot, Simon Foucart

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

sparse matricesiterative algorithmscompressive sensinghard thresholdingrandom measurementsnonuniform sparse recoveryuniform sparse recovery

Mathematics Subject Classification ID

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

Cites Work

• A simple proof of the restricted isometry property for random matrices
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit
• Iterative hard thresholding for compressed sensing
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• A mathematical introduction to compressive sensing
• A Probabilistic and RIPless Theory of Compressed Sensing
• Sparse Recovery With Orthogonal Matching Pursuit Under RIP
• 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
• Nonuniform support recovery from noisy random measurements by orthogonal matching pursuit

Cited In (21)

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

Uses Software

• CoSaMP

This page was built for publication: Hard thresholding pursuit algorithms: number of iterations

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