Structured Iterative Hard Thresholding with Off-Grid Applications

12/23/2020

∙

We consider linear sparse recovery problems where additional structure of the sparsity in the solution is known. An algorithm based on iterative hard thresholding is proposed to solve this problem. The convergence and error of the method was analyzed with respect to mutual coherence. Numerical simulations are examined in the context of an inverse source problem, including modifications for off-grid recovery.

READ FULL TEXT

Structured Iterative Hard Thresholding with Off-Grid Applications

Stochastic Iterative Hard Thresholding for Low-Tucker-Rank Tensor Recovery

Knowledge-Aided Normalized Iterative Hard Thresholding Algorithms and Applications to Sparse Reconstruction

Learning Sparse Distributions using Iterative Hard Thresholding

A Nonlinear Acceleration Method for Iterative Algorithms

Interaction Hard Thresholding: Consistent Sparse Quadratic Regression in Sub-quadratic Time and Space

Orthogonal subspace based fast iterative thresholding algorithms for joint sparsity recovery

Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime

Structured Iterative Hard Thresholding with Off-Grid Applications

Related Research

Stochastic Iterative Hard Thresholding for Low-Tucker-Rank Tensor Recovery

Knowledge-Aided Normalized Iterative Hard Thresholding Algorithms and Applications to Sparse Reconstruction

Learning Sparse Distributions using Iterative Hard Thresholding

A Nonlinear Acceleration Method for Iterative Algorithms

Interaction Hard Thresholding: Consistent Sparse Quadratic Regression in Sub-quadratic Time and Space

Orthogonal subspace based fast iterative thresholding algorithms for joint sparsity recovery

Iterative Hard Thresholding with Adaptive Regularization: Sparser Solutions Without Sacrificing Runtime