Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems
From MaRDI portal
Publication:2157903
DOI10.1016/j.orl.2022.04.001OpenAlexW3121912418MaRDI QIDQ2157903
Publication date: 22 July 2022
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2101.09916
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The subgradient extragradient method for solving variational inequalities in Hilbert space
- The interior proximal extragradient method for solving equilibrium problems
- A modification of the Arrow-Hurwicz method for search of saddle points
- On the convergence properties of non-Euclidean extragradient methods for variational inequalities with generalized monotone operators
- Augmented $\ell_1$ and Nuclear-Norm Models with a Globally Linearly Convergent Algorithm
- Free-Steering Relaxation Methods for Problems with Strictly Convex Costs and Linear Constraints
- Proximal Minimization Methods with Generalized Bregman Functions
- Relatively Smooth Convex Optimization by First-Order Methods, and Applications
- Re-examination of Bregman functions and new properties of their divergences
- Prox-Method with Rate of Convergence O(1/t) for Variational Inequalities with Lipschitz Continuous Monotone Operators and Smooth Convex-Concave Saddle Point Problems
- A Modified Forward-Backward Splitting Method for Maximal Monotone Mappings
- A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity
- Convergence Rate of $\mathcal{O}(1/k)$ for Optimistic Gradient and Extragradient Methods in Smooth Convex-Concave Saddle Point Problems
- Projected Reflected Gradient Methods for Monotone Variational Inequalities
- A Descent Lemma Beyond Lipschitz Gradient Continuity: First-Order Methods Revisited and Applications
- Training GANs with centripetal acceleration
- Convex analysis and monotone operator theory in Hilbert spaces
This page was built for publication: Extragradient and extrapolation methods with generalized Bregman distances for saddle point problems
