Paper
27 September 2011 On accelerated hard thresholding methods for sparse approximation
Volkan Cevher
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 "On accelerated hard thresholding methods for sparse approximation", Proc. SPIE 8138, Wavelets and Sparsity XIV, 813811 (27 September 2011); https://doi.org/10.1117/12.894386
Lens.org Logo
CITATIONS
Cited by 20 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Evolutionary algorithms

Amplifiers

Silicon

Convex optimization

Astatine

Matrices

Surface plasmons

RELATED CONTENT


Back to Top