Approximate Solutions of a Fixed-Point Problem with an Algorithm Based on Unions of Nonexpansive Mappings

被引:0
|
作者
Zaslavski, Alexander J. [1 ]
机构
[1] Technion Israel Inst Technol, Dept Math, IL-3200003 Haifa, Israel
关键词
convergence analysis; fixed point; nonexpansive mapping; set-valued mapping;
D O I
10.3390/math11061534
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
In this paper, we study a fixed-point problem with a set-valued mapping by using an algorithm based on unions of nonexpansive mappings. We show that an approximate solution is reached after a finite number of iterations in the presence of computational errors. This result is an extension of the results known in the literature.
引用
收藏
页数:7
相关论文
共 50 条