首页> 美国卫生研究院文献>Springer Open Choice >New construction and proof techniques of projection algorithm for countable maximal monotone mappings and weakly relatively non-expansive mappings in a Banach space
【2h】

New construction and proof techniques of projection algorithm for countable maximal monotone mappings and weakly relatively non-expansive mappings in a Banach space

机译:Banach空间中可数最大单调映射和弱相对非扩展映射的投影算法的新构造和证明技术

代理获取
本网站仅为用户提供外文OA文献查询和代理获取服务,本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文,但由于OA文献来源多样且变更频繁,仍可能出现获取不到、文献不完整或与标题不符等情况,如果获取不到我们将提供退款服务。请知悉。

摘要

In a real uniformly convex and uniformly smooth Banach space, some new monotone projection iterative algorithms for countable maximal monotone mappings and countable weakly relatively non-expansive mappings are presented. Under mild assumptions, some strong convergence theorems are obtained. Compared to corresponding previous work, a new projection set involves projection instead of generalized projection, which needs calculating a Lyapunov functional. This may reduce the computational labor theoretically. Meanwhile, a new technique for finding the limit of the iterative sequence is employed by examining the relationship between the monotone projection sets and their projections. To check the effectiveness of the new iterative algorithms, a specific iterative formula for a special example is proved and its computational experiment is conducted by codes of Visual Basic Six. Finally, the application of the new algorithms to a minimization problem is exemplified.
机译:在一个实均匀凸且均匀光滑的Banach空间中,提出了一些新的用于可数最大单调映射和可数弱相对非扩张映射的单调投影迭代算法。在温和的假设下,获得了一些强收敛定理。与相应的先前工作相比,新的投影集涉及投影而不是广义投影,这需要计算Lyapunov函数。从理论上讲,这可以减少计算量。同时,通过检查单调投影集与其投影之间的关系,采用了一种寻找迭代序列极限的新技术。为了检验新迭代算法的有效性,针对一个特殊的例子证明了一个特定的迭代公式,并使用Visual Basic 6的代码进行了计算实验。最后,举例说明了新算法在最小化问题上的应用。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
代理获取

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号