Pages that link to "Item:Q3547716"
From MaRDI portal
The following pages link to Greed is Good: Algorithmic Results for Sparse Approximation (Q3547716):
Displaying 50 items.
- Orthogonal one step greedy procedure for heteroscedastic linear models (Q254223) (← links)
- Nomonotone spectral gradient method for sparse recovery (Q256063) (← links)
- Locally sparse reconstruction using the \(\ell^{1,\infty}\)-norm (Q256102) (← links)
- Simultaneous image fusion and demosaicing via compressive sensing (Q269715) (← links)
- Nonnegative adaptive Lasso for ultra-high dimensional regression models and a two-stage method applied in financial modeling (Q274029) (← links)
- Smooth sparse coding via marginal regression for learning sparse representations (Q309913) (← links)
- Compressed sensing and dynamic mode decomposition (Q317178) (← links)
- A class of deterministic sensing matrices and their application in harmonic detection (Q318592) (← links)
- Deterministic convolutional compressed sensing matrices (Q324274) (← links)
- Matrix sparsification and the sparse null space problem (Q329287) (← links)
- Fast and scalable Lasso via stochastic Frank-Wolfe methods with a convergence guarantee (Q331671) (← links)
- Point source super-resolution via non-convex \(L_1\) based methods (Q333212) (← links)
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods (Q340007) (← links)
- Sparse approximation is provably hard under coherent dictionaries (Q340554) (← links)
- 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory (Q341409) (← links)
- Robust classifier using distance-based representation with square weights (Q344071) (← links)
- Sparse microwave imaging: principles and applications (Q362310) (← links)
- Recovery of high-dimensional sparse signals via \(\ell_1\)-minimization (Q364458) (← links)
- On greedy algorithms for dictionaries with bounded cumulative coherence (Q368218) (← links)
- Statistical significance in high-dimensional linear models (Q373525) (← links)
- Asymptotic properties of Lasso+mLS and Lasso+Ridge in sparse high-dimensional linear regression (Q389956) (← links)
- Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization (Q391843) (← links)
- ``Grouping strategies and thresholding for high dimensional linear models'': discussion (Q394554) (← links)
- Restricted isometries for partial random circulant matrices (Q412402) (← links)
- Optimization over finite frame varieties and structured dictionary design (Q413650) (← links)
- Sparse conjugate directions pursuit with application to fixed-size kernel models (Q413891) (← links)
- On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries (Q420768) (← links)
- Two are better than one: fundamental parameters of frame coherence (Q427070) (← links)
- Compressive sensing of analog signals using discrete prolate spheroidal sequences (Q448495) (← links)
- Iterative hard thresholding methods for \(l_0\) regularized convex cone programming (Q463721) (← links)
- Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms (Q466526) (← links)
- Robustness of orthogonal matching pursuit under restricted isometry property (Q476748) (← links)
- Analysis of orthogonal multi-matching pursuit under restricted isometry property (Q477291) (← links)
- Compressed sensing with coherent tight frames via \(l_q\)-minimization for \(0 < q \leq 1\) (Q479885) (← links)
- Learning circulant sensing kernels (Q479905) (← links)
- Sparse dual frames and dual Gabor functions of minimal time and frequency supports (Q485118) (← links)
- Equivalence and strong equivalence between the sparsest and least \(\ell _1\)-norm nonnegative solutions of linear systems and their applications (Q489110) (← links)
- Computing sparse representation in a highly coherent dictionary based on difference of \(L_1\) and \(L_2\) (Q493283) (← links)
- Lattices from equiangular tight frames (Q501257) (← links)
- Disjoint sparsity for signal separation and applications to hybrid inverse problems in medical imaging (Q504383) (← links)
- Accelerating a Gibbs sampler for variable selection on genomics data with summarization and variable pre-selection combining an array DBMS and R (Q506436) (← links)
- A modified greedy analysis pursuit algorithm for the cosparse analysis model (Q513670) (← links)
- Orthogonal matching pursuit under the restricted isometry property (Q515909) (← links)
- Sparse signal recovery using a new class of random matrices (Q520894) (← links)
- Compressed sensing for quaternionic signals (Q523053) (← links)
- Compressed sensing with coherent and redundant dictionaries (Q544040) (← links)
- Frame permutation quantization (Q544043) (← links)
- Source localization using a sparse representation framework to achieve superresolution (Q600881) (← links)
- Approximation accuracy, gradient methods, and error bound for structured convex optimization (Q607498) (← links)
- Error estimates for orthogonal matching pursuit and random dictionaries (Q628676) (← links)
