Abstract

We apply a string-averaging algorithm for common fixed point problems with a countable family of quasi-nonexpansive operators in an arbitrary normed space and show its convergence. Our results are an extension of the recent results by T. Y. Kong, H. Pajoohesh and G. T. Herman obtained for operators which are projections on convex closed sets in a finite-dimensional Euclidean space.

Author information

Contact details are reproduced from the original publication and may be historical.

Alexander J. Zaslavski

Department of Mathematics, Technion – Israel Institute of Technology, Haifa, Israel

ajzasl@technion.ac.il

Keywords

  • Convergence analysis
  • fixed point
  • inexact iterate
  • normed space
  • nonexpansive mapping

Mathematics Subject Classification

47H04, 47H09, 47H10

References

  1. C. Bargetz, M. Dymond, E. Medjic, S. Reich: On the existence of fixed points for typical nonexpansive mappings on spaces with positive curvature, Topol. Methods Nonlinear Anal. 57 (2021) 621–634.https://doi.org/10.12775/TMNA.2020.040Google Scholar
  2. D. Butnariu, R. Davidi, G. T. Herman, I. G. Kazantsev: Stable convergence behavior under summable perturbations of a class of projection methods for convex feasibility and optimization problems, IEEE J. Selected Topics Signal Proc. 1 (2007) 540–547.https://doi.org/10.1109/JSTSP.2007.910263Google Scholar
  3. D. Butnariu, E. Resmerita: Bregman distances, totally convex functions, and a method for solving operator equations in Banach spaces, Abstr. Appl. Anal. (2006), art.no. 84919, 39p.https://doi.org/10.1155/AAA/2006/84919Google Scholar
  4. Y. Censor, T. Elfving, G. T. Herman: Averaging strings of sequential iterations for convex feasibility problems, in: Inherently Parallel Algorithms in Feasibility and Optimization and their Applications, D. Butnariu et al. eds., Studies in Computational Mathematics Vol. 8, North-Holland, Amsterdam (2001) 101–113.https://doi.org/10.1016/S1570-579X(01)80009-4Google Scholar
  5. Y. Censor, R. Davidi, G. T. Herman: Perturbation resilience and superiorization of iterative algorithms, Inverse Problems 26/6 (2010), art.no. 065008, 12p.https://doi.org/10.1088/0266-5611/26/6/065008Google Scholar
  6. Y. Censor, Y. Nisenbaum: String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases, Fixed Point Theory Alg. Sci. Eng. 2021 (2021), art.no. 9, 21p.https://doi.org/10.1186/s13663-021-00694-4Google Scholar
  7. Y. Censor, M. Zaknoon: Algorithms and convergence results of projection methods for inconsistent feasibility problems: a review, Pure Appl. Funct. Anal. 3 (2018) 565–586.Google Scholar
  8. B. Djafari-Rouhani, K. R. Kazmi, S. Moradi, R. Ali, S. A. Khan: Solving the split equality hierarchical fixed point problem, Fixed Point Theory 23 (2022) 351–369.https://doi.org/10.24193/fpt-ro.2022.1.22Google Scholar
  9. A. Gibali: A new split inverse problem and an application to least intensity feasible solutions, Pure Appl. Funct. Anal. 2 (2017) 243–258.Google Scholar
  10. A. Gibali, S. Reich, R. Zalas: Outer approximation methods for solving variational inequalities in Hilbert space, Optimization 66 (2017) 417–437.https://doi.org/10.1080/02331934.2016.1271800Google Scholar
  11. K. Goebel, W. A. Kirk: Topics in Metric Fixed Point Theory, Cambridge University Press, Cambridge (1990).https://doi.org/10.1017/CBO9780511526152Google Scholar
  12. K. Goebel, S. Reich; Uniform Convexity, Hyperbolic Geometry, and Nonexpansive Mappings, Marcel Dekker, New York (1984).Google Scholar
  13. L. G. Gurin, B. T. Poljak, E. V. Raik: Projection methods for finding a common point of convex sets, Zhurn. Vycisl. Mat. i Mat. Fiz. 7 (1967) 1211–1228.https://doi.org/10.1016/0041-5553(67)90113-9Google Scholar
  14. C. Izuchukwu, O. T. Mewomo: Iterative algorithms for a finite family of equilibrium problems and fixed point problem in an Hadamard space, Fixed Point Theory 24 (2023) 241–264.https://doi.org/10.24193/fpt-ro.2023.1.13Google Scholar
  15. E. Karapinar, Z. D. Mitrovic, A. Ozturk, S. Radenovic: On a theorem of Ciric in b-metric spaces, Rend. Circ. Mat. Palermo 70 (2021) 217–225.https://doi.org/10.1007/s12215-020-00491-9Google Scholar
  16. M. A. Khamsi, W. M. Kozlowski: Fixed Point Theory in Modular Function Spaces, Birkhäuser/Springer, Cham (2015).https://doi.org/10.1007/978-3-319-14051-3Google Scholar
  17. W. A. Kirk: Contraction mappings and extensions, in: Handbook of Metric Fixed Point Theory, W. A. Kirk et al. (eds.), Kluwer, Dordrecht (2001) 1–34.https://doi.org/10.1007/978-94-017-1748-9_1Google Scholar
  18. V. I. Kolobov, S. Reich, R. Zalas: Finitely convergent deterministic and stochastic iterative methods for solving convex feasibility problems, Math. Programming 194 (2022) 1163–1183.https://doi.org/10.1007/s10107-021-01628-zGoogle Scholar
  19. T. Y. Kong, H. Pajoohesh, G. T. Herman: String-averaging algorithms for convex feasibility with infinitely many sets, Inverse Problems 35 (2019), art.no. 045011, 37p.https://doi.org/10.1088/1361-6420/ab066cGoogle Scholar
  20. E. Kopecka, S. Reich: A note on alternating projections in Hilbert space, J. Fixed Point Theory Appl. 12 (2012) 41–47.https://doi.org/10.1007/s11784-013-0097-4Google Scholar
  21. R. Kubota, W. Takahashi, Y. Takeuchi: Extensions of Browder’s demiclosedness principle and Reich’s lemma and their applications, Pure Appl. Funct. Anal. 1 (2016) 63–84.Google Scholar
  22. F. Lenzen, F. Becker, J. Lellmann, S. Petra, Ch. Schnörr: A class of quasi-variational inequalities for adaptive image denoising and decomposition, Comput. Optim. Appl. 54 (2013) 371–398.https://doi.org/10.1007/s10589-012-9456-0Google Scholar
  23. S. Reich, T. M. Tuyen: Projection algorithms for solving the split feasibility problem with multiple output sets, J. Optim. Theory Appl. 190 (2021) 861–878.https://doi.org/10.1007/s10957-021-01910-2Google Scholar
  24. S. Reich, A. J. Zaslavski: Genericity in Nonlinear Analysis, Developments in Mathematics Vol. 34, Springer, New York (2014).https://doi.org/10.1007/978-1-4614-9533-8Google Scholar
  25. W. Takahashi: The split common fixed point problem and the shrinking projection method for new nonlinear mappings in two Banach spaces, Pure Appl. Funct. Anal. 2 (2017) 685–699.Google Scholar
  26. W. Takahashi: A general iterative method for split common fixed point problems in Hilbert spaces and applications, Pure Appl. Funct. Anal. 3 (2018) 349–369.Google Scholar
  27. A. J. Zaslavski: Approximate Solutions of Common Fixed Point Problems, Springer Optimization and its Applications, Springer, Cham (2016).https://doi.org/10.1007/978-3-319-33255-0Google Scholar
  28. A. J. Zaslavski: Algorithms for Solving Common Fixed Point Problems, Springer Optimization and its Applications, Springer, Cham (2018).https://doi.org/10.1007/978-3-319-77437-4Google Scholar
  29. A. J. Zaslavski: Solving feasibility problems with infinitely many sets, Axioms 12/3 (2023), art.no. 273, 12p.https://doi.org/10.3390/axioms12030273Google Scholar

Suggested citation

A. J. Zaslavski. “Convergence of the String-Averaging Algorithm for Common Fixed Point Problems with a Countable Family of Operators.” Journal of Convex Analysis 32 (2025), No. 4, 1065–1082. https://doi.org/10.68381/jca32056

Download BibTeXPublished by Heldermann Verlag.

Published by Heldermann Verlag, 2025. Rights now held by Banach Press.