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

不精确预解包含问题的解及其在非线性分析和optimization中的应用

Solutions to inexact resolvent inclusion problems with applications to nonlinear analysis and optimization

Daniel Reem, Simeon Reich

摘要:

非线性分析和优化中的许多问题,如变分不等式和凸函数的极小化,都可以归结为求集值算子的零点(即根)。因此,为了实现这一任务,已经设计了许多算法。许多这些算法是不精确的,因为它们允许在迭代过程中出现扰动,因此它们使人们能够更好地处理噪声和计算错误,以及优越化。多年来,一些基本的问题仍然是开放的关于许多这些已知的不精确的算法计划在各种有限和无限维的设置,即是否存在序列满足这些不精确的计划时,错误出现。我们对这个问题提供了肯定的答案。我们的结果还表明,讨论这些不精确格式的收敛性的各种定理有一个真正的优点超出了确切的情况。作为副产品,我们解决了标准和强隐式不精确预解包含问题,引入了一类有前途的功能(完全勒让德函数),建立连续依赖(稳定)性质的解决方案的不精确预解包含问题和连续性质的原预解,并推广了强单调性的概念。

英文摘要:

Many problems in nonlinear analysis and optimization, among them variational inequalities and minimization of convex functions, can be reduced to finding zeros (namely, roots) of set-valued operators. Hence numerous algorithms have been devised in order to achieve this task. A lot of these algorithms are inexact in the sense that they allow perturbations to appear during the iterative process, and hence they enable one to better deal with noise and computational errors, as well as superiorization. For many years a certain fundamental question has remained open regarding many of these known inexact algorithmic schemes in various finite and infinite dimensional settings, namely whether there exist sequences satisfying these inexact schemes when errors appear. We provide a positive answer to this question. Our results also show that various theorems discussing the convergence of these inexact schemes have a genuine merit beyond the exact case. As a by-product we solve the standard and the strongly implicit inexact resolvent inclusion problems, introduce a promising class of functions (fully Legendre functions), establish continuous dependence (stability) properties of the solution of the inexact resolvent inclusion problem and continuity properties of the protoresolvent, and generalize the notion of strong monotonicity.

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

↑