Coherence analysis of iterative thresholding algorithms
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
IEEE Transactions on Information Theory
Sampling and Reconstructing Signals From a Union of Linear Subspaces
IEEE Transactions on Information Theory
Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
SIAM Journal on Numerical Analysis
Matrix Recipes for Hard Thresholding Methods
Journal of Mathematical Imaging and Vision
| Hi-index | 0.08 |
The iterative hard thresholding algorithm (IHT) is a powerful and versatile algorithm for compressed sensing and other sparse inverse problems. The standard IHT implementation faces several challenges when applied to practical problems. The step-size and sparsity parameters have to be chosen appropriately and, as IHT is based on a gradient descend strategy, convergence is only linear. Whilst the choice of the step-size can be done adaptively as suggested previously, this letter studies the use of acceleration methods to improve convergence speed. Based on recent suggestions in the literature, we show that a host of acceleration methods are also applicable to IHT. Importantly, we show that these modifications not only significantly increase the observed speed of the method, but also satisfy the same strong performance guarantees enjoyed by the original IHT method.