Uniform Sufficient Condition For the Recovery of Non-Strictly Block $k$-Sparse Signals by Weighted $ℓ_{2,p} $− $\alpha ℓ_{2,q}$ Nonconvex Minimization Method

Author(s)

&

Abstract

Recovery of block sparse signals with partially-known block support information is of particular importance in compressed sensing. A uniform sufficient condition guaranteeing stable recovery of non-strictly block $k$-sparse signals is established via the weighted $ℓ_{2,p}−\alpha ℓ_{2,q}$ nonconvex minimization method, and the reconstruction error is precisely bounded in terms of the residual of block-sparsity and the measurement error. Furthermore, a series of contrastive numerical experiments reveal that exploiting the approximate block-sparsity characteristic and the nonuniform prior block support estimate substantially promotes the performance of reconstruction for block-structural signals.

Author Biographies

  • Wenhui Liu

    School of Mathematics, Sun Yat-sen University, Guangzhou 510275, China

  • Anhua Wan

    School of Mathematics, Sun Yat-sen University, Guangzhou 510275, China

About this article

Abstract View

  • 141

Pdf View

  • 93

DOI

10.4208/jcm.2505-m2024-0057

How to Cite

Uniform Sufficient Condition For the Recovery of Non-Strictly Block $k$-Sparse Signals by Weighted $ℓ_{2,p} $− $\alpha ℓ_{2,q}$ Nonconvex Minimization Method. (2025). Journal of Computational Mathematics. https://doi.org/10.4208/jcm.2505-m2024-0057