Pages that link to "Item:Q2269902"
From MaRDI portal
The following pages link to Stability and instance optimality for Gaussian measurements in compressed sensing (Q2269902):
Displaying 23 items.
- An orthogonal method for measurement matrix optimization (Q308066) (← links)
- Democracy in action: quantization, saturation, and compressive sensing (Q643647) (← links)
- Restricted \(p\)-isometry property and its application for nonconvex compressive sensing (Q695638) (← links)
- Computation of sparse low degree interpolating polynomials and their application to derivative-free optimization (Q715240) (← links)
- Instance-optimality in probability with an \(\ell _1\)-minimization decoder (Q734324) (← links)
- Hard thresholding pursuit algorithms: number of iterations (Q739467) (← links)
- Sparse recovery by non-convex optimization - instance optimality (Q984656) (← links)
- Sparse recovery from inaccurate saturated measurements (Q1630561) (← links)
- Signal recovery under mutual incoherence property and oracle inequalities (Q1731904) (← links)
- Sparse recovery in probability via \(l_q\)-minimization with Weibull random matrices for \(0 < q\leq 1\) (Q1747365) (← links)
- On the robustness of minimum norm interpolators and regularized empirical risk minimizers (Q2091842) (← links)
- AdaBoost and robust one-bit compressed sensing (Q2102435) (← links)
- On the robustness of noise-blind low-rank recovery from rank-one measurements (Q2168911) (← links)
- Stability and robustness of \(\ell_1\)-minimizations with Weibull matrices and redundant dictionaries (Q2437330) (← links)
- Structure dependent sampling in compressed sensing: theoretical guarantees for tight frames (Q2627887) (← links)
- Do log factors matter? On optimal wavelet approximation and the foundations of compressed sensing (Q2696571) (← links)
- Restricted isometry property for matrices whose entries are random variables belonging to some Orlicz spaces $L_U(\Omega )$ (Q2786959) (← links)
- Gabor Analysis for Imaging (Q2789835) (← links)
- One-Bit Compressed Sensing by Linear Programming (Q2841676) (← links)
- Compressive sensing Petrov-Galerkin approximation of high-dimensional parametric operator equations (Q2953202) (← links)
- On the geometry of polytopes generated by heavy-tailed random vectors (Q5066318) (← links)
- Robust recovery of a kind of weighted l1-minimization without noise level (Q5097878) (← links)
- Robust sparse recovery with sparse Bernoulli matrices via expanders (Q6657429) (← links)
