Pages that link to "Item:Q2643860"
From MaRDI portal
The following pages link to On Lebesgue-type inequalities for greedy approximation (Q2643860):
Displayed 8 items.
- On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries (Q420768) (← links)
- Existence of the best \(n\)-term approximants for structured dictionaries (Q444118) (← links)
- Error estimates for orthogonal matching pursuit and random dictionaries (Q628676) (← links)
- Verifiable conditions of \(\ell_{1}\)-recovery for sparse signals with sign restrictions (Q633107) (← links)
- Explicit constructions of RIP matrices and related problems (Q635478) (← links)
- On performance of greedy algorithms (Q719355) (← links)
- On the size of incoherent systems (Q719361) (← links)
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit (Q1029209) (← links)