Contact
How to shop
Delivery
Shopping guide
Approximate Solutions of Common Fixed-Point Problems
English
222 b
Delivery to Austria
Up to 30 days for returns
Customers also purchased
/
Paperback
38.00
€
/
Paperback
21.49
€
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§
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Hardback
96.49
€
/
Paperback
25.69
€
/
Paperback
17.99
€
/
Paperback
13.69
€
/
Paperback
10.69
€
Hi! I'm Libroamiko, your book advisor.
How can I help you?