Mohlo by se vám také líbit

Více informací o knize Approximate Solutions of Common Fixed-Point Problems

• Parametry knihy
• Anotace
• Oblíbené z jiného soudku

Nákupem získáte 287 bodů

Anotace knihy

This book presents results on the§convergence behavior of algorithms which are known as vital tools for solving§convex feasibility problems and common fixed point problems. The main goal for§us in dealing with a known computational error is to find what approximate§solution can be obtained and how many iterates one needs to find it. According§to know results, these algorithms should converge to a solution. In this§exposition, these algorithms are studied, taking into account computational§errors which remain consistent in practice. In this case the convergence to a§solution does not take place. We show that our algorithms generate a good§approximate solution if computational errors are bounded from above by a small§positive constant.§§Beginning with an introduction, this monograph moves on§to study:§§· dynamic§string-averaging methods for common fixed point problems in a Hilbert space§§· dynamic§string methods for common fixed point problems in a metric space§· dynamic§string-averaging version of the proximal algorithm§· common fixed§point problems in metric spaces§§· common fixed§point problems in the spaces with distances of the Bregman type§§· a proximal§algorithm for finding a common zero of a family of maximal monotone operators§§· subgradient§projections algorithms for convex feasibility problems in Hilbert spaces§

Parametry knihy

Zařazení knihy Knihy v angličtině Mathematics & science Mathematics Calculus & mathematical analysis

• Plný název: Approximate Solutions of Common Fixed-Point Problems
• Autor: Alexander Zaslavski
• Jazyk: Angličtina
• Vazba: Pevná
• Počet stran: 454
• EAN: 9783319332536
• ISBN: 3319332538
• ID: 02972317
• Nakladatelství: Springer International Publishing AG
• Hmotnost: 8159 g
• Rozměry: 235 × 155 × 30 mm
• Datum vydání: 01. July 2016

Oblíbené z jiného soudku

---

---

---