research
∙
07/24/2023
Open Problem: Polynomial linearly-convergent method for geodesically convex optimization?
Let f ℳ→ℝ be a Lipschitz and geodesically convex function defined on a d...
share
research
∙
06/05/2023
Curvature and complexity: Better lower bounds for geodesically convex optimization
We study the query complexity of geodesically convex (g-convex) optimiza...
research
∙
05/25/2023
Accelerated Methods for Riemannian Min-Max Optimization Ensuring Bounded Geometric Penalties
In this work, we study optimization problems of the form min_x max_y f(x...
research
∙
11/25/2021
