The following pages link to On performance of greedy algorithms (Q719355):
Displaying 13 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)
- Sparse regression and support recovery with \(\mathbb{L}_2\)-boosting algorithms (Q466526) (← links)
- Lebesgue-type inequalities in greedy approximation (Q826481) (← links)
- Approximately normalized iterative hard thresholding for nonlinear compressive sensing (Q1792868) (← links)
- Compression of Wannier functions into Gaussian-type orbitals (Q2102492) (← links)
- Sparse approximation of individual functions (Q2209292) (← 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)
- (Q4631277) (← links)
- Convergence Almost Everywhere of Orthorecursive Expansions in Systems of Translates and Dilates (Q5223383) (← links)
- Quasi-linear Compressed Sensing (Q5250350) (← links)
- Almost optimality of orthogonal super greedy algorithms for incoherent dictionaries (Q5348776) (← links)
