On Accelerated Hard Thresholding Methods for Sparse Approximation

We propose and analyze acceleration schemes for hard thresholding methods with applications to sparse approximation in linear inverse systems. Our acceleration schemes fuse combinatorial, sparse projection algorithms with convex optimization algebra to provide computationally efficient and robust sparse recovery methods. We compare and contrast the (dis) advantages of the proposed schemes with the state-of-the-art, not only within hard thresholding methods, but also within convex sparse recovery algorithms.


Published in:
Wavelets And Sparsity Xiv, 8138, -
Presented at:
Conference on Wavelets and Sparsity XIV, San Diego, California, USA, Aug 21-24, 2011
Year:
2011
Publisher:
Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa
ISBN:
978-0-81948-748-3
Keywords:
Laboratories:




 Record created 2012-06-25, last modified 2018-11-20

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)