Random Sampling of Sparse Trigonometric Polynomials, II. Orthogonal Matching Pursuit versus Basis Pursuit
Top Cited Papers
- 10 August 2007
- journal article
- research article
- Published by Springer Nature in Foundations of Computational Mathematics
- Vol. 8 (6) , 737-763
- https://doi.org/10.1007/s10208-007-9005-x
Abstract
No abstract availableKeywords
All Related Versions
This publication has 36 references indexed in Scilit:
- For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solutionCommunications on Pure and Applied Mathematics, 2006
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- Decoding by Linear ProgrammingIEEE Transactions on Information Theory, 2005
- Random Sampling of Multivariate Trigonometric PolynomialsSIAM Journal on Mathematical Analysis, 2005
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004
- Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric conesOptimization Methods and Software, 1999
- Best constants in Kahane-Khintchine inequalities for complex Steinhaus functionsProceedings of the American Mathematical Society, 1995
- Matching pursuits with time-frequency dictionariesIEEE Transactions on Signal Processing, 1993
- LSQR: An Algorithm for Sparse Linear Equations and Sparse Least SquaresACM Transactions on Mathematical Software, 1982
- Probability Inequalities for the Sum of Independent Random VariablesJournal of the American Statistical Association, 1962