27 September 2011 On accelerated hard thresholding methods for sparse approximation
Author Affiliations +
Abstract
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.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Volkan Cevher, Volkan Cevher, } "On accelerated hard thresholding methods for sparse approximation", Proc. SPIE 8138, Wavelets and Sparsity XIV, 813811 (27 September 2011); doi: 10.1117/12.894386; https://doi.org/10.1117/12.894386
PROCEEDINGS
11 PAGES


SHARE
RELATED CONTENT

Convergence Of Parallel Block Jacobi Methods
Proceedings of SPIE (February 23 1988)
Compressed sensing for fusion frames
Proceedings of SPIE (September 04 2009)
Analysis Of Finlines On Biaxial Anisotropic Dielectric
Proceedings of SPIE (November 18 1989)

Back to Top