1 citations · 1 across the 3 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
math.OC2025
Adaptive Acceleration Without Strong Convexity Priors Or Restarts
Joao V. Cavalcanti, Laurent Lessard, Ashia C. Wilson
A longstanding challenge in optimization is achieving optimal performance when the strong convexity parameter m is unknown. In this paper, we propose NAG-free, a simple extension o…
math.OC2024★ 1 cited
Adaptive Backtracking Line Search
Joao V. Cavalcanti, Laurent Lessard, Ashia C. Wilson
Backtracking line search is foundational in numerical optimization. The basic idea is to adjust the step-size of an algorithm by a constant factor until some chosen criterion (e.g.…