Pages that link to "Item:Q2643860"
From MaRDI portal
The following pages link to On Lebesgue-type inequalities for greedy approximation (Q2643860):
Displaying 20 items.
- Sparse approximation is provably hard under coherent dictionaries (Q340554) (← links)
- 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)
- Theoretical guarantees for graph sparse coding (Q778037) (← links)
- Lebesgue-type inequalities in greedy approximation (Q826481) (← links)
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit (Q1029209) (← links)
- Lebesgue inequalities for the greedy algorithm in general bases (Q1675683) (← links)
- Super greedy type algorithms (Q1928073) (← links)
- A note on the hardness of sparse approximation (Q2444766) (← links)
- Frames and non linear approximations in Hilbert spaces (Q2630993) (← links)
- Sparse approximation and recovery by greedy algorithms in Banach spaces (Q2879425) (← links)
- Quasi-greedy bases and Lebesgue-type inequalities (Q3164871) (← links)
- On Optimal Estimate of the Block Orthogonal Greedy Algorithm for g-Frames (Q3385358) (← links)
- (Q4631277) (← links)
- (Q5469262) (← links)
