Pages that link to "Item:Q3547717"
From MaRDI portal
The following pages link to Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization (Q3547717):
Displaying 18 items.
- Computing and analyzing recoverable supports for sparse reconstruction (Q269197) (← links)
- Feature selection when there are many influential features (Q396025) (← links)
- Remote sensing via \(\ell_1\)-minimization (Q404256) (← links)
- Sparse signal recovery using a new class of random matrices (Q520894) (← links)
- The null space property for sparse recovery from multiple measurement vectors (Q533503) (← links)
- Minimizers of sparsity regularized Huber loss function (Q831370) (← links)
- On the conditioning of random subdictionaries (Q930731) (← links)
- Sparsity in time-frequency representations (Q967573) (← links)
- Sparse recovery by non-convex optimization - instance optimality (Q984656) (← links)
- A hierarchical framework for recovery in compressive sensing (Q1693135) (← links)
- Strengthening hash families and compressive sensing (Q1932362) (← links)
- Necessary and sufficient conditions of solution uniqueness in 1-norm minimization (Q2260650) (← links)
- Concentration of \(S\)-largest mutilated vectors with \(\ell_p\)-quasinorm for \(0<p\leq 1\) and its applications (Q2449220) (← links)
- Multigrid with Rough Coefficients and Multiresolution Operator Decomposition from Hierarchical Information Games (Q2960400) (← links)
- Necessary and Sufficient Conditions for Noiseless Sparse Recovery via Convex Quadratic Splines (Q3119537) (← links)
- Cosparsity in Compressed Sensing (Q3460838) (← links)
- Submatrices with NonUniformly Selected Random Supports and Insights into Sparse Approximation (Q5006456) (← links)
- Sampling rates for \(\ell^1\)-synthesis (Q6142336) (← links)
