Accelerated forward–backward algorithms for structured monotone inclusions

In this paper, we develop rapidly convergent forward–backward algorithms for computing zeroes of the sum of two maximally monotone operators. A modification of the classical forward–backward method is considered, by incorporating an inertial term (closed to the acceleration techniques introduced by...

Full description

Saved in:

Bibliographic Details
Published in:	Computational optimization and applications Vol. 88; no. 1; pp. 167 - 215
Main Authors:	Maingé, Paul-Emile, Weng-Law, André
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.05.2024 Springer Nature B.V Springer Verlag
Subjects:	Acceleration Algorithms Convergence Convex and Discrete Geometry Hilbert space Inclusions Management Science Mathematics Mathematics and Statistics Operations Research Operations Research/Decision Theory Optimization Preconditioning Saddle points Statistics Optimal gradient method Inertial-type algorithm Nesterov-type algorithm Restarting techniques Global rate of convergence 90C25 65F22 90C06 Fast first-order method global rate of convergence restarting techniques fast first-order method inertial-type algorithm optimal gradient method
ISSN:	0926-6003, 1573-2894
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!