Accelerated iterative hard thresholding

Blumensath, Thomas (2012) Accelerated iterative hard thresholding Signal Processing, 92, (3), pp. 752-756. (doi:10.1016/j.sigpro.2011.09.017).


[img] PDF AIHT_rev_01.pdf - Author's Original
Download (276kB)


The iterativehardthresholding 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.

Item Type: Article
Digital Object Identifier (DOI): doi:10.1016/j.sigpro.2011.09.017
ISSNs: 0165-1684 (print)
Related URLs:
Organisations: Signal Processing & Control Grp
ePrint ID: 342649
Date :
Date Event
March 2012Published
Date Deposited: 11 Sep 2012 13:22
Last Modified: 17 Apr 2017 16:39
Further Information:Google Scholar

Actions (login required)

View Item View Item