A Relaxed Inertial Forward-Backward-Forward Algorithm for Solving Monotone Inclusions with Application to GANs

Author(s)

Radu Ioan Bot, Michael Sedlmayer, Tu Vuong Phan

Abstract

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-valued monotone and Lipschitz continuous operator. This work aims to extend Tseng's forward-backward-forward method by both using inertial effects as well as relaxation parameters. We formulate first a second order dynamical system which approaches the solution set of the monotone inclusion problem to be solved and provide an asymptotic analysis for its trajectories. We provide for RIFBF, which follows by explicit time discretization, a convergence analysis in the general monotone case as well as when applied to the solving of pseudo-monotone variational inequalities. We illustrate the proposed method by applications to a bilinear saddle point problem, in the context of which we also emphasize the interplay between the inertial and the relaxation parameters, and to the training of Generative Adversarial Networks (GANs).

Organisation(s)

Department of Mathematics, Research Network Data Science

DOI

https://doi.org/https://arxiv.org/abs/2003.07886

Publication date

2020

Austrian Fields of Science 2012

101016 Optimisation

Portal url

https://ucris.univie.ac.at/portal/en/publications/a-relaxed-inertial-forwardbackwardforward-algorithm-for-solving-monotone-inclusions-with-application-to-gans(7a2ff2c7-0194-489c-a01b-7186c1e756b7).html