Approximate Solutions of Common Fixed-Point Problems

Nonfiction, Science & Nature, Mathematics, Number Systems, Calculus
Cover of the book Approximate Solutions of Common Fixed-Point Problems by Alexander J. Zaslavski, Springer International Publishing
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: Alexander J. Zaslavski ISBN: 9783319332550
Publisher: Springer International Publishing Publication: June 30, 2016
Imprint: Springer Language: English
Author: Alexander J. Zaslavski
ISBN: 9783319332550
Publisher: Springer International Publishing
Publication: June 30, 2016
Imprint: Springer
Language: English

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 

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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 

More books from Springer International Publishing

Cover of the book The Organist in Victorian Literature by Alexander J. Zaslavski
Cover of the book Theory of Hematopoiesis Control by Alexander J. Zaslavski
Cover of the book Management of Competitiveness by Alexander J. Zaslavski
Cover of the book Physical-Layer Security for Cooperative Relay Networks by Alexander J. Zaslavski
Cover of the book Information Security and Cryptology – ICISC 2016 by Alexander J. Zaslavski
Cover of the book Smart-ECO Buildings towards 2020/2030 by Alexander J. Zaslavski
Cover of the book Dental Composite Materials for Direct Restorations by Alexander J. Zaslavski
Cover of the book Hard X-ray Photoelectron Spectroscopy (HAXPES) by Alexander J. Zaslavski
Cover of the book Models and Theories in Social Systems by Alexander J. Zaslavski
Cover of the book DataFlow Supercomputing Essentials by Alexander J. Zaslavski
Cover of the book Dessins d'Enfants on Riemann Surfaces by Alexander J. Zaslavski
Cover of the book Strongly Nonlinear Oscillators by Alexander J. Zaslavski
Cover of the book The Second Cold War by Alexander J. Zaslavski
Cover of the book Agency Theory and Sustainability in the Global Supply Chain by Alexander J. Zaslavski
Cover of the book My 10 Strategies for Integrative Coaching by Alexander J. Zaslavski
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy