EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Strong convergence, perturbation resilience and superiorization of Generalized Modular String-Averaging with infinitely many input operators

Kay Barshad, Yair Censor

Numerical Algorithms · 14.04.2026

DOI: 10.1007/s11075-026-02363-2 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Numerical Algorithms, online erschienen am 14.04.2026. Verfasst von Kay Barshad und 1 weiteren Autor:innen. Die Arbeit wurde bisher 1-mal zitiert (Crossref) und nennt 49 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: University of Haifa.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

We study the strong convergence and bounded perturbation resilience of iterative algorithms based on the Generalized Modular String-Averaging (GMSA) procedure for infinite sequences of input operators under a general admissible control. These methods address a variety of feasibility-seeking problems in real Hilbert spaces, including the common fixed point problem and the convex feasibility problem. In addition to the general case, involving certain strongly quasi-nonexpansive input operators, we consider a specific subclass of their corresponding relaxed firmly nonexpansive operators. This subclass proves useful for establishing bounded perturbation resilience. We further demonstrate the applicability of our strong convergence results, within the GMSA framework, to the Superiorization Methodology and to Dynamic String-Averaging, analyzing the behavior of a superiorized version of our main algorithm. The novelty and significance of this work is that it not only includes a variety of earlier algorithms as special cases but, more importantly, it allows the use of modular options of string-averaging that give rise to new, hitherto unavailable, algorithmic schemes with emphasis on infinitely many input operators. The strong convergence guarantees and the applications for superiorization and dynamic string-averaging are also important facets.

Förderung

  • University of Haifa

Zitieren

APA

Barshad, K., & Censor, Y. (2026). Strong convergence, perturbation resilience and superiorization of Generalized Modular String-Averaging with infinitely many input operators. Numerical Algorithms. https://doi.org/10.1007/s11075-026-02363-2

Vancouver

Barshad K, Censor Y. Strong convergence, perturbation resilience and superiorization of Generalized Modular String-Averaging with infinitely many input operators. Numerical Algorithms. 2026. doi:10.1007/s11075-026-02363-2

BibTeX
@article{Barshad2026,
  author = {Barshad, Kay and Censor, Yair},
  title = {Strong convergence, perturbation resilience and superiorization of Generalized Modular String-Averaging with infinitely many input operators},
  journal = {Numerical Algorithms},
  year = {2026},
  doi = {10.1007/s11075-026-02363-2}
}
Kostenlos starten →