scientific article; zbMATH DE number 2079345
From MaRDI portal
Publication:4471300
Recommendations
- On Greedy Algorithms with bounded cumulative coherence
- Sparse approximation is provably hard under coherent dictionaries
- On greedy algorithms for dictionaries with bounded cumulative coherence
- Greedy algorithms and M-term approximation with regard to redundant dictionaries
- Compressed sensing with coherent and redundant dictionaries
- scientific article; zbMATH DE number 4057841
- Approximation preserving reductions
- On approximation scheme preserving reducibility and its applications
- Complexity of approximation of functions of few variables in high dimensions
Cited in
(27)- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Approximating sampled sinusoids and multiband signals using multiband modulated DPSS dictionaries
- Complex best \(r\)-term approximations almost always exist in finite dimensions
- A complete characterization of optimal dictionaries for least squares representation
- A note on the hardness of sparse approximation
- On Lebesgue-type inequalities for greedy approximation
- Sparse approximation and recovery by greedy algorithms in Banach spaces
- Book Review: A mathematical introduction to compressive sensing
- On optimal estimate of the block orthogonal greedy algorithm for g-frames
- Sparse approximation is provably hard under coherent dictionaries
- On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries
- Approximate submodularity and its applications: subset selection, sparse approximation and dictionary selection
- Optimal dictionary for least squares representation
- Dictionary descent in optimization
- Compressed sensing with coherent and redundant dictionaries
- Approximation accuracy, gradient methods, and error bound for structured convex optimization
- Sparse approximation over the cube
- Error estimates for orthogonal matching pursuit and random dictionaries
- Explicit constructions of RIP matrices and related problems
- A note on the complexity of \(L _{p }\) minimization
- Brief introduction in greedy approximation
- On performance of greedy algorithms
- On the size of incoherent systems
- Sparse sampling recovery by greedy algorithms
- On some deterministic dictionaries supporting sparsity
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4471300)
