Linear Convergence Rates for Extrapolated Fixed Point Algorithms
Optimization and Control
2018-05-11 v1
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.
Cite
@article{arxiv.1805.03932,
title = {Linear Convergence Rates for Extrapolated Fixed Point Algorithms},
author = {Christian Bargetz and Victor I. Kolobov and Simeon Reich and Rafał Zalas},
journal= {arXiv preprint arXiv:1805.03932},
year = {2018}
}