On the Performance of Sparse Recovery Via $\ell_p$-Minimization $(0 \leq p \leq 1)$
From MaRDI portal
Publication:5272231
DOI10.1109/TIT.2011.2159959zbMath1365.65177OpenAlexW1786681852MaRDI QIDQ5272231
Publication date: 12 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tit.2011.2159959
Numerical optimization and variational techniques (65K10) Applications of optimal control and differential games (49N90) Sampling theory in information and communication theory (94A20)
Related Items (12)
Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery ⋮ Sparse high-dimensional regression: exact scalable algorithms and phase transitions ⋮ A unified analysis of convex and non-convex \(\ell_p\)-ball projection problems ⋮ A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery ⋮ Restricted \(p\)-isometry properties of partially sparse signal recovery ⋮ Univariate \(L^p\) and \(l^p\) averaging, \(0<p<1\), in polynomial time by utilization of statistical structure ⋮ Evaluation of generalized degrees of freedom for sparse estimation by replica method ⋮ Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery ⋮ A reweighted nuclear norm minimization algorithm for low rank matrix recovery ⋮ Spherical Designs and Nonconvex Minimization for Recovery of Sparse Signals on the Sphere ⋮ The sparsest solution of the union of finite polytopes via its nonconvex relaxation ⋮ A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation
This page was built for publication: On the Performance of Sparse Recovery Via $\ell_p$-Minimization $(0 \leq p \leq 1)$
