Minimization of the $q$-ratio sparsity with $1<q\le \infty$ for signal recovery

Abstract

In this paper, we propose a general scale invariant approach for sparse signal recovery via the minimization of the $q$-ratio sparsity. When $1<q\le \infty$, both the theoretical analysis based on $q$-ratio constrained minimal singular values (CMSV) and the practical algorithms via nonlinear fractional programming are presented. Numerical experiments are conducted to demonstrate the advantageous performance of the proposed approaches over the state-of-the-art sparse recovery methods.

arXiv comment21 pages, 11 figures

References in corpus (6)

• Nearly unbiased variable selection under minimax concave penalty
• Performance Analysis of Sparse Recovery Based on Constrained Minimal Singular Values
• Extrapolated Proximal Subgradient Algorithms for Nonconvex and Nonsmooth Fractional Programs
• Mathematics of Sparsity and Entropy: Axioms, Core Functions and Sparse Recovery
• Limited-angle CT reconstruction via the L1/L2 minimization
• Analysis of The Ratio of ${\ell }_1$ and ${\ell }_2$ Norms in Compressed Sensing