Structured Iterative Hard Thresholding with On- and Off-Grid Applications

2020/12/23 by Joseph Donato, Howard Levinson, Donato, Joseph S. +1
Computer Science · Engineering · Mathematics · #FOS: Mathematics #Image and Signal Denoising Methods #Numerical Analysis (math.NA) #Numerical methods in inverse problems #Sparse and Compressive Sensing Techniques

paper · pdf · doi:10.48550/arxiv.2012.12783

openalex publication_date 2020/12/23 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

We consider linear sparse recovery problems where additional structure regarding the support of the solution is known. The form of the structure considered is non-overlapping sets of indices that each contain part of the support. An algorithm based on iterative hard thresholding is proposed to solve this problem. The convergence and error of the method are analyzed with respect to mutual coherence. Numerical simulations are examined in the context of an inverse source problem, including modifications for off-grid recovery

Related

• Matrix Recipes for Hard Thresholding Methods
• Knowledge-Aided Normalized Iterative Hard Thresholding Algorithms and\n Applications to Sparse Reconstruction
• Are good local minima wide in sparse recovery?
• Nonlinear Iterative Hard Thresholding for Inverse Scattering
• A new and improved quantitative recovery analysis for iterative hard thresholding algorithms in compressed sensing