arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2601.14451math.OC
收藏

Hölder误差界下具有显式速率的Halpern迭代的新算子设计

New operator designs for Halpern iterations with explicit rates under Hölder error bounds

School of Applied Mathematics, FGV(应用数学学院,FGV);Department of Mathematics, UFSC(数学系,UFSC)

Pablo Barros, Vincent Guigues, Roger Behling, Luiz-Rafael Santos

AI总结:

针对有限个闭凸集交集上的最佳逼近问题,研究拟非扩张算子的Halpern型迭代的渐近行为,在Hölder误差界假设下导出可行性和范数误差的显式收敛速率。

摘要:

我们研究了应用于$\mathbb{R}^n$中有限个闭凸集交集上的最佳逼近问题中的拟非扩张算子的Halpern型迭代的渐近行为。假设底层算子满足局部下降条件且步长$(α_k) \subset (0,1)$满足标准要求,我们首先证明了Halpern序列$x_{k+1} = α_k x_0 + (1-α_k) T x_k$强收敛到交集内的最佳逼近点$x^\star$,即$x_0$到该集合的度量投影。在交集满足指数$γ\in (0,1]$的Hölder型误差界的额外假设下,我们进一步导出了可行性和范数误差的显式收敛速率:$x_k$到交集的距离以$\mathcal O(α_k^{γ/(2-γ)})$衰减,而范数误差$\|x_k - x^\star\|$以$\mathcal O(α_k^{γ/(4-2γ)})$衰减。这些结果适用于凸可行性问题中的大多数投影型算子(包括MAP、CRM/SCCRM、Cimmino和3PM/A3PM),并通过提供由Hölder型误差界决定的显式几何依赖速率,扩展了Halpern型迭代的经典收敛分析。我们的数值实验表明,结合大多数这些投影型算子的Halpern型迭代比Dykstra算法更快地找到点在椭球交集或多面体交集上的投影。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑