We investigate the asymptotic behavior of Halpern-type iterations applied to quasi-nonexpansive operators arising in best approximation problems over the intersection of finitely many closed convex sets in $\mathbb{R}^n$. Assuming a local decrease condition for the underlying operator and standard requirements on the stepsizes $(α_k) \subset (0,1)$, we first prove strong convergence of the Halpern sequence $x_{k+1} = α_k x_0 + (1-α_k) T x_k$ to the best approximation point $x^\star$ in the intersection set, that is, the metric projection of $x_0$ onto that set. Under the additional assumption that the intersection satisfies a Hölder-type error bound with exponent $γ\in (0,1]$, we then derive explicit convergence rates for both feasibility and norm error: the distance from $x_k$ to the intersection set decays like $\mathcal O(α_k^{γ/(2-γ)})$, while the norm error $\|x_k - x^\star\|$ decays like $\mathcal O(α_k^{γ/(4-2γ)})$. These results apply to most projection-type operators used in convex feasibility problems (including MAP, CRM/SCCRM, Cimmino and 3PM/A3PM) and extend classical convergence analyses of the Halpern-type iterations by providing explicit, geometry-dependent rates governed by Hölder-type error bounds. Our numerical experiments show that Halpern-type iterations combined with most of these projection-type operators are quicker than Dykstra's algorithm to find the projection of a point in an intersection of ellipsoids or in an intersection of polyhedrons.
Quantitative asymptotic regularity and $T$-asymptotic regularity for the inexact generalized Halpern iteration
Simion Stoilow Institute of Mathematics of the Romanian Academy(罗马尼亚科学院西蒙·斯托伊洛数学研究所);Institute for Logic and Data Science, Bucharest(布加勒斯特逻辑与数据科学研究所);Faculty of Mathematics and Computer Science, University of Bucharest(布加勒斯特大学数学与计算机科学学院)
An Inexact Halpern Iteration with Application to Distributionally Robust Optimization
University of Maryland College Park(马里兰大学学院公园分校);Weierstrass Institute for Applied Analysis and Stochastics Berlin, Germany(柏林应用分析与随机学研究所);National University of Singapore(新加坡国立大学)
Provable Parameter-Free Fixed-Point Algorithms with Linear Convergence Rates
The University of North Carolina at Chapel Hill(北卡罗来纳大学教堂山分校);Posts and Telecommunications Institute of Technology(邮电技术学院);Fire and Rescue Academy(消防救援学院)
Sublinear Convergence Rates of Extragradient-Type Methods: A Survey on Classical and Recent Developments
G. M. Korpelevich于1976年提出的方法是近似解鞍点问题及其扩展问题如变分不等式和单调包含的一个著名的方法。多年来,在文献中已经提出并研究了EG的许多变体。最近,这些方法由于在机器学习和鲁棒优化中的新应用而受到欢迎。在这项工作中,我们调查的EG方法及其变种的最新发展,近似解的非线性方程和包含,重点是单调性和共亚单调设置。我们提供了一个统一的收敛性分析不同类别的算法,强调次线性最佳和最后的收敛速度收敛速度。我们还讨论了最近的加速EG的Halpern固定点迭代和Nesterov的加速技术的基础上的变种。我们的方法使用简单的参数和基本的数学工具,使证明尽可能基本,同时保持一般性,以涵盖广泛的问题。
Tikhonov regularization of monotone operator flows not only ensures strong convergence of the trajectories but also speeds up the vanishing of the residuals