The following pages link to Elad Hazan (Q304245):
Displaying 3 items.
- On the complexity of approximating \(k\)-set packing (Q2506163) (← links)
- How Hard Is It to Approximate the Best Nash Equilibrium? (Q2999855) (← links)
- A Linearly Convergent Variant of the Conditional Gradient Algorithm under Strong Convexity, with Applications to Online and Stochastic Optimization (Q5741072) (← links)
