Pages that link to "Item:Q2329295"
From MaRDI portal
The following pages link to A unified way of analyzing some greedy algorithms (Q2329295):
Displaying 8 items.
- Greedy versus recursive greedy: uncorrelated heuristics for the binary paint shop problem (Q1983103) (← links)
- Duality gap estimates for a class of greedy optimization algorithms in Banach spaces (Q2117632) (← links)
- Biorthogonal greedy algorithms in convex optimization (Q2155817) (← links)
- Sparse approximation of individual functions (Q2209292) (← links)
- Rescaled pure greedy algorithm for convex optimization (Q2424223) (← links)
- Efficiency of the weak Rescaled Pure Greedy Algorithm (Q5010120) (← links)
- Unified error estimate for weak biorthogonal Greedy algorithms (Q5097875) (← links)
- Entropy-based convergence rates of greedy algorithms (Q6551364) (← links)