A self-adaptive relaxed primal-dual iterative algorithm for solving the split feasibility and the fixed point problem

被引：2
|
作者：
Wang, Yuanheng [1 ,2 ]
Huang, Bin [2 ]
Jiang, Bingnan [2 ]
机构：
[1] Zhejiang Guangsha Vocat & Tech Univ Construct, Coll Humanities, Jinhua 322100, Peoples R China
[2] Zhejiang Normal Univ, Sch Math Sci, Jinhua 321004, Peoples R China
来源：
COMMUNICATIONS IN NONLINEAR SCIENCE AND NUMERICAL SIMULATION | 2024年 / 129卷
基金：
中国国家自然科学基金;
关键词：
Primal-dual iterative algorithm; Demicontractive mapping; Fixed point problem; Split feasibility problem; PROJECTION;
D O I：
10.1016/j.cnsns.2023.107699
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
In this paper, we introduce a new numerical simulation iterative algorithm to solve the split feasibility problem and the fixed point problem with demicontractive mappings. Ou r algorithm mainly involves primal-dual iterative, relaxed projection, inertial technique and self-adaptive step size. Under reasonable conditions, the strong convergence of ou r algorithm is established. Moreover, we provide some numerical simulation examples to demonstrate the efficiency of ou r iterative algorithm compared to existing algorithms in the other literature.
引用
收藏
页数：16
相关论文
共 50 条
12345