Recovery analysis for weighted mixed _2 / _p minimization with 0 < p 1

DOI10.1016/J.CAM.2018.11.031MaRDI QIDQ1736367zbMATH OpenOpenAlexFDO

Authors Zhiyong Zhou, J. Yu

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

zbMATH Keywords

compressive sensingnon-convex minimizationblock sparseprior support information

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Nonconvex programming, global optimization (90C26)

Abstract: We study the recovery conditions of weighted mixed $el{l}_2/el{l}_p,(0<pleq1)$ minimization for block sparse signal reconstruction from compressed measurements when partial block support information is available. We show that the block $p$-restricted isometry property (RIP) can ensure the robust recovery. Moreover, we present the sufficient and necessary condition for the recovery by using weighted block $p$-null space property. The relationship between the block $p$-RIP and the weighted block $p$-null space property has been established. Finally, we illustrate our results with a series of numerical experiments.

Recommendations

• scientific article; zbMATH DE number 6830655
• Recovery analysis for weighted \(\ell_{1}\)-minimization using the null space property
• A sufficient condition on recovery of block sparse signals via mixed minimization
• An extended block restricted isometry property for sparse recovery with non-Gaussian noise
• Block sparse recovery via mixed l₂/l₁ minimization

Cites work

• A mathematical introduction to compressive sensing
• A short note on compressed sensing with partially known signal support
• Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation
• Blind Multiband Signal Reconstruction: Compressed Sensing for Analog Signals
• Block-Sparse Recovery via Convex Optimization
• Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
• Compressed sensing
• Compressed sensing of color images
• Decoding by Linear Programming
• Interpolation via weighted \(\ell_{1}\) minimization
• Iterative Reweighted <formula formulatype="inline"><tex Notation="TeX">$\ell_{2}/\ell_{1}$</tex> </formula> Recovery Algorithms for Compressed Sensing of Block Sparse Signals
• Model Selection and Estimation in Regression with Grouped Variables
• Model-Based Compressive Sensing
• Modified-CS: Modifying Compressive Sensing for Problems With Partially Known Support
• Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
• Recovering Compressively Sampled Signals Using Partial Support Information
• Recovery analysis for weighted \(\ell_{1}\)-minimization using the null space property
• Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
• Restricted isometry properties and nonconvex compressive sensing
• Robust Recovery of Signals From a Structured Union of Subspaces
• Robust Sparse Recovery in Impulsive Noise via $\ell _p$ -$\ell _1$ Optimization
• Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• Stable signal recovery from incomplete and inaccurate measurements
• Structured Compressed Sensing: From Theory to Applications
• The Group Lasso for Stable Recovery of Block-Sparse Signal Representations
• Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
• Weighted \(\ell_1\)-minimization for sparse recovery under arbitrary prior information

Cited in

(15)

• An extended block restricted isometry property for sparse recovery with non-Gaussian noise
• On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
• Recovery analysis for weighted \(\ell_{1}\)-minimization using the null space property
• A sufficient condition on recovery of block sparse signals via mixed minimization
• Stable recovery of approximately block \(k\)-sparse signals with partial block support information via weighted \(\ell_2/\ell_p\) (\(0 < p \leq 1\)) minimization
• Sparse recovery of weighted nonconvex \(\ell_q\)-minimization
• Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms for signal recovery with partial support information
• Non-convex compressed sensing using partial support information
• Phaseless compressive sensing using partial support information
• A perturbation analysis of nonconvex block-sparse compressed sensing
• Estimation of block sparsity in compressive sensing
• Robust signal recovery via \(\ell_{1-2}/ \ell_p\) minimization with partially known support
• Weighted \(l_p- l_1\) minimization methods for block sparse recovery and rank minimization
• Recovery analysis for block \(\ell_p-\ell_1\) minimization with prior support information
• New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization

This page was built for publication: Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)

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