A New and Improved Quantitative Recovery Analysis for Iterative Hard Thresholding Algorithms in Compressed Sensing

DOI10.1109/TIT.2015.2399919zbMath1359.94071arXiv1309.5406MaRDI QIDQ2978705

Andrew Thompson, Coralia Cartis

Publication date: 28 April 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1309.5406

Mathematics Subject Classification ID

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

Related Items (7)

Relationship between the optimal solutions of least squares regularized with \(\ell_{0}\)-norm and constrained by \(k\)-sparsity ⋮ Performance comparisons of greedy algorithms in compressed sensing ⋮ An efficient radiation analysis approach through compressive model for laser driven inertial confinement fusion ⋮ Constraint matrix factorization for space variant PSFs field restoration ⋮ CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion ⋮ Approximately normalized iterative hard thresholding for nonlinear compressive sensing ⋮ On the Minimization Over Sparse Symmetric Sets: Projections, Optimality Conditions, and Algorithms

This page was built for publication: A New and Improved Quantitative Recovery Analysis for Iterative Hard Thresholding Algorithms in Compressed Sensing