The Dantzig Selector: Sparse Signals Recovery via lp-q Minimization
Abstract
In the paper, we proposed the Dantzig selector based on the lp-q (0<p≤1, 1<q≤2) minimization for the signal recovery. First, we establish the convex combination representation of sparse vectors under the lp-q minimization problem. Next, we give the signal recovery guarantees that based on two classes of restricted isometry property frames. Last, some graphical illustrations are presented for the sufficient conditions of the signal recovery.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.