Bregman Lagrangian

From Wikipedia, the free encyclopedia

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[edit]

  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.