arXiv Analytics

Sign in

arXiv:2205.12772 [math.NA]AbstractReferencesReviewsResources

A systematic approach to Lyapunov analyses of continuous-time models in convex optimization

Céline Moucer, Adrien Taylor, Francis Bach

Published 2022-05-25Version 1

First-order methods are often analyzed via their continuous-time models, where their worst-case convergence properties are usually approached via Lyapunov functions. In this work, we provide a systematic and principled approach to find and verify Lyapunov functions for classes of ordinary and stochastic differential equations. More precisely, we extend the performance estimation framework, originally proposed by Drori and Teboulle [10], to continuous-time models. We retrieve convergence results comparable to those of discrete methods using fewer assumptions and convexity inequalities, and provide new results for stochastic accelerated gradient flows.

Related articles: Most relevant | Search more
arXiv:2001.05530 [math.NA] (Published 2020-01-15)
Biorthogonal greedy algorithms in convex optimization
arXiv:2104.08669 [math.NA] (Published 2021-04-18)
Fifty Three Matrix Factorizations: A systematic approach
arXiv:2008.08223 [math.NA] (Published 2020-08-19)
Structure-preserving function approximation via convex optimization