Robust sparse recovery via a novel convex model

DOI10.1016/j.amc.2022.126923OpenAlexW4205207965MaRDI QIDQ2079105

Bin Zhao, Zhu Zeng, Pengbo Geng, Chen, Wengu

Publication date: 4 March 2022

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2022.126923

zbMATH Keywords

Dantzig selectorrestricted isometry propertybasis pursuit

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Communication, information (94Axx) Numerical methods for mathematical programming, optimization and variational techniques (65Kxx)

Uses Software

• CVX
• PDCO

Cites Work

• Unnamed Item
• A mathematical introduction to compressive sensing
• New bounds on the restricted isometry constant \(\delta _{2k}\)
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems
• Signal recovery under cumulative coherence
• Sharp RIP bound for sparse signal and low-rank matrix recovery
• Sparse recovery with coherent tight frames via analysis Dantzig selector and analysis LASSO
• Truncated sparse approximation property and truncated \(q\)-norm minimization
• Simultaneous analysis of Lasso and Dantzig selector
• Signal recovery from incomplete measurements in the presence of outliers
• The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
• Improved Iteratively Reweighted Least Squares for Unconstrained Smoothed $\ell_q$ Minimization
• Analysis Recovery With Coherent Frames and Correlated Measurements
• Compressed sensing and best 𝑘-term approximation
• Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing
• Decoding by Linear Programming
• Stable recovery of sparse overcomplete representations in the presence of noise
• Bounds on a Probability for the Heavy Tailed Distribution and the Probability of Deficient Decoding in Sequential Decoding
• Atomic Decomposition by Basis Pursuit
• A Proof of Conjecture on Restricted Isometry Property Constants $\delta _{tk}\ \left(0<t<\frac {4}{3}\right)$
• Shifting Inequality and Recovery of Sparse Signals
• Lorentzian Iterative Hard Thresholding: Robust Compressed Sensing With Prior Information
• Robust Sparse Recovery in Impulsive Noise via $\ell _p$ -$\ell _1$ Optimization
• ℓ ₁ − αℓ ₂ minimization methods for signal and image reconstruction with impulsive noise removal
• Optimal Restricted Isometry Condition of Normalized Sampling Matrices for Exact Sparse Recovery With Orthogonal Least Squares
• Non-Lipschitz Models for Image Restoration with Impulse Noise Removal
• New Bounds for Restricted Isometry Constants
• Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property
• Sparse Representation of a Polytope and Recovery of Sparse Signals and Low-Rank Matrices
• Improved Image Recovery From Compressed Data Contaminated With Impulsive Noise
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Stable signal recovery from incomplete and inaccurate measurements
• Robust Statistics
• Compressed sensing

This page was built for publication: Robust sparse recovery via a novel convex model