首页> 外文会议>The 8th international conference on optimization: Techniques and Applications >Inertial Relaxed CQ Algorithm for Solving Split Feasibility Problem
【24h】

Inertial Relaxed CQ Algorithm for Solving Split Feasibility Problem

机译:惯性松弛CQ算法求解分裂可行性问题

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

摘要

In this paper, we combine inertial technique with relaxed- CQ algorithm and relaxed- KM- CQ algorithm respectively to get two new accelerate iterative methods which are called inertial relaxed-CQ algorithm and inertial relaxed-KM-CQ algorithm for solving split feasibility problem. We also show their asymptotical convergence under some mild conditions. Finally, numerical tests show that the algorithms are prompting.
机译:本文将惯性技术分别与relaxed-CQ算法和relaxed-KM-CQ算法相结合,得到了两种新的加速迭代方法,分别称为惯性relaxed-CQ算法和惯性relaxed-KM-CQ算法来解决分裂可行性问题。我们还显示了它们在某些温和条件下的渐近收敛性。最后,数值测试表明该算法是可行的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号