The following pages link to Vector greedy algorithms (Q652444):
Displaying 18 items.
- On greedy algorithms for dictionaries with bounded cumulative coherence (Q368218) (← links)
- Simultaneous greedy approximation in Banach spaces (Q558004) (← links)
- Approximation on anisotropic Besov classes with mixed norms by standard information (Q558005) (← links)
- Realizability of greedy algorithms (Q643840) (← links)
- Adaptive martingale approximations (Q734947) (← links)
- Column subset selection via sparse approximation of SVD (Q764372) (← links)
- Variable selection in high-dimensional sparse multiresponse linear regression models (Q779699) (← links)
- On a greedy algorithm in the space \(L_p[0,1]\) (Q1033990) (← links)
- Super greedy type algorithms (Q1928073) (← links)
- Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms (Q1929788) (← links)
- Weak greedy algorithms (Q1968628) (← links)
- Example of divergence of a greedy algorithm with respect to an asymmetric dictionary (Q2037674) (← links)
- Projection greedy algorithm (Q2049278) (← links)
- On rank awareness, thresholding, and MUSIC for joint sparse recovery (Q2278470) (← links)
- Simultaneous approximation by greedy algorithms (Q2498388) (← links)
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion (Q4603591) (← links)
- On the recursive greedy algorithm (Q5395513) (← links)
- A counter-example to the general convergence of partially greedy algorithms (Q5944137) (← links)
