Sparse Recovery Conditions and Performance Bounds for \ell _p-Minimization
From MaRDI portal
Sparse Recovery Conditions and Performance Bounds for $\ell p$-Minimization
Cited in
(15)- Exact recovery of sparse multiple measurement vectors by \(l_{2,p}\)-minimization
- Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\)
- Unconstrained \(\ell_1\)-\(\ell_2\) minimization for sparse recovery via mutual coherence
- Stability of 1-bit compressed sensing in sparse data reconstruction
- On a unified view of nullspace-type conditions for recoveries associated with general sparsity structures
- \(\ell^1\)-analysis minimization and generalized (co-)sparsity: when does recovery succeed?
- A necessary and sufficient condition for sparse vector recovery via \(\ell_1-\ell_2\) minimization
- Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
- Performance Analysis of Sparse Recovery Based on Constrained Minimal Singular Values
- Computable Performance Bounds on Sparse Recovery
- Semidefinite Programming for Computable Performance Bounds on Block-Sparsity Recovery
- Stable recovery of sparse signals via \(\ell_p\)-minimization
- On the Gap Between Restricted Isometry Properties and Sparse Recovery Conditions
- New conditions on robust and stable recovery of non-strictly k-ranked matrices via Schatten p-norm minimization
- Subgradient-based tableau pivot method for sparse signal recovery
This page was built for publication: Sparse Recovery Conditions and Performance Bounds for $\ell _p$-Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4628138)
