Sion’s Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithm
DOI10.1137/22m1505475zbMath1526.49022arXiv2202.06950OpenAlexW4387742522MaRDI QIDQ6060148
Pei-yuan Zhang, Unnamed Author, Suvrit Sra
Publication date: 3 November 2023
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2202.06950
minimaxgame theorygeodesic convexityRiemannian optimizationextragradientgeodesically complete Riemannian manifoldsnonconvex-nonconcave problems
Minimax problems in mathematical programming (90C47) Nonconvex programming, global optimization (90C26) Optimality conditions and duality in mathematical programming (90C46) Optimization of shapes other than minimal surfaces (49Q10) Optimality conditions for minimax problems (49K35) Optimality conditions for problems in abstract spaces (49K27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On Helly's theorem in geodesic spaces
- Equilibrium problems in Hadamard manifolds
- An approach to spectral problems on Riemannian manifolds
- On general minimax theorems
- Minimax problems on Grassmann manifolds. Sums of eigenvalues
- Elementary proof for Sion's minimax theorem
- On linear convergence of iterative methods for the variational inequality problem
- The proximal point algorithm in metric spaces
- Simple algorithms for optimization on Riemannian manifolds with constraints
- Stochastic saddle-point optimization for the Wasserstein barycenter problem
- Golden ratio algorithms for variational inequalities
- Accelerated methods for saddle-point problem
- Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems
- Generalizations of the Nash equilibrium theorem in the KKM theory
- Geometry-aware principal component analysis for symmetric positive definite matrices
- Nash-type equilibria on Riemannian manifolds: a variational approach
- Convex analysis and optimization in Hadamard spaces
- Positive Definite Matrices
- Non-Negative Principal Component Analysis: Message Passing Algorithms and Sharp Asymptotics
- Some additive decompositions of semisimple matrices
- Robust Solutions to Least-Squares Problems with Uncertain Data
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- Convergence Rate of $\mathcal{O}(1/k)$ for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems
- The Complexity of Computing a Nash Equilibrium
- Riemannian manifolds are KKM spaces
- Riemannian Stochastic Variance Reduced Gradient Algorithm with Retraction and Vector Transport
- Conic Geometric Optimization on the Manifold of Positive Definite Matrices
- Equilibrium points in n -person games
- The complexity of constrained min-max optimization
- Greedy adversarial equilibrium: an efficient alternative to nonconvex-nonconcave min-max optimization
This page was built for publication: Sion’s Minimax Theorem in Geodesic Metric Spaces and a Riemannian Extragradient Algorithm
