Affiliation:
1. Department of Mathematics, Technion–Israel Institute of Technology, Haifa 32000, Israel
Abstract
In his recent research, M. K. Tam (2018) considered a framework for the analysis of iterative algorithms which can be described in terms of a structured set-valued operator. At each point in the ambient space, the value of the operator can be expressed as a finite union of values of single-valued para-contracting operators. He showed that the associated fixed point iteration is locally convergent around strong fixed points. In the present paper we generalize the result of Tam and show the global convergence of his algorithm for an arbitrary starting point. An analogous result is also proven for the Krasnosel’ski–Mann iterations.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference19 articles.
1. A new split inverse problem and an application to least intensity feasible solutions;Gibali;Pure Appl. Funct. Anal.,2017
2. Goebel, K., and Kirk, W.A. (1990). Topics in Metric Fixed Point Theory, Cambridge University Press.
3. Goebel, K., and Reich, S. (1984). Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings, Marcel Dekker.
4. Khamsi, M.A., and Kozlowski, W.M. (2015). Fixed Point Theory in Modular Function Spaces, Springer.
5. A note on alternating projections in Hilbert space;Kopecka;J. Fixed Point Theory Appl.,2012
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Algorithms Based on Unions of Nonexpansive Maps;Springer Optimization and Its Applications;2023-12-22
2. Introduction;Springer Optimization and Its Applications;2023-12-22