Algorithms for Solving Common Fixed Point Problems
This book details approximate solutions to common fixed point problems and convex feasibility problems in the presence of perturbations. Convex feasibility problems search for a common point of a finite collection of subsets in a Hilbert space; common fixed point problems pursue a common fixed point...
Κύριος συγγραφέας: | |
---|---|
Συγγραφή απο Οργανισμό/Αρχή: | |
Μορφή: | Ηλεκτρονική πηγή Ηλ. βιβλίο |
Γλώσσα: | English |
Έκδοση: |
Cham :
Springer International Publishing : Imprint: Springer,
2018.
|
Έκδοση: | 1st ed. 2018. |
Σειρά: | Springer Optimization and Its Applications,
132 |
Θέματα: | |
Διαθέσιμο Online: | Full Text via HEAL-Link |
Πίνακας περιεχομένων:
- 1. Introduction
- 2. Iterative methods in metric spaces
- 3. Dynamic string-averaging methods in normed spaces
- 4. Dynamic string-maximum methods in metric spaces
- 5. Abstract version of CARP algorithm
- 6. Proximal point algorithm
- 7. Dynamic string-averaging proximal point algorithm
- 8. Convex feasibility problems.