5 citations · 11 across the 6 of their papers we have counts for
Showing 2020 · math.OCShow all
2 papers · 2 filters
math.OC2020★ 2 cited
Principled Analyses and Design of First-Order Methods with Inexact Proximal Operators
Mathieu Barré, Adrien Taylor, Francis Bach
Proximal operations are among the most common primitives appearing in both practical and theoretical (or high-level) optimization methods. This basic operation typically consists i…
math.OC2020★ 4 cited
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…