On exact recovery of sparse vectors from linear measurements
Let 1 ≤ k ≤ n < N. We say that a vector x ∈ ℝ N is k-sparse if it has at most k nonzero coordinates. Let Φ be an n × N matrix. We consider the problem of recovery of a k-sparse vector x ∈ ℝ N from the vector y = Φx ∈ ℝ n . We obtain almost-sharp necessary conditions for k, n, N for this problem to be reduced to that of minimization of the ℓ1-norm of vectors z satisfying the condition y = Φz.
Keywordscompressed sensing exact recovery of a k-sparse vector restricted isometry property element of best approximation estimates of Kolmogorov widths
Unable to display preview. Download preview PDF.
- 11.K.D. Ba, P. Indyk, E. Price, and D. P. Woodruff, “Lower bounds for sparse recovery,” in Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (SIAM, Philadelphia, PA, 2010), pp. 1190–1197.Google Scholar
- 13.S. M. Nikol’skii, “Approximation of functions in the mean by trigonometrical polynomials,” Izv. Akad. Nauk SSSR Ser. Mat. 10(3), 207–256 (1946).Google Scholar
- 14.A. B. Khodulev, “Exact values of Kolmogorov widths in finite-dimensional spaces,” Preprinty IPM, No. 185 (1988).Google Scholar