Kontakt
Wie einkaufen
Versand
Kaufberater
Approximate Solutions of Common Fixed-Point Problems
Englisch
263 b
Bis zu 30 Tage Rückgaberecht
Kunden kauften auch
/
Broschur
38.00
€
/
Broschur
26.09
€
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§
Informationen zum Buch
Englisch
Verschenken Sie dieses Buch noch heute
Es ist ganz einfach
1 Legen Sie das Buch in Ihren Warenkorb und wählen Sie den Versand als Geschenk 2 Wir schicken Ihnen umgehend einen Gutschein 3 Das Buch wird an die Adresse des beschenkten Empfängers geliefertDas könnte Sie auch interessieren
/
Hardcover
116.19
€
/
Broschur
32.09
€
/
Broschur
21.49
€
/
Broschur
16.99
€
/
Broschur
10.69
€
/
Hardcover
160.89
€
Hallo! Ich bin Libroamiko, dein Buchberater.
Wie kann ich dir helfen?