Author:
Duruisseaux Valentin,Leok Melvin
Abstract
<abstract><p>A variational framework for accelerated optimization was recently introduced on normed vector spaces and Riemannian manifolds in <sup>[<xref ref-type="bibr" rid="b1">1</xref>]</sup> and <sup>[<xref ref-type="bibr" rid="b2">2</xref>]</sup>. It was observed that a careful combination of time-adaptivity and symplecticity in the numerical integration can result in a significant gain in computational efficiency. It is however well known that symplectic integrators lose their near-energy preservation properties when variable time-steps are used. The most common approach to circumvent this problem involves the Poincaré transformation on the Hamiltonian side, and was used in <sup>[<xref ref-type="bibr" rid="b3">3</xref>]</sup> to construct efficient explicit algorithms for symplectic accelerated optimization. However, the current formulations of Hamiltonian variational integrators do not make intrinsic sense on more general spaces such as Riemannian manifolds and Lie groups. In contrast, Lagrangian variational integrators are well-defined on manifolds, so we develop here a framework for time-adaptivity in Lagrangian variational integrators and use the resulting geometric integrators to solve optimization problems on vector spaces and Lie groups.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Subject
Applied Mathematics,Control and Optimization,Geometry and Topology,Mechanics of Materials
Reference69 articles.
1. A. Wibisono, A. Wilson, M. Jordan, A variational perspective on accelerated methods in optimization, Proc. Natl. Acad. Sci., 113 (2016), E7351–E7358. https://doi.org/10.1073/pnas.1614734113
2. V. Duruisseaux, M. Leok, A variational formulation of accelerated optimization on Riemannian manifolds, SIAM J. Math. Data Sci., 4 (2022), 649–674. https://doi.org/10.1137/21M1395648
3. V. Duruisseaux, J. Schmitt, M. Leok, Adaptive Hamiltonian variational integrators and applications to symplectic accelerated optimization, SIAM J. Sci. Comput., 43 (2021), A2949–A2980. https://doi.org/10.1137/20M1383835
4. Y. Nesterov, A method of solving a convex programming problem with convergence rate $\mathcal{O}(1/k^2)$. Sov. Math. Dokl., 27 (1983), 372–376.
5. Y. Nesterov, Introductory Lectures on Convex Optimization: A Basic Course, volume 87 of Applied Optimization, Kluwer Academic Publishers, Boston, MA, 2004.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献