Sparse recovery via ℓ p p /ℓ p q ratio minimization: theory and algorithm

Abstract The $\ell_p^p/\ell_q^p$ ratio model is scale invariant and well suited to sparse signal recovery, but its nonconvex, nonsmooth, and fractional structure complicates unified theoretical and algorithmic analysis. For $0<p\le1$ and $1<q<\infty$, this paper develops a unified framework for exact recovery, stable recovery of sparse and compressible signals, and convergence of a fractional algorithm. First, we establish a local optimality criterion and a null-space condition for uniform exact recovery, and derive high-probability sample-complexity bounds under independent isotropic sub-Gaussian measurements. For noisy recovery of $s$-sparse signals, we relax the sufficient condition based on the restricted isometry property (RIP) when $0<p<1$, while recovering the existing condition when $p=1$. Over the common admissible range of the restricted isometry constant (RIC), our error bound is tighter or identical. For compressible signals, we derive error estimates based on the RIP and the restricted orthogonality property (ROP) with dimension-independent constants, removing the explicit ambient-dimension dependence in existing results for $1<q<2$, and obtain an RIP-only sufficient condition that requires no separate restricted orthogonality constant (ROC) estimate. Finally, we propose a prox-linear Dinkelbach algorithm and prove that every cluster point is critical. Numerical experiments demonstrate that suitable choices of $(p,q)$ perform well for high-dynamic-range sparse signals and coherent sensing matrices.

Authors

Institutions

Publication Details

Journal
Inverse Problems
Published
2026-11-17
DOI
https://doi.org/10.1088/1361-6420/aec321
Citations
1
Primary Topic
Sparse and Compressive Sensing Techniques
Type
article
Field-Weighted Citation Impact
1.48

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

Sparse recovery via ℓ p p /ℓ p q ratio minimization: theory and algorithm

Lang Yu, Nan-jing Huang
1 citations
Inverse Problems
Sparse and Compressive Sensing Techniques
1.48
article

Sparse recovery via ℓ p p /ℓ p q ratio minimization: theory and algorithm

Lang Yu, Nan-jing Huang
article en
1 citations

Abstract

Abstract The $\ell_p^p/\ell_q^p$ ratio model is scale invariant and well suited to sparse signal recovery, but its nonconvex, nonsmooth, and fractional structure complicates unified theoretical and algorithmic analysis. For $0<p\le1$ and $1<q<\infty$, this paper develops a unified framework for exact recovery, stable recovery of sparse and compressible signals, and convergence of a fractional algorithm. First, we establish a local optimality criterion and a null-space condition for uniform exact recovery, and derive high-probability sample-complexity bounds under independent isotropic sub-Gaussian measurements. For noisy recovery of $s$-sparse signals, we relax the sufficient condition based on the restricted isometry property (RIP) when $0<p<1$, while recovering the existing condition when $p=1$. Over the common admissible range of the restricted isometry constant (RIC), our error bound is tighter or identical. For compressible signals, we derive error estimates based on the RIP and the restricted orthogonality property (ROP) with dimension-independent constants, removing the explicit ambient-dimension dependence in existing results for $1<q<2$, and obtain an RIP-only sufficient condition that requires no separate restricted orthogonality constant (ROC) estimate. Finally, we propose a prox-linear Dinkelbach algorithm and prove that every cluster point is critical. Numerical experiments demonstrate that suitable choices of $(p,q)$ perform well for high-dynamic-range sparse signals and coherent sensing matrices.

Inverse Problems
Sichuan University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 22%
Sparse and Compressive Sensing Techniques
1.48
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon