arXiv (All)
open access
Convergence analysis of dynamical systems for optimization by an improved Lyapunov framework
We study the convergence analysis of continuous-time dynamical systems associated with optimization methods for strongly convex functions. Recent works have proposed systematic constructions of Lyapunov functions for such analysis, while also revealing limitations of the Lyapunov analysis. Aujol--Do
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Lyapunov Functions and $R$-Linear Convergence for Quadratic Barzilai-Borwein Dynamics#1000056
- PL conditions do not guarantee convergence of gradient descent-ascent dynamics#974329
- A Duality Reformulation of the Companion-Matrix Lyapunov Problem#1160722
- Large-time behavior in an attraction--repulsion chemotaxis system#1012455
- Input convex neural networks as surrogates in mathematical optimisation#441801
Record · ID 1131497
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive