Approximate Solutions of Common Fixed-Point Problems
Author:   Alexander J. Zaslavski
Publisher:   Springer International Publishing AG
Edition:   1st ed. 2016
Volume:   112
ISBN:  

9783319332536


Pages:   454
Publication Date:   08 July 2016
Format:   Hardback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $290.37 Quantity:  
Add to Cart

Share |

Approximate Solutions of Common Fixed-Point Problems


Add your own review!

Overview

Full Product Details

Author:   Alexander J. Zaslavski
Publisher:   Springer International Publishing AG
Imprint:   Springer International Publishing AG
Edition:   1st ed. 2016
Volume:   112
Dimensions:   Width: 15.50cm , Height: 2.50cm , Length: 23.50cm
Weight:   8.159kg
ISBN:  

9783319332536


ISBN 10:   3319332538
Pages:   454
Publication Date:   08 July 2016
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Hardback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

1.Introduction.- 2. Dynamic string-averaging methods in Hilbert spaces.- 3. Iterative methods in metric spaces.- 4. Dynamic string-averaging methods in normed spaces.- 5. Dynamic string-maximum methods in metric spaces.- 6. Spaces with generalized distances.- 7. Abstract version of CARP algorithm.- 8. Proximal point algorithm.- 9. Dynamic string-averaging proximal point algorithm.- 10. Convex feasibility problems.- 11. Iterative subgradient projection algorithm.- 12. Dynamic string-averaging subgradient projection algorithm.– References.– Index. 

Reviews

The title says it all: this book is a compilation of studies of algorithms for computing approximate solutions to the problem of finding common fixed points of several operators in the presence of computational errors. ... The perspective on the analysis of algorithms with fixed computational error is new, and the book is a tutorial on how to execute this analysis for dynamical string-averaging methods, which includes many classical algorithms as special cases. (Russell Luke, Mathematical Reviews, May, 2017) The present book on fixed point topics focusses on the study of the convergence of iterative algorithms which are mainly intended to approximate solutions of common fixed point problems and of convex feasibility problems in the presence of computational errors. ... The book, including mainly original theoretical contributions of the author to the convergence analysis of the considered iterative algorithms, is addressed to researchers interested in fixed point theory and/or convex feasibility problems. (Vasile Berinde, zbMATH 1357.49007, 2017)


The present book on fixed point topics focusses on the study of the convergence of iterative algorithms which are mainly intended to approximate solutions of common fixed point problems and of convex feasibility problems in the presence of computational errors. ... The book, including mainly original theoretical contributions of the author to the convergence analysis of the considered iterative algorithms, is addressed to researchers interested in fixed point theory and/or convex feasibility problems. (Vasile Berinde, zbMATH 1357.49007, 2017)


Author Information

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now