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) This article is an orphan, as no other articles link to it. Please introduce links to this page from related articles; try the Find link tool for suggestions. (October 2016) The topic of this article may not meet Wikipedia's general notability guideline. Please help to demonstrate the notability of the topic by citing reliable secondary sources that are independent of the topic and provide significant coverage of it beyond a mere trivial mention. If notability cannot be shown, the article is likely to be merged, redirected, or deleted.Find sources: "Bregman Lagrangian" – news · newspapers · books · scholar · JSTOR (January 2017) (Learn how and when to remove this message) This article relies largely or entirely on a single source. Relevant discussion may be found on the talk page. Please help improve this article by introducing citations to additional sources.Find sources: "Bregman Lagrangian" – news · newspapers · books · scholar · JSTOR (March 2024) (Learn how and when to remove this message)

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

  1. ^ 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