arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2111.00344math.NAcs.NAmath.OC
收藏

一类约束块迭代法的收敛性和半收敛性

Convergence and Semi-convergence of a class of constrained block iterative methods

Mahdi Mirzapour, Andrzej Cegielski, Tommy Elfving

摘要:

本文分析了投影非定常块迭代法(P-BIM)的收敛性和半收敛性,该方法的目的是寻找大型线性方程组的约束解,这些方程组通常都是有噪声和病态的.将$k$次迭代的误差分解为噪声误差和迭代误差,并分别考虑每种误差。对迭代误差进行了处理,得到了一个更一般的算法,该算法也适用于求解希尔伯特空间中的分裂可行性问题。P-BIM的结果是一个特例。算法步骤包括投影到闭凸集上。当这些集合是多面体的,并且是有限维的,它被证明是线性收敛的算法。我们进一步推导出P-BIM的噪声误差的上界。基于这个界限,我们提出了一种新的策略来选择松弛因子,这有助于加快重建过程,提高所获得的图像的质量。松弛因子可以取决于噪声。所建议的策略的性能所示的例子从投影图像重建领域。

英文摘要:

In this paper, we analyze the convergence %semi-convergence properties of projected non-stationary block iterative methods (P-BIM) aiming to find a constrained solution to large linear, usually both noisy and ill-conditioned, systems of equations. We split the error of the $k$th iterate into noise error and iteration error, and consider each error separately. The iteration error is treated for a more general algorithm, also suited for solving split feasibility problems in Hilbert space. The results for P-BIM come out as a special case. The algorithmic step involves projecting onto closed convex sets. When these sets are polyhedral, and of finite dimension, it is shown that the algorithm converges linearly. We further derive an upper bound for the noise error of P-BIM. Based on this bound, we suggest a new strategy for choosing relaxation parameters, which assist in speeding up the reconstruction process and improving the quality of obtained images. The relaxation parameters may depend on the noise. The performance of the suggested strategy is shown by examples taken from the field of image reconstruction from projections.

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

↑