Alexander J. Zaslavski Algorithms for solving common fixed point problems / 9783319774367

Варианты приобретения

Цена: 16769.00р.
Кол-во:
о цене
Наличие: Отсутствует. Возможна поставка под заказ.

При оформлении заказа до: 2025-07-28
Ориентировочная дата поставки: Август-начало Сентября
При условии наличия книги у поставщика.

Добавить в корзину

в Мои желания

Автор: Alexander J. Zaslavski
Название: Algorithms for solving common fixed point problems /
Перевод названия: Александр Заславский: Алгоритмы решения общих задач с неподвижной точкой
ISBN: 9783319774367
Издательство: Springer
Классификация:

Управление НИОКР

Основы высшей математики и математический анализ

Функциональный анализ и преобразования

Вариационное исчисление

ISBN-10: 3319774360
Обложка/Формат: Hardcover
Страницы: 316
Вес: 0.63 кг.
Дата издания: 14.05.2018
Серия: Springer optimization and its applications
Язык: English
Издание: 1st ed. 2018
Иллюстрации: Viii, 280 p.
Размер: 234 x 156 x 19
Читательская аудитория: Tertiary education (us: college)
Ссылка на Издательство: Link
Рейтинг:
Поставляется из: Германии
Описание: This book details approximate solutions to common fixed point problems and convex feasibility problems in the presence of perturbations. Convex feasibility problems search for a common point of a finite collection of subsets in a Hilbert space; common fixed point problems pursue a common fixed point of a finite collection of self-mappings in a Hilbert space. A variety of algorithms are considered in this book for solving both types of problems, the study of which has fueled a rapidly growing area of research. This monograph is timely and highlights the numerous applications to engineering, computed tomography, and radiation therapy planning. Totaling eight chapters, this book begins with an introduction to foundational material and moves on to examine iterative methods in metric spaces. The dynamic string-averaging methods for common fixed point problems in normed space are analyzed in Chapter 3. Dynamic string methods, for common fixed point problems in a metric space are introduced and discussed in Chapter 4. Chapter 5 is devoted to the convergence of an abstract version of the algorithm which has been called component-averaged row projections (CARP). Chapter 6 studies a proximal algorithm for finding a common zero of a family of maximal monotone operators. Chapter 7 extends the results of Chapter 6 for a dynamic string-averaging version of the proximal algorithm. In Chapters 8 subgradient projections algorithms for convex feasibility problems are examined for infinite dimensional Hilbert spaces.
Дополнительное описание: 1. Introduction.- 2. Iterative methods in metric spaces.- 3. Dynamic string-averaging methods in normed spaces.- 4. Dynamic string-maximum methods in metric spaces.- 5. Abstract version of CARP algorithm.- 6. Proximal point algorithm.- 7. Dynamic string-a

Algorithms for solving common fixed point problems /, Alexander J. Zaslavski