An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems

From MaRDI portal
Publication:261850

DOI10.1007/S11075-015-0007-5zbMATH Open1338.47076arXiv1402.5291OpenAlexW1560858410MaRDI QIDQ261850FDOQ261850


Authors: Radu I. Boţ, Ernö Robert Csetnek Edit this on Wikidata


Publication date: 24 March 2016

Published in: Numerical Algorithms (Search for Journal in Brave)

Abstract: We introduce and investigate the convergence properties of an inertial forward-backward-forward splitting algorithm for approaching the set of zeros of the sum of a maximally monotone operator and a single-valued monotone and Lipschitzian operator. By making use of the product space approach, we expand it to the solving of inclusion problems involving mixtures of linearly composed and parallel-sum type monotone operators. We obtain in this way an inertial forward-backward-forward primal-dual splitting algorithm having as main characteristic the fact that in the iterative scheme all operators are accessed separately either via forward or via backward evaluations. We present also the variational case when one is interested in the solving of a primal-dual pair of convex optimization problems with intricate objective functions.


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




Recommendations




Cites Work


Cited In (only showing first 100 items - show all)

Uses Software





This page was built for publication: An inertial forward-backward-forward primal-dual splitting algorithm for solving monotone inclusion problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q261850)