5 citations · 5 across the 2 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2020
Complexity Guarantees for Polyak Steps with Momentum
Mathieu Barré, Adrien Taylor, Alexandre d'Aspremont
In smooth strongly convex optimization, knowledge of the strong convexity parameter is critical for obtaining simple methods with accelerated rates. In this work, we study a class…
math.OC2019
Polyak Steps for Adaptive Fast Gradient Method
Mathieu Barré, Alexandre d'Aspremont
Accelerated algorithms for minimizing smooth strongly convex functions usually require knowledge of the strong convexity parameter . In the case of an unknown , current adapt…