Adaptive Galerkin approximation algorithms for partial differential equations in infinite dimensions by Schwab, C, Suli, E

“…All constants in our error and complexity bounds are shown to be independent of the number of "active" coordinates identified by the proposed adaptive Galerkin approximation algorithms.…”

Performance Comparisons of Greedy Algorithms in Compressed Sensing by Blanchard, J, Tanner, J

“…Compressed sensing has motivated the development of numerous sparse approximation algorithms designed to return a solution to an underdetermined system of linear equations where the solution has the fewest number of nonzeros possible, referred to as the sparsest solution. …”

Conjugate Gradient Iterative Hard Thresholding: Observed Noise Stability for Compressed Sensing by Blanchard, J, Tanner, J, Wei, K

“…Conjugate Gradient Iterative Hard Thresholding (CGIHT) for compressed sensing combines the low per iteration complexity of fast greedy sparse approximation algorithms with the improved convergence rates of more complicated, projection based algorithms. …”