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

Celý popis

Uložené v:
Podrobná bibliografia
Hlavný autor: Zaslavski, Alexander J. (Autor)
Médium: Elektronický zdroj E-kniha
Jazyk:English
Vydavateľské údaje: Cham : Springer International Publishing, 2018.
Vydanie:1st ed. 2018.
Edícia:Springer Optimization and Its Applications, 132
Predmet:
Calculus of variations.
Operator theory.
Numerical analysis.
ISBN:9783319774374
ISSN:1931-6828 ;
On-line prístup: Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Obsah:
  • 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.

Podobné jednotky