Pages that link to "Item:Q5272231"

The following pages link to On the Performance of Sparse Recovery Via $\ell_p$-Minimization $(0 \leq p \leq 1)$ (Q5272231):

Displaying 11 items.

• A theoretical perspective of solving phaseless compressive sensing via its nonconvex relaxation (Q778434) (← links)
• A perturbation inequality for concave functions of singular values and its applications in low-rank matrix recovery (Q905912) (← links)
• Univariate \(L^p\) and \(l^p\) averaging, \(0<p<1\), in polynomial time by utilization of statistical structure (Q1736520) (← links)
• Restricted \(p\)-isometry properties of partially sparse signal recovery (Q1956098) (← links)
• Sparse high-dimensional regression: exact scalable algorithms and phase transitions (Q2176621) (← links)
• Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery (Q2238869) (← links)
• A reweighted nuclear norm minimization algorithm for low rank matrix recovery (Q2252420) (← links)
• The sparsest solution of the union of finite polytopes via its nonconvex relaxation (Q2311128) (← links)
• Convergence and stability of iteratively reweighted least squares for low-rank matrix recovery (Q2360780) (← links)
• Evaluation of generalized degrees of freedom for sparse estimation by replica method (Q3302495) (← links)
• A unified analysis of convex and non-convex \(\ell_p\)-ball projection problems (Q6097485) (← links)