The Dantzig selector: recovery of signal via ℓ 1 − αℓ 2 minimization
From MaRDI portal
Publication:5014489
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.
Recommendations
- On Recovery of Sparse Signals Via $\ell _{1}$ Minimization
- Robust signal recovery via \(\ell_{1-2}/ \ell_p\) minimization with partially known support
- Recovery of sparsest signals via \(\ell^q \)-minimization
- Robust signal recovery for \(\ell_{1-2}\) minimization via prior support information
- Dualization of signal recovery problems
- Selective <inline-formula> <tex-math notation="TeX">$\ell_{1}$</tex-math></inline-formula> Minimization for Sparse Recovery
- Sparse recovery with general frame via general-dual-based analysis Dantzig selector
- Stable recovery of sparse signals via \(\ell_p\)-minimization
- Stable signal recovery with dual frames via \(l_p\)-minimization for \(0 < p \leq 1\)
- On the sign recovery by least absolute shrinkage and selection operator, thresholded least absolute shrinkage and selection operator, and thresholded basis pursuit denoising
Cites work
- scientific article; zbMATH DE number 5957408 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- A mathematical introduction to compressive sensing
- A weighted difference of anisotropic and isotropic total variation model for image processing
- An alternating direction method for finding Dantzig selectors
- Coherence pattern-guided compressive sensing with unresolved grids
- Compressive radar with off-grid targets: a perturbation approach
- Computing sparse representation in a highly coherent dictionary based on difference of L₁ and L₂
- Decoding by Linear Programming
- Fast L1-L2 minimization via a proximal operator
- Further properties of the forward-backward envelope with applications to difference-of-convex programming
- Global convergence of ADMM in nonconvex nonsmooth optimization
- High-dimensional graphs and variable selection with the Lasso
- Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
- MUSIC for single-snapshot spectral estimation: stability and super-resolution
- Minimization of \(\ell_{1-2}\) for compressed sensing
- New restricted isometry property analysis for \(\ell_1-\ell_2\) minimization methods
- On $l_q$ Optimization and Matrix Completion
- On support sizes of restricted isometry constants
- Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
- PhaseLiftOff: an accurate and stable phase retrieval method based on difference of trace and Frobenius norms
- Point source super-resolution via non-convex \(L_1\) based methods
- ROP: matrix recovery via rank-one projections
- Restricted isometry properties and nonconvex compressive sensing
- Sparse Phase Retrieval Via PhaseLiftOff
- Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
- Sparse and redundant representations. From theory to applications in signal and image processing.
- Sparse approximation using \(\ell_1-\ell_2\) minimization and its application to stochastic collocation
- Stable recovery of sparse overcomplete representations in the presence of noise
- Stable signal recovery from incomplete and inaccurate measurements
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- The linearized alternating direction method of multipliers for Dantzig selector
- Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
- Uncertainty principles and ideal atomic decomposition
- Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence
- Uniform RIP Conditions for Recovery of Sparse Signals by $\ell _p\,(0< p\leq 1)$ Minimization
- \(\ell_1-\alpha\ell_2\) minimization methods for signal and image reconstruction with impulsive noise removal
Cited in
(7)- Matrix recovery from nonconvex regularized least absolute deviations
- A multi-stage framework for Dantzig selector and LASSO
- On the sign recovery by least absolute shrinkage and selection operator, thresholded least absolute shrinkage and selection operator, and thresholded basis pursuit denoising
- Dualization of signal recovery problems
- Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization
- Enhanced total variation minimization for stable image reconstruction
- A proximal alternating direction method of multipliers for DC programming with structured constraints
This page was built for publication: The Dantzig selector: recovery of signal via ℓ 1 − αℓ 2 minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014489)
