Pages that link to "Item:Q3079195"
From MaRDI portal
The following pages link to Compressed sensing and best 𝑘-term approximation (Q3079195):
Displaying 50 items.
- Interpolation via weighted \(\ell_{1}\) minimization (Q905907) (← links)
- On the conditioning of random subdictionaries (Q930731) (← links)
- A remark on compressed sensing (Q941909) (← links)
- Sparse approximate solution of partial differential equations (Q972312) (← links)
- Combinatorial sublinear-time Fourier algorithms (Q972615) (← links)
- Sparse recovery by non-convex optimization - instance optimality (Q984656) (← links)
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples (Q1012549) (← links)
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit (Q1029209) (← links)
- Sparse solutions to underdetermined Kronecker product systems (Q1039753) (← links)
- A simple proof of the restricted isometry property for random matrices (Q1039884) (← links)
- Signal recovery under cumulative coherence (Q1624658) (← links)
- Sparse approximate solution of fitting surface to scattered points by MLASSO model (Q1656898) (← links)
- Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries (Q1691985) (← links)
- A hierarchical framework for recovery in compressive sensing (Q1693135) (← links)
- Deterministic construction of compressed sensing matrices based on semilattices (Q1698065) (← links)
- A Rice method proof of the null-space property over the Grassmannian (Q1700392) (← 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)
- Minimization of transformed \(L_1\) penalty: theory, difference of convex function algorithm, and robust application in compressed sensing (Q1749455) (← links)
- On the sparseness of 1-norm support vector machines (Q1784565) (← links)
- Strengthening hash families and compressive sensing (Q1932362) (← links)
- Sobolev duals for random frames and \(\varSigma \varDelta \) quantization of compressed sensing measurements (Q1946588) (← links)
- A short note on compressed sensing with partially known signal support (Q1957941) (← links)
- Analysis of the ratio of \(\ell_1\) and \(\ell_2\) norms in compressed sensing (Q1979938) (← links)
- Uniqueness of the minimal \(l_1\)-norm solution to the monotone linear complementarity problem (Q1993073) (← links)
- Sparse approximation of fitting surface by elastic net (Q1993576) (← links)
- Deterministic constructions of compressed sensing matrices based on optimal codebooks and codes (Q2008183) (← links)
- An efficient algorithm based on sparse optimization for the aircraft departure scheduling problem (Q2013610) (← links)
- Sparse harmonic transforms: a new class of sublinear-time algorithms for learning functions of many variables (Q2031058) (← links)
- Sparse harmonic transforms. II: Best \(s\)-term approximation guarantees for bounded orthonormal product bases in sublinear-time (Q2038427) (← links)
- Maximal spaces for approximation rates in \(\ell^1\)-regularization (Q2055984) (← links)
- Nonuniqueness of solutions of a class of \(\ell_0\)-minimization problems (Q2059197) (← links)
- A deterministic algorithm for constructing multiple rank-1 lattices of near-optimal size (Q2070286) (← links)
- Sparse Fourier transforms on rank-1 lattices for the rapid and low-memory approximation of functions of many variables (Q2073139) (← links)
- Robust sparse recovery via a novel convex model (Q2079105) (← links)
- GenMod: a generative modeling approach for spectral representation of PDEs with random inputs (Q2099749) (← links)
- On the robustness of noise-blind low-rank recovery from rank-one measurements (Q2168911) (← links)
- Real-valued group testing for quantitative molecular assays (Q2170137) (← links)
- Complex best \(r\)-term approximations almost always exist in finite dimensions (Q2175019) (← links)
- Sparse signal reconstruction via the approximations of \(\ell_0\) quasinorm (Q2190319) (← links)
- A smoothing method for sparse optimization over convex sets (Q2191281) (← links)
- Exact asymptotic orders of various randomized widths on Besov classes (Q2191831) (← links)
- Sparse recovery with integrality constraints (Q2192094) (← links)
- Block-sparse recovery of semidefinite systems and generalized null space conditions (Q2197151) (← links)
- Deterministic construction of compressed sensing matrices from constant dimension codes (Q2197399) (← links)
- Effective zero-norm minimization algorithms for noisy compressed sensing (Q2198627) (← links)
- Geological facies recovery based on weighted \(\ell_1\)-regularization (Q2198925) (← links)
- A class of null space conditions for sparse recovery via nonconvex, non-separable minimizations (Q2211058) (← links)
- Matrix recipes for hard thresholding methods (Q2251217) (← links)
- Compressed sensing with sparse binary matrices: instance optimal error guarantees in near-optimal time (Q2252137) (← links)
