Skip to main content
Log in

The generalized modular string averaging procedure and its applications to iterative methods for solving various nonlinear operator theory problems

  • Original Paper
  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

A modular string averaging procedure (MSA, for short) for a finite number of operators was first introduced by Reich and Zalas in 2016. The MSA concept provides a flexible algorithmic framework for solving various feasibility problems such as common fixed point and convex feasibility problems. In 2001 Bauschke and Combettes introduced the notion of coherence and applied it to proving weak and strong convergence of many iterative methods. In 2019 Barshad, Reich and Zalas proposed a stronger variant of coherence which provides a more convenient sufficient convergence condition for such methods.

In this paper we combine the ideas of both modular string averaging and coherence. Focusing on extending the above MSA procedure to an infinite sequence of operators with admissible controls, we establish strong coherence of its output operators. Various applications of these concepts are presented with respect to weak and strong convergence. They also provide important generalizations of known results, where the weak convergence of sequences of operators generated by the MSA procedure with intermittent controls was considered.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Data Availability

Not Applicable.

References

  1. Barshad, K., Reich, S., Zalas, R.: Strong coherence and its applications to iterative methods. J. Nonlinear Convex Anal. 20, 1507–1523 (2019)

    MathSciNet  MATH  Google Scholar 

  2. Barshad, K., Reich, S., Zaslavski, A.J.: Residuality properties of certain classes of convex functions on normed linear spaces. J. Convex Anal. 29, 795–806 (2022)

    MathSciNet  MATH  Google Scholar 

  3. Bauschke, H.H., Borwein, J.M.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38, 367–426 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  4. Bauschke, H.H., Combettes, P.L.: A weak-to-strong convergence principle for Fejér monotone methods in Hilbert spaces. Math. Oper. Res. 26, 248–264 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, New York (2017)

    Book  MATH  Google Scholar 

  6. Brooke, M., Censor, Y., Gibali, A.: Dynamic string-averaging CQ-methods for the split feasibility problem with percentage violation constraints arising in radiation therapy treatment planning. Int. Trans. Oper. Res. 30, 181–205 (2023)

    Article  MathSciNet  MATH  Google Scholar 

  7. Butnariu, D., Reich, S., Zaslavski, A.J.: Stable convergence theorems for infinite products and powers of nonexpansive mappings. Numer. Funct. Anal. Optim. 29, 304–323 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  8. Cegielski, A.: General method for solving the split common fixed point problem. J. Optim. Theory Appl. 165, 385–404 (2015)

    Article  MathSciNet  MATH  Google Scholar 

  9. Cegielski, A.: Iterative Methods for Fixed Point Problems in Hilbert Spaces. Springer, Berlin (2012)

    MATH  Google Scholar 

  10. Cegielski, A.: Landweber-type operator and its properties, A Panorama of Mathematics: Pure and Applied, Contemporary Mathematics. American Mathematical Society, Providence, RI. 658, 139–148 (2016)

    MATH  Google Scholar 

  11. Cegielski, A., Zalas, R.: Properties of a class of approximately shrinking operators and their applications. Fixed Point Theory. 15, 399–426 (2014)

    MathSciNet  MATH  Google Scholar 

  12. Reich, S., Zalas, R.: A modular string averaging procedure for solving the common fixed point problem for quasi-nonexpansive mappings in Hilbert spaces. Numer. Algorithms 72, 297–323 (2016)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Funding

Simeon Reich was partially supported by the Israel Science Foundation (Grant 820/17), the Fund for the Promotion of Research at the Technion and by the Technion General Research Fund.

Author information

Authors and Affiliations

Authors

Contributions

All authors contributed equally with respect to all aspects to this work.

Corresponding author

Correspondence to Aviv Gibali.

Ethics declarations

Ethical Approval

Not Applicable.

Conflict of interest

Not Applicable.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Barshad, K., Gibali, A. & Reich, S. The generalized modular string averaging procedure and its applications to iterative methods for solving various nonlinear operator theory problems. Numer Algor 94, 1797–1818 (2023). https://doi.org/10.1007/s11075-023-01555-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11075-023-01555-4

Keywords

Mathematics Subject Classification (2010)

Navigation