Introduction

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

Chapter Chapter 1 in Solutions of Fixed Point Problems with Computational Errors, 2024, pp 1-24 from Springer

Abstract: Abstract In this book we study approximate solutions of star-shaped feasibility problems in the presence of perturbations. A star-shaped problem is to find a point which belongs to the intersection of a given finite family of closed subsets of a Hilbert space which are star-shaped at a common point. Our goal is to show the convergence of algorithms, which are known as important tools for solving feasibility problems and common fixed point problems. Some of these algorithms are discussed is this chapter. We also discuss algorithms based on unions of nonexpansive maps, inconsistent convex feasibility problems and split common fixed point problems.

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_1

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

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

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 ().