Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
Solutions of Fixed Point Problems with Computational Errors

Solutions of Fixed Point Problems with Computational Errors

Zaslavski, Alexander J.

Hardcover

Series: Springer Optimization and Its Applications, Book 210

General Mathematics

ISBN10: 3031508785
ISBN13: 9783031508783
Publisher: Springer
Published: Mar 20 2024
Pages: 386
Weight: 1.61
Height: 0.88 Width: 6.14 Depth: 9.21
Language: English

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.

Also from

Zaslavski, Alexander J.

View All

Also in

General Mathematics

View All