Bregman Lagrangian
Jump to navigation
Jump to search
![]() | This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)
|
The Bregman-Lagrangian framework permits a systematic understanding of the matching rates associated with higher-order gradient methods in discrete and continuous time.[1]
References
- ^ Wibisono, Andre; Wilson, Ashia C.; Jordan, Michael I. (March 14, 2016). "A variational perspective on accelerated methods in optimization". Proceedings of the National Academy of Sciences. 113 (47). arXiv:1603.04245v1. Bibcode:2016PNAS..113E7351W. doi:10.1073/pnas.1614734113. PMID 27834219.
Categories:
- Orphaned articles from October 2016
- All orphaned articles
- Articles with topics of unclear notability from January 2017
- All articles with topics of unclear notability
- Articles needing additional references from March 2024
- All articles needing additional references
- Articles with multiple maintenance issues
- Optimization algorithms and methods
- All stub articles
- Physics stubs