Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
134 tokens/sec
GPT-4o
9 tokens/sec
Gemini 2.5 Pro Pro
47 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Optimal error bounds for nonexpansive fixed-point iterations in normed spaces (2108.10969v3)

Published 24 Aug 2021 in math.OC

Abstract: This paper investigates optimal error bounds and convergence rates for general Mann iterations for computing fixed-points of non-expansive maps. We look for iterations that achieve the smallest fixed-point residual after $n$ steps, by minimizing a worst-case bound $|xn-Txn|\le R_n$ derived from a nested family of optimal transport problems. We prove that this bound is tight so that minimizing $R_n$ yields optimal iterations. Inspired from numerical results we identify iterations that attain the rate $R_n=O(1/n)$, which we also show to be the best possible. In particular, we prove that the classical Halpern iteration achieves this optimal rate for several alternative stepsizes, and we determine analytically the optimal stepsizes that attain the smallest worst-case residuals at every step $n$, with a tight bound $R_n\approx\frac{4}{n+4}$. We also determine the optimal Halpern stepsizes for affine non-expansive maps, for which we get exactly $R_n=\frac{1}{n+1}$. Finally, we show that the best rate for the classical Krasnosel'ski\u{\i}-Mann iteration is $\Omega(1/\sqrt{n})$, and present numerical evidence suggesting that even extended variants cannot reach a faster rate.

Summary

We haven't generated a summary for this paper yet.