Fast convergence of generalized forward-backward algorithms for structured monotone inclusions

From MaRDI portal
Publication:5091986

zbMATH Open1496.90058arXiv2107.10107MaRDI QIDQ5091986FDOQ5091986


Authors: Paul-Emile Maingé Edit this on Wikidata


Publication date: 27 July 2022

Abstract: In this paper, we develop rapidly convergent forward-backward algorithms for computing zeroes of the sum of finitely many maximally monotone operators. A modification of the classical forward-backward method for two general operators is first considered, by incorporating an inertial term (closed to the acceleration techniques introduced by Nesterov), a constant relaxation factor and a correction term. In a Hilbert space setting, we prove the weak convergence to equilibria of the iterates (xn), with worst-case rates of o(n2) in terms of both the discrete velocity and the fixed point residual, instead of the classical rates of calO(n1) established so far for related algorithms. Our procedure is then adapted to more general monotone inclusions and a fast primal-dual algorithm is proposed for solving convex-concave saddle point problems.


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




Recommendations




Cites Work


Cited In (13)





This page was built for publication: Fast convergence of generalized forward-backward algorithms for structured monotone inclusions

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