Transformed $\ell_p$ Minimization Model and Sparse Signal Recovery

TL;DR

This paper introduces a flexible non-convex TLp penalty model for sparse signal recovery, establishing theoretical guarantees and demonstrating robustness through numerical experiments.

Contribution

It proposes the TLp minimization model with adjustable parameters, introduces the concept of relaxation degree, and provides improved RIP bounds for signal recovery.

Findings

The IRLSTLp algorithm converges under certain conditions.

The TLp model outperforms traditional $\, ext{l}_p$ and TL1 models in promoting sparsity.

The RIP bounds for recovery are sharper and more general, especially as parameters vary.

Abstract

In this article, we introduce a minimization model via a non-convex transformed $\ell_p$ (TLp) penalty function with two parameters $a\in(0,\infty)$ and $p\in(0,1]$, where the case $p=1$ is known and was established by S. Zhang and J. Xin. Using the sparse convex-combination technique, we establish the exact and the stable sparse signal recovery based on the restricted isometry property (RIP). We apply a modified iteratively re-weighted least squares method and the difference of convex functions algorithm (DCA) to give the IRLSTLp algorithm for unconstrained TLp minimization and prove some convergence results. Finally, we conduct some numerical experiments to show the robustness of the IRLSTLp and the flexibility of the TLp minimization model. The novelty of these results lies in three aspects: (i) We introduce the concept of the relaxation degree RD$_P$ of a separable penalty function $P$ to quantitatively measure how closely $P$ approaches $\ell_0$, whose significance also lies in revealing the functional relationship of the parameters involved to keep a high performance of a multi-parameter minimization model. (ii) We introduce the TLp penalty, which includes two aforementioned adjustable parameters, offering more flexibility and stronger sparsity-promotion capability of the TLp minimization model, compared with the $\ell_p$ and the TL1 minimization models. (iii) The obtained RIP upper bound for signal recovery via TLp minimization can reduce, when $p\in(0,1]$ and as $a\to \infty$, to the sharp RIP bound obtained by R. Zhang and S. Li and, especially, can recover, when $p=1$, the well-known sharp bound $\delta_{2s}<\frac{\sqrt{2}}{2}$.