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

一种用于由切割算子诱导的公共不动点问题的广义块迭代投影方法

A Generalized Block-Iterative Projection Method for the Common Fixed Point Problem Induced by Cutters

Yair Censor, Daniel Reem, Maroun Zaknoon

AI总结:

本文将 BIP 方法推广到连续切割算子族的公共不动点求解,支持度量投影、次梯度投影与自适应扰动,并证明全局收敛及扰动 Fejér 单调性。

摘要:

Aharoni 和 Censor 的块迭代投影(BIP)方法〔《用于并行计算凸可行性问题解的块迭代投影方法》,Linear Algebra and its Applications 120,(1989),165--175〕是一种迭代过程,用于渐近地寻找一族闭凸子集的非空交集中的一点。它在使用算子“块”的算法机制中采用到各个子集上的正交投影,并在由其构造具体算法方面具有很大灵活性。我们将这一算法方案推广,以处理一族连续切割算子,并寻找它们的公共不动点。由于连续切割算子族包含若干重要的具体算子,我们的广义方案在保证全局收敛并保留 BIP 灵活性的同时,尤其能够处理在应用中非常重要的度量(正交)投影算子和连续次梯度投影。我们还允许纳入某种自适应扰动,并在此过程中推导出一个受扰动的 Fejér 单调性引理,该引理具有独立的研究价值。

英文摘要:

The block-iterative projections (BIP) method of Aharoni and Censor [Block-iterative projection methods for parallel computation of solutions to convex feasibility problems, Linear Algebra and its Applications 120, (1989), 165--175] is an iterative process for finding asymptotically a point in the nonempty intersection of a family of closed convex subsets. It employs orthogonal projections onto the individual subsets in an algorithmic regime that uses "blocks" of operators and has great flexibility in constructing specific algorithms from it. We extend this algorithmic scheme to handle a family of continuous cutter operators and to find a common fixed point of them. Since the family of continuous cutters includes several important specific operators, our generalized scheme, which ensures global convergence and retains the flexibility of BIP, can handle, in particular, metric (orthogonal) projectors and continuous subgradient projections, which are very important in applications. We also allow a certain kind of adaptive perturbations to be included, and along the way we derive a perturbed Fejér monotonicity lemma which is of independent interest.

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

↑