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 Intelligent Information and Database Systems by Alexander J. Zaslavski
Cover of the book A Social Biography of Contemporary Innovative Poetry Communities by Alexander J. Zaslavski
Cover of the book Statics of Historic Masonry Constructions by Alexander J. Zaslavski
Cover of the book Blockchain – ICBC 2018 by Alexander J. Zaslavski
Cover of the book Computational Autism by Alexander J. Zaslavski
Cover of the book Linear Algebra for Computational Sciences and Engineering by Alexander J. Zaslavski
Cover of the book Creative Economies in Peripheral Regions by Alexander J. Zaslavski
Cover of the book Molecular Oncology: Underlying Mechanisms and Translational Advancements by Alexander J. Zaslavski
Cover of the book Set Theory by Alexander J. Zaslavski
Cover of the book Physics of Turbulent Jet Ignition by Alexander J. Zaslavski
Cover of the book Computer Security -- ESORICS 2015 by Alexander J. Zaslavski
Cover of the book The Economics and Policy of Concentrating Solar Power Generation by Alexander J. Zaslavski
Cover of the book Combined Stresses in Plants by Alexander J. Zaslavski
Cover of the book Lectures on Several Complex Variables by Alexander J. Zaslavski
Cover of the book Cross-Disciplinary Perspectives on Regional and Global Security 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