The Dantzig selector: Recovery of Signal via Minimization
arXiv:2105.14229 · doi:10.1088/1361-6420/ac39f8
Abstract
In the paper, we proposed the Dantzig selector based on the ~ minimization for the signal recovery. In the Dantzig selector, the constraint for some small constant means the columns of has very weakly correlated with the error vector . First, recovery guarantees based on the restricted isometry property (RIP) are established for signals. Next, we propose the effective algorithm to solve the proposed Dantzig selector. Last, we illustrate the proposed model and algorithm by extensive numerical experiments for the recovery of signals in the cases of Gaussian, impulsive and uniform noise. And the performance of the proposed Dantzig selector is better than that of the existing methods.
References in corpus (13)
- High-dimensional graphs and variable selection with the Lasso
- ROP: Matrix recovery via rank-one projections
- Discussion: The Dantzig selector: Statistical estimation when is much larger than
- Discussion: A tale of three cousins: Lasso, L2Boosting and Dantzig
- Discussion: The Dantzig selector: Statistical estimation when is much larger than
- Compressive Radar with Off-Grid Targets: A Perturbation Approach
- Discussion: The Dantzig selector: Statistical estimation when is much larger than
- Sparse phase retrieval via Phaseliftoff
- Discussion: The Dantzig selector: Statistical estimation when is much larger than
- SNR Estimation in Linear Systems with Gaussian Matrices
- Generalized Dantzig Selector: Application to the k-support norm
- Discussion: The Dantzig selector: statistical estimation when is much larger than
- Compressive Imaging of Subwavelength Structures II. Periodic Rough Surfaces