No-regret dynamics in the Fenchel game: a unified framework for algorithmic convex optimization

We develop an algorithmic framework for solving convex optimization problems using no-regret game dynamics. By converting the problem of minimizing a convex function into an auxiliary problem of solving a min–max game in a sequential fashion, we can consider a range of strategies for each of the two...

Ausführliche Beschreibung