Dynamic String-Averaging Methods in Hilbert Spaces

Alexander J. Zaslavski
Additional contact information
Alexander J. Zaslavski: Technion, Israel Institute of Technology

Chapter Chapter 4 in Solutions of Fixed Point Problems with Computational Errors, 2024, pp 137-212 from Springer

Abstract: Abstract In this chapter we study the convergence of dynamic string-averaging methods for solving star-shaped feasibility problems in a Hilbert space. Our main goal is to obtain an approximate solution of the problem in the presence of computational errors. We show that the dynamic string-averaging methods generates a good approximate solution, if the sequence of computational errors is bounded from above by a constant. Moreover, for a known computational error, we find out what an approximate solution can be obtained and how many iterates one needs for this.

Date: 2024
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-3-031-50879-0_4

Ordering information: This item can be ordered from
http://www.springer.com/9783031508790

DOI: 10.1007/978-3-031-50879-0_4

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().