An inertial forward-backward algorithm for monotone inclusions

From MaRDI portal
Publication:890044

DOI10.1007/S10851-014-0523-2zbMATH Open1327.47063arXiv1403.3522OpenAlexW2095980290MaRDI QIDQ890044FDOQ890044


Authors: Dirk A. Lorenz, Thomas Pock Edit this on Wikidata


Publication date: 9 November 2015

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Abstract: In this paper, we propose an inertial forward backward splitting algorithm to compute a zero of the sum of two monotone operators, with one of the two operators being co-coercive. The algorithm is inspired by the accelerated gradient method of Nesterov, but can be applied to a much larger class of problems including convex-concave saddle point problems and general monotone inclusions. We prove convergence of the algorithm in a Hilbert space setting and show that several recently proposed first-order methods can be obtained as special cases of the general algorithm. Numerical results show that the proposed algorithm converges faster than existing methods, while keeping the computational cost of each iteration basically unchanged.


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




Recommendations




Cites Work


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





This page was built for publication: An inertial forward-backward algorithm for monotone inclusions

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