Continuous Optimization

On the l_1-Norm Invariant Convex k-Sparse Decomposition of Signals

Expand

Online published: 2013-12-30

Abstract

Inspired by an interesting idea of Cai and Zhang, we formulate and prove
the convex k-sparse decomposition of vectors that is invariant with respect to the
l_1 norm. This result fits well in discussing compressed sensing problems under the
Restricted Isometry property, but we believe it also has independent interest. As an
application, a simple derivation of the RIP recovery condition δk + θk,k < 1 is presented.

Cite this article

Guang-Wu Xu · Zhi-Qiang Xu . On the l_1-Norm Invariant Convex k-Sparse Decomposition of Signals[J]. Journal of the Operations Research Society of China, 2013 , 1(4) : 537 -541 . DOI: 10.1007/s40305-013-0030-y

Options
Outlines

/