Robust Sparse Recovery in Impulsive Noise via \ell _p -\ell _1 Optimization
From MaRDI portal
Publication:4620514
Cited in
(16)- Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
- Robust sparse recovery via a novel convex model
- Extended randomized Kaczmarz method for sparse least squares and impulsive noise problems
- A smoothing neural network for minimization \(l_1\)-\(l_p\) in sparse signal reconstruction with measurement noises
- Group sparse recovery in impulsive noise via alternating direction method of multipliers
- _1-_2 minimization methods for signal and image reconstruction with impulsive noise removal
- Tail properties and approximate distribution and expansion for extreme of LGMD
- Stable and robust $\ell_p$-constrained compressive sensing recovery via robust width property
- An analysis of noise folding for low-rank matrix recovery
- A smoothing inertial neural network for sparse signal reconstruction with noise measurements via L_p-L₁ minimization
- Neurodynamic approaches for sparse recovery problem with linear inequality constraints
- A Lorentzian-\(\ell_p\) norm regularization based algorithm for recovering sparse signals in two types of impulsive noise
- High-order block RIP for nonconvex block-sparse compressed sensing
- New conditions on robust and stable recovery of non-strictly k-ranked matrices via Schatten p-norm minimization
- Stable recovery of sparse signals with non-convex weighted r-norm minus 1-norm
- Nonconvex nonsmooth low-rank minimization for generalized image compressed sensing via group sparse representation
This page was built for publication: Robust Sparse Recovery in Impulsive Noise via $\ell _p$ -$\ell _1$ Optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4620514)
