Skip to main content

Solutions of Fixed Point Problems with Computational Errors

  • Book
  • © 2024

Overview

  • Studies approximate solutions of star-shaped feasibility problems in the presence of perturbations
  • Analyzes approximate solutions of inconsistent convex feasibility problems in a Hilbert space under perturbations
  • Presents solutions of split common fixed point problems in a Hilbert space under perturbations

Part of the book series: Springer Optimization and Its Applications (SOIA, volume 210)

  • 524 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this book

eBook USD 129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book USD 169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (8 chapters)

Keywords

About this book

The book is devoted to the study of approximate solutions of fixed point problems in the presence of computational errors. It begins with a study of approximate solutions of star-shaped feasibility problems in the presence of perturbations. The goal is to show the convergence of algorithms, which are known as important tools for solving convex feasibility problems and common fixed point problems.The text also presents studies of algorithms based on unions of nonexpansive maps, inconsistent convex feasibility problems, and split common fixed point problems. A number of algorithms are considered for solving convex feasibility problems and common fixed point problems. The book will be of interest for researchers and engineers working in optimization, numerical analysis, and fixed point theory. It also can be useful in preparation courses for graduate students. The main feature of the book which appeals specifically to this audience is the study of the influence of computational errorsfor several important algorithms used for nonconvex feasibility problems.



Authors and Affiliations

  • Department of Mathematics, Technion, Israel Institute of Technology, Haifa, Israel

    Alexander J. Zaslavski

About the author

Alexander J. Zaslavski, Department of Mathematics, Technion – Israel Institute of Technology, Haifa, Israel.

Bibliographic Information

Publish with us