ProV Logo
0

Stable Cosparse Recovery via \ell_p-anal...
Zhang, Shubao...
Stable Cosparse Recovery via \ell_p-analysis Optimization by Zhang, Shubao ( Author )
Australian National University
06-09-2023
In this paper we study the $\ell_p$-analysis optimization ($0<p\leq1$) problem for cosparse signal recovery. We establish a bound for recovery error via the restricted $p$-isometry property over any subspace. We further prove that the nonconvex $\ell_q$-analysis optimization can do recovery with a lower sample complexity and in a wider range of cosparsity than its convex counterpart. In addition, we develop an iteratively reweighted method to solve the optimization problem under a variational framework. Empirical results of preliminary computational experiments illustrate that the nonconvex method outperforms its convex counterpart.
-
Article
pdf
29.34 KB
English
-
MYR 0.01
-
http://arxiv.org/abs/1409.4575
Share this eBook