3 problems

Consider high-order extragradient methods for convex-concave minimax optimization, with complexity measured by the number of high-order oracle calls needed to find an $\epsilon$-so…

Let $f$ be a geodesically $ell$-smooth and geodesically strongly-convex-strongly-concave function on the geodesic metric spaces under consideration, and let Riemannian corrected ex…

Let $\current[\stepalt]$ and $\current[\step]$ denote the two stepsizes in the generalized optimistic gradient recursion, and let $\current$ and $\last[\svecfield]$ denote the curr…