The following pages link to Relaxation in greedy approximation (Q944229):
Displaying 14 items.
- Schwarz iterative methods: infinite space splittings (Q530579) (← links)
- Greedy approximation of characteristic functions (Q605979) (← links)
- Weak convergence of greedy algorithms in Banach spaces (Q734939) (← links)
- Relaxed NewtonSLRA for approximate GCD (Q831989) (← links)
- On the approximate weak Chebyshev greedy algorithm in uniformly smooth Banach spaces (Q905956) (← links)
- On \(n\)-term approximation with positive coefficients (Q942052) (← links)
- Sparse approximation of individual functions (Q2209292) (← links)
- A unified way of analyzing some greedy algorithms (Q2329295) (← links)
- Greedy approximation in convex optimization (Q2343051) (← links)
- Approximation by neural networks and learning theory (Q2489152) (← links)
- Penalized empirical relaxed greedy algorithm for fixed design Gaussian regression (Q2818315) (← links)
- On the convergence of greedy algorithms for initial segments of the Haar basis (Q3559982) (← links)
- (Q5392497) (← links)
- Comparison of Purely Greedy and Orthogonal Greedy Algorithm (Q6494789) (← links)
