首页> 外文期刊>Journal of industrial and management optimization >THE MODIFIED INERTIAL RELAXED CQ ALGORITHM FOR SOLVING THE SPLIT FEASIBILITY PROBLEMS
【24h】

THE MODIFIED INERTIAL RELAXED CQ ALGORITHM FOR SOLVING THE SPLIT FEASIBILITY PROBLEMS

机译:求解离散可行性问题的改进的惰性松弛CQ算法。

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

摘要

In this work, we propose a new version of inertial relaxed CQ algorithms for solving the split feasibility problems in the frameworks of Hilbert spaces. We then prove its strong convergence by using a viscosity approximation method under some weakened assumptions. To be more precisely, the computation on the norm of operators and the metric projections is relaxed. Finally, we provide numerical experiments to illustrate the convergence behavior and to show the effectiveness of the sequences constructed by the inertial technique.
机译:在这项工作中,我们提出了一种新版本的惯性松弛CQ算法,用于解决希尔伯特空间框架中的分裂可行性问题。然后,在一些弱化的假设下,通过使用粘度逼近方法证明了它的强收敛性。更准确地说,放宽了对算子范数和度量投影的计算。最后,我们提供了数值实验来说明收敛行为,并证明惯性技术构造序列的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号