Pages that link to "Item:Q745854"
From MaRDI portal
The following pages link to Fast subspace approximation via greedy least-squares (Q745854):
Displaying 7 items.
- On greedy algorithm approximating Kolmogorov widths in Banach spaces (Q482002) (← links)
- Efficient subspace approximation algorithms (Q664540) (← links)
- Speeding up the GVW algorithm via a substituting method (Q1730310) (← links)
- On recovery guarantees for one-bit compressed sensing on manifolds (Q2022611) (← links)
- Testing proximity to subspaces: approximate \(\ell_\infty\) minimization in constant time (Q2309471) (← links)
- A dimension reduction scheme for the computation of optimal unions of subspaces (Q2890685) (← links)
- An accelerated subspace iteration method (Q4293156) (← links)