18 citations · 19 across the 4 of their papers we have counts for
4 papers
A Fast Optimistic Method for Monotone Variational Inequalities
Michael Sedlmayer, Dang-Khoa Nguyen, Radu Ioan Bot
We study monotone variational inequalities that can arise as optimality conditions for constrained convex optimisation or convex-concave minimax problems and propose a novel algori…
An accelerated minimax algorithm for convex-concave saddle point problems with nonsmooth coupling function
Radu Ioan Bot, Ernö Robert Csetnek, Michael Sedlmayer
In this work we aim to solve a convex-concave saddle point problem, where the convex-concave coupling function is smooth in one variable and nonsmooth in the other and not assumed…
Two steps at a time -- taking GAN training in stride with Tseng's method
Axel Böhm, Michael Sedlmayer, Ernö Robert Csetnek +1
Motivated by the training of Generative Adversarial Networks (GANs), we study methods for solving minimax problems with additional nonsmooth regularizers. We do so by employing \em…
A Relaxed Inertial Forward-Backward-Forward Algorithm for Solving Monotone Inclusions with Application to GANs
Radu Ioan Bot, Michael Sedlmayer, Phan Tu Vuong
We introduce a relaxed inertial forward-backward-forward (RIFBF) splitting algorithm for approaching the set of zeros of the sum of a maximally monotone operator and a single-value…