首页> 外文期刊>Journal of Global Optimization >Inexact Halpern-type proximal point algorithm
【24h】

Inexact Halpern-type proximal point algorithm

机译:不精确的Halpern型近点算法

获取原文
获取原文并翻译 | 示例
           

摘要

We present several strong convergence results for the modified, Halpern-type, proximal point algorithm x_(n+1) = α_nu + (1-α_n)J_(βn)x_n + e_n (n = 0, 1,...; u, x_0∈H given, and J_(βn) = (I +β_nA)~(-1), for a maximal monotone operator A) in a real Hilbert space, under new sets of conditions on α_n ∈(0, 1) and β_n∈(0, ∞). These conditions are weaker than those known to us and our results extend and improve some recent results such as those of H. K. Xu. We also show how to apply our results to approximate minimizers of convex functionals. In addition, we give convergence rate estimates for a sequence approximating the minimum value of such a functional.
机译:对于改进的Halpern型近点算法x_(n + 1)=α_nu+(1-α_n)J_(βn)x_n + e_n(n = 0,1,...; u ,x_0∈H给定,并且J_(βn)=(I +β_nA)〜(-1,对于最大单调算子A)在实Hilbert空间中,在α_n∈(0,1)和β_n∈(0,∞)。这些条件比我们已知的条件要弱,我们的结果扩展并改进了一些最近的结果,例如H.K. Xu的结果。我们还将展示如何将我们的结果应用于凸泛函的最小化极小值。此外,我们给出了近似于此类函数最小值的序列的收敛速率估计。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号