Riemannian Hamiltonian Methods for Min-Max Optimization on Manifolds

DOI10.1137/22M1492684zbMath1521.65051arXiv2204.11418OpenAlexW4385494102MaRDI QIDQ6116254

Pratik Jawanpuria, Bamdev Mishra, Junbin Gao, Pawan Kumar, Unnamed Author

Publication date: 11 August 2023

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2204.11418

zbMATH Keywords

saddle pointRiemannian optimizationconsensus optimizationgeodesic convex concaveHamiltonian gradient descentPolyak-Łojasiewicz

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Semidefinite programming (90C22) Convex programming (90C25) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Optimality conditions and duality in mathematical programming (90C46) Newton-type methods (49M15) Real-valued functions on manifolds (58C05)

Related Items (1)

Riemannian Hamiltonian Methods for Min-Max Optimization on Manifolds

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On general minimax theorems
• A modification of the Arrow-Hurwicz method for search of saddle points
• On linear convergence of iterative methods for the variational inequality problem
• Adaptive regularization with cubics on manifolds
• Coupling matrix manifolds assisted optimization for optimal transport problems
• A Riemannian symmetric rank-one trust-region method
• Trust-region methods on Riemannian manifolds
• Geometry-aware principal component analysis for symmetric positive definite matrices
• Riemannian Trust Regions with Finite-Difference Hessian Approximations are Globally Convergent
• Pymanopt: A Python Toolbox for Optimization on Manifolds using Automatic Differentiation
• Optimization Methods on Riemannian Manifolds and Their Application to Shape Space
• Manopt, a Matlab toolbox for optimization on manifolds
• Positive Definite Matrices
• On the Complexity of the Hybrid Proximal Extragradient Method for the Iterates and the Ergodic Mean
• Complexity of Variants of Tseng's Modified F-B Splitting and Korpelevich's Methods for Hemivariational Inequalities with Applications to Saddle-point and Convex Optimization Problems
• Monotone Operators and the Proximal Point Algorithm
• Robust Solutions to Least-Squares Problems with Uncertain Data
• ROPTLIB
• Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
• An Introduction to Optimization on Smooth Manifolds
• Global rates of convergence for nonconvex optimization on manifolds
• Manifold-valued image processing with SPD matrices
• Convergence Rate of $\mathcal{O}(1/k)$ for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems
• Riemannian Optimization and Its Applications
• Riemannian Stochastic Variance Reduced Gradient Algorithm with Retraction and Vector Transport
• Manifold Optimization Over the Set of Doubly Stochastic Matrices: A Second-Order Geometry
• Conic Geometric Optimization on the Manifold of Positive Definite Matrices
• Riemannian Hamiltonian Methods for Min-Max Optimization on Manifolds

This page was built for publication: Riemannian Hamiltonian Methods for Min-Max Optimization on Manifolds