Introduction

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

Chapter Chapter 1 in Algorithms for Solving Common Fixed Point Problems, 2018, pp 1-18 from Springer

Abstract: Abstract In this book we study approximate solutions of common fixed point and convex feasibility problems in the presence of perturbations. A convex feasibility problem is to find a point which belongs to the intersection of a given finite family of convex subsets of a Hilbert space. This problem is a special case of a common fixed point problem which is to find a common fixed point of a finite family of nonlinear mappings in a Hilbert space. Our goal is to show the convergence of algorithms, which are known as important tools for solving convex feasibility and common fixed point problems. Some of these algorithms are discussed is this chapter.

Date: 2018
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-319-77437-4_1

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

DOI: 10.1007/978-3-319-77437-4_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 ().