Sciweavers

TSP
2010

Shifting inequality and recovery of sparse signals

12 years 11 months ago
Shifting inequality and recovery of sparse signals
Abstract--In this paper, we present a concise and coherent analysis of the constrained `1 minimization method for stable recovering of high-dimensional sparse signals both in the noiseless case and noisy case. The analysis is surprisingly simple and elementary, while leads to strong results. In particular, it is shown that the sparse recovery problem can be solved via `1 minimization under weaker conditions than what is known in the literature. A key technical tool is an elementary inequality, called Shifting Inequality, which, for a given nonnegative decreasing sequence, bounds the `2 norm of a subsequence in terms of the `1 norm of another subsequence by shifting the elements to the upper end.
T. Tony Cai, Lie Wang, Guangwu Xu
Added 22 May 2011
Updated 22 May 2011
Type Journal
Year 2010
Where TSP
Authors T. Tony Cai, Lie Wang, Guangwu Xu
Comments (0)