<p><span>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,
Solutions of Fixed Point Problems with Computational Errors (Springer Optimization and Its Applications, 210)
β Scribed by Alexander J. Zaslavski
- Publisher
- Springer
- Year
- 2024
- Tongue
- English
- Leaves
- 395
- Edition
- 2024
- Category
- Library
No coin nor oath required. For personal study only.
β¦ Synopsis
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.
π SIMILAR VOLUMES
<span>This book is devoted to a detailed study of the subgradient projection method and its variants for convex optimization problems over the solution sets of common fixed point problems and convex feasibility problems. These optimization problems are investigated to determine good solutions obtain
<span>This book is devoted to a detailed study of the subgradient projection method and its variants for convex optimization problems over the solution sets of common fixed point problems and convex feasibility problems. These optimization problems are investigated to determine good solutions obtain
<span>This text focuses on simple and easy-to-use design strategies for solving complex engineering problems that arise in several fields of engineering design, namely non-convex optimization problems. <br>The main optimization tool used in this book to tackle the problem of nonconvexity is the Heur
Individuals and enterprises are looking for optimal solutions for the problems they face. Most problems can be expressed in mathematical terms, and so the methods of optimization render a significant aid. This book details the latest achievements in optimization. It offers comprehensive coverage on
<P>This work introduces new developments in the construction, analysis, and implementation of parallel computing algorithms. This book presents 23 self-contained chapters, including surveys, written by distinguished researchers in the field of parallel computing. Each chapter is devoted to some aspe