Cover Image
Read Now

Approximate Solutions of Common Fixed-Point Problems

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 m...

Full description

Bibliographic Details
Main Author: Zaslavski, Alexander J.
Format: eBook
Language:English
Published: Cham Springer International Publishing 2016, 2016
Edition:1st ed. 2016
Series:Springer Optimization and Its Applications
Subjects:
Numerical Analysis
Calculus Of Variations And Optimization
Operator Theory
Mathematical Optimization
Calculus Of Variations
Online Access:
Collection: Springer eBooks 2005- - Collection details see MPG.ReNa
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.

Similar Items