On the Performance of Sparse Recovery via L_p-minimization (0<=p <=1)

2010/11/26 by Wang, Meng, Xu, Weiyu, Tang, Ao · 1 citation
#FOS: Computer and information sciences #Information Theory (cs.IT)

paper · doi:10.48550/arxiv.1011.5936

Abstract

It is known that a high-dimensional sparse vector x* in Rⁿ can be recovered from low-dimensional measurements y= A^m*n x* (m

Cited by

• Sparsity via Hyperpriors: A Theoretical and Algorithmic Study under Empirical Bayes Framework

Related

• Recovery of sparsest signals via ℓ^q-minimization
• Consistency of l1 recovery from noisy deterministic measurements
• Sublinear Time, Approximate Model-based Sparse Recovery For All
• Non-negative Sparse Recovery at Minimal Sampling Rate
• Stable Recovery of Sparse Signals via l_p-Minimization