An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function
From MaRDI portal
Publication:6146370
DOI10.1007/s10589-022-00378-8arXiv2104.06206OpenAlexW3153184737MaRDI QIDQ6146370
Michael Sedlmayer, Ernö Robert Csetnek, Radu Ioan Boţ
Publication date: 10 January 2024
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.06206
Related Items
In memoriam: Asen L. Dontchev (1948--2021) ⋮ A second order primal-dual dynamical system for a convex-concave bilinear saddle point problem
Cites Work
- A first-order primal-dual algorithm for convex problems with applications to imaging
- Applications of a Splitting Algorithm to Decomposition in Convex Programming and Variational Inequalities
- 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 Primal-Dual Algorithm with Line Search for General Convex-Concave Saddle Point Problems
- Two Steps at a Time---Taking GAN Training in Stride with Tseng's Method
- A Forward-Backward Splitting Method for Monotone Inclusions Without Cocoercivity
- Weak convergence of the sequence of successive approximations for nonexpansive mappings
- Convex analysis and monotone operator theory in Hilbert spaces
- Alternating Proximal-Gradient Steps for (Stochastic) Nonconvex-Concave Minimax Problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
