Robust sparse recovery via a novel convex model
type: Item
instance of: scholarly article
title: Robust sparse recovery via a novel convex model
author: Bin Zhao
author: Pengbo Geng
author: Zhu Zeng
author: Wengu Chen
published in: Applied Mathematics and Computation
publication date: 2022-03-04T00:00:00Z
Mathematics Subject Classification ID: 94Axx
Mathematics Subject Classification ID: 90Cxx
Mathematics Subject Classification ID: 65Kxx
zbMATH DE Number: 7484230
zbMATH Keywords: restricted isometry property
zbMATH Keywords: Dantzig selector
zbMATH Keywords: basis pursuit
describes a project that uses: CVX
describes a project that uses: PDCO
MaRDI profile type: Publication
full work available at URL: j.amc.2022.126923
OpenAlex ID: W4205207965
cites work: On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
cites work: Simultaneous analysis of Lasso and Dantzig selector
cites work: Lorentzian Iterative Hard Thresholding: Robust Compressed Sensing With Prior Information
cites work: Atomic Decomposition by Basis Pursuit
cites work: Compressed sensing and best 𝑘-term approximation
cites work: Truncated sparse approximation property and truncated \(q\)-norm minimization
cites work: Decoding by Linear Programming
cites work: The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
cites work: Stable signal recovery from incomplete and inaccurate measurements
cites work: New Bounds for Restricted Isometry Constants
cites work: Shifting Inequality and Recovery of Sparse Signals
cites work: Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
cites work: Sharp RIP bound for sparse signal and low-rank matrix recovery
cites work: Compressed sensing
cites work: For most large underdetermined systems of linear equations the minimal 𝓁1‐norm solution is also the sparsest solution
cites work: Stable recovery of sparse overcomplete representations in the presence of noise
cites work: Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
cites work: Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
cites work: A mathematical introduction to compressive sensing
cites work: Robust Statistics
cites work: Bounds on a Probability for the Heavy Tailed Distribution and the Probability of Deficient Decoding in Sequential Decoding
cites work: Optimal Restricted Isometry Condition of Normalized Sampling Matrices for Exact Sparse Recovery With Orthogonal Least Squares
cites work: ℓ 1 − αℓ 2 minimization methods for signal and image reconstruction with impulsive noise removal
cites work: Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
cites work: Signal recovery under cumulative coherence
cites work: Improved iteratively reweighted least squares for unconstrained smoothed \(\ell_q\) minimization
cites work: New bounds on the restricted isometry constant \(\delta _{2k}\)
cites work: Signal recovery from incomplete measurements in the presence of outliers
cites work: Improved Image Recovery From Compressed Data Contaminated With Impulsive Noise
cites work: Q4301585
cites work: Robust Sparse Recovery in Impulsive Noise via $\ell _p$ -$\ell _1$ Optimization
cites work: Analysis Recovery With Coherent Frames and Correlated Measurements
cites work: Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
cites work: A Proof of Conjecture on Restricted Isometry Property Constants $\delta _{tk}\ \left(0<t<\frac {4}{3}\right)$
cites work: Non-Lipschitz Models for Image Restoration with Impulse Noise Removal
DOI: 10.1016/J.AMC.2022.126923
description: scientific article; zbMATH DE number 7484230