Pages that link to "Item:Q420768"
From MaRDI portal
The following pages link to On the optimality of the orthogonal greedy algorithm for \(\mu\)-coherent dictionaries (Q420768):
Displaying 5 items.
- Sparse approximation is provably hard under coherent dictionaries (Q340554) (← links)
- Orthogonal matching pursuit under the restricted isometry property (Q515909) (← links)
- Explicit constructions of RIP matrices and related problems (Q635478) (← links)
- SPARSE APPROXIMATION AND RECOVERY BY GREEDY ALGORITHMS IN BANACH SPACES (Q2879425) (← links)
- On Optimal Estimate of the Block Orthogonal Greedy Algorithm for g-Frames (Q3385358) (← links)
