Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
From MaRDI portal
Publication:1736367
DOI10.1016/j.cam.2018.11.031zbMath1451.65075arXiv1709.00257OpenAlexW2905488426MaRDI QIDQ1736367
Publication date: 26 March 2019
Published in: Journal of Computational and Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1709.00257
Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items (4)
Estimation of block sparsity in compressive sensing ⋮ Recovery analysis for block ℓp − ℓ1 minimization with prior support information ⋮ Robust signal recovery via \(\ell_{1-2}/ \ell_p\) minimization with partially known support ⋮ Phaseless compressive sensing using partial support information
Cites Work
- A mathematical introduction to compressive sensing
- Interpolation via weighted \(\ell_{1}\) minimization
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Compressed sensing of color images
- A short note on compressed sensing with partially known signal support
- Recovery analysis for weighted \(\ell_{1}\)-minimization using the null space property
- Restricted isometry properties and nonconvex compressive sensing
- Decoding by Linear Programming
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
- Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
- Blind Multiband Signal Reconstruction: Compressed Sensing for Analog Signals
- The Group Lasso for Stable Recovery of Block-Sparse Signal Representations
- Structured Compressed Sensing: From Theory to Applications
- Block-Sparse Recovery via Convex Optimization
- Iterative Reweighted <formula formulatype="inline"><tex Notation="TeX">$\ell_{2}/\ell_{1}$</tex> </formula> Recovery Algorithms for Compressed Sensing of Block Sparse Signals
- Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
- Weighted ${\ell}_{{1}}$-minimization for sparse recovery under arbitrary prior information
- Robust Sparse Recovery in Impulsive Noise via $\ell _p$ -$\ell _1$ Optimization
- Robust Recovery of Signals From a Structured Union of Subspaces
- Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
- Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation
- Recovering Compressively Sampled Signals Using Partial Support Information
- Model-Based Compressive Sensing
- Model Selection and Estimation in Regression with Grouped Variables
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
This page was built for publication: Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
