你好! Shipping to Taiwan with premium packaging for just NT$300 

Ship to
Taiwan
0

My Account

  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional

menu

Select your country

Americas

Europe

Rest of the world

portada Algorithms for Solving Common Fixed Point Problems (Springer Optimization and its Applications)
Type
Physical Book
Publisher
Author
Year
2019
Language
English
Pages
324
Format
Paperback
ISBN13
9783030084554
Categories

Algorithms for Solving Common Fixed Point Problems (Springer Optimization and its Applications)

Alexander J. Zaslavski (Author) · Springer · Paperback

Algorithms for Solving Common Fixed Point Problems (Springer Optimization and its Applications) - Alexander J. Zaslavski

Cheaper New Book Imported to Taiwan
Delivery: 14 Oct - 27 Oct Shipping: 16 to 20 business days.
NT$ 3,908
Faster New Book Imported to Taiwan
Delivery: 09 Oct - 19 Oct Shipping: 13 to 14 business days.
NT$ 5,058
NT$ 3,908

Choose the list to add your product or create one New List

Go to My Wishlists
Calculate shipping cost

Synopsis "Algorithms for Solving Common Fixed Point Problems (Springer Optimization and its Applications) "

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.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

Is the book original?

All books in our catalog are Original.

In what language is the book written?

The book is written in English.

What is the format of this book?

The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews