arXiv (All)
open access
Non-Acceleration of the Heavy-Ball Method in 1D
Despite having an asymptotically optimal rate of convergence on convex quadratics, the acceleration of Polyak's heavy-ball method and a characterization of its dynamics within more general settings have remained long standing open problems. Recently, the work of Goujaud et al. [Math. Program. (2025)
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
- Sharp Initialization Guarantees for the Heavy-Ball Method#1234794
- Numerical experiments to "Robust fully discrete error bounds for the Kuznetsov equation in the inviscid limit"#976756
- Updated numerical experiments to "Robust fully discrete error bounds for the Kuznetsov equation in the inviscid limit"#976757
- Centered Weak Discrete Riemannian Gradients: A Unified Framework for Riemannian Optimization#1198988
- Polyak-Type Extragradient Methods for Monotone Root-Finding Problems#1062470
Record · ID 1390050
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