Sparse Approximation and Recovery by Greedy Algorithms

DOI10.1109/TIT.2014.2320932zbMath1360.94086arXiv1303.3595MaRDI QIDQ2986270

E. D. Livshitz, Vladimir N. Temlyakov

Publication date: 16 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1303.3595

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

A new result on recovery sparse signals using orthogonal matching pursuit, Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries, Random points are good for universal discretization, Sparse Approximation by Greedy Algorithms, Orthogonal matching pursuit under the restricted isometry property, Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit, Greedy approximation in convex optimization, SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES