The Dantzig selector: recovery of signal via ℓ 1 − αℓ 2 minimization

DOI10.1088/1361-6420/AC39F8zbMATH Open1479.94063arXiv2105.14229OpenAlexW4200182950MaRDI QIDQ5014489FDOQ5014489

Authors: Huanmin Ge, Peng Li 

Publication date: 8 December 2021

Published in: Inverse Problems (Search for Journal in Brave)

Abstract: In the paper, we proposed the Dantzig selector based on the $el{l}_1-alphael{l}_2$~$(0<alphaleq1)$ minimization for the signal recovery. In the Dantzig selector, the constraint $$ for some small constant $eta>0$ 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.

Full work available at URL: https://arxiv.org/abs/2105.14229

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

zbMATH Keywords

restricted isometry propertyDantzig selectorsparse signal recovery\(\ell_1-\alpha\ell_2\) minimization

Mathematics Subject Classification ID

Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cites Work

• Coherence pattern-guided compressive sensing with unresolved grids
• Title not available (Why is that?)
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• High-dimensional graphs and variable selection with the Lasso
• Title not available (Why is that?)
• Decoding by Linear Programming
• Stable recovery of sparse overcomplete representations in the presence of noise
• Stable signal recovery from incomplete and inaccurate measurements
• Sparse and redundant representations. From theory to applications in signal and image processing.
• Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
• A mathematical introduction to compressive sensing
• Uncertainty principles and ideal atomic decomposition
• Restricted isometry properties and nonconvex compressive sensing
• The linearized alternating direction method of multipliers for Dantzig selector
• Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
• ROP: matrix recovery via rank-one projections
• MUSIC for single-snapshot spectral estimation: stability and super-resolution
• A weighted difference of anisotropic and isotropic total variation model for image processing
• Point source super-resolution via non-convex \(L_1\) based methods
• Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\)
• Minimization of \(\ell_{1-2}\) for compressed sensing
• Compressive radar with off-grid targets: a perturbation approach
• An alternating direction method for finding Dantzig selectors
• On support sizes of restricted isometry constants
• Global convergence of ADMM in nonconvex nonsmooth optimization
• Truncated $l_{1-2}$ Models for Sparse Recovery and Rank Minimization
• On $l_q$ Optimization and Matrix Completion
• PhaseLiftOff: an accurate and stable phase retrieval method based on difference of trace and Frobenius norms
• Fast L1-L2 minimization via a proximal operator
• Further properties of the forward-backward envelope with applications to difference-of-convex programming
• Uniform RIP Conditions for Recovery of Sparse Signals by $\ell _p\,(0< p\leq 1)$ Minimization
• Sparse Phase Retrieval Via PhaseLiftOff
• Sparse approximation using \(\ell_1-\ell_2\) minimization and its application to stochastic collocation
• Optimal RIP bounds for sparse signals recovery via \(\ell_p\) minimization
• \(\ell_1-\alpha\ell_2\) minimization methods for signal and image reconstruction with impulsive noise removal
• Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence
• New restricted isometry property analysis for \(\ell_1-\ell_2\) minimization methods

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
• Enhanced total variation minimization for stable image reconstruction
• Dualization of signal recovery problems
• Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization
• A proximal alternating direction method of multipliers for DC programming with structured constraints

Uses Software

• BLOOMP

This page was built for publication: The Dantzig selector: recovery of signal via ℓ ₁ − αℓ ₂ minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5014489)