PROMP: A sparse recovery approach to lattice-valued signals
Authors:
- Axel FlinthAFAxel Flinth
- Gitta KutyniokGKGitta Kutyniok
- 1 November 2018
- journal article
- research article
- Published by Elsevier in Applied and Computational Harmonic Analysis
- Vol. 45 (3) , 668-708
Abstract
No abstract availableKeywords
Funding Information
- Deutsche Forschungsgemeinschaft (KU 1446/18)
- Einstein Stiftung Berlin
- Einstein Center for Mathematics Berlin
- Future & Emerging Technologies (FET) Program
- Deutsche Forschungsgemeinschaft (KU 1446/18)
This publication has 25 references indexed in Scilit:
- Probability of unique integer solution to a system of linear equationsEuropean Journal of Operational Research, 2011
- Iteratively reweighted least squares minimization for sparse recoveryCommunications on Pure and Applied Mathematics, 2009
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samplesApplied and Computational Harmonic Analysis, 2009
- Stable signal recovery from incomplete and inaccurate measurementsCommunications on Pure and Applied Mathematics, 2006
- Smallest singular value of random matrices and geometry of random polytopesAdvances in Mathematics, 2005
- Greed is Good: Algorithmic Results for Sparse ApproximationIEEE Transactions on Information Theory, 2004
- Closest point search in latticesIEEE Transactions on Information Theory, 2002
- Local Operator Theory, Random Matrices and Banach Spaces2001
- Atomic Decomposition by Basis PursuitSIAM Journal on Scientific Computing, 1998
- Lower bounds on the maximum cross correlation of signals (Corresp.)IEEE Transactions on Information Theory, 1974