Linear Convergence Rates for Extrapolated Fixed Point Algorithms
From MaRDI portal
Publication:6301419
DOI10.1080/02331934.2018.1512109arXiv1805.03932WikidataQ129336639 ScholiaQ129336639MaRDI QIDQ6301419FDOQ6301419
Authors: Christian Bargetz, V. I. Kolobov, Simeon Reich, Rafał Zalas 
Publication date: 10 May 2018
Abstract: We establish linear convergence rates for a certain class of extrapolated fixed point algorithms which are based on dynamic string-averaging methods in a real Hilbert space. This applies, in particular, to the extrapolated simultaneous and cyclic cutter methods. Our analysis covers the cases of both metric and subgradient projections.
Iterative numerical methods for linear systems (65F10) Contraction-type mappings, nonexpansive mappings, (A)-proper mappings, etc. (47H09) Iterative procedures involving nonlinear operators (47J25)
This page was built for publication: Linear Convergence Rates for Extrapolated Fixed Point Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6301419)
