Algorithms for Solving Common Fixed Point Problems - Alexander J. Zaslavski
-25% koodilla BOOKS
Toimitus 17-23 arkipäivässä
30 päivän palautusoikeus
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 bo ... Täydellinen kuvaus
Saatat myös pitää
TOP
Six Not-so-easy Pieces: Einstein's Relativity, Symmetry, and Space-Time
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Six Easy Pieces: Essentials of Physics Explained by Its Most Brilliant Teacher
Richard P. Feynman, Robert B. Leighton, Matthew Sands
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Behave: The Biology of Humans at Our Best and Worst
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Age of Alchemy: How Early Innovators Shaped Modern Chemistry
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Secrets of our DNA: How Genetics has Changed the World
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Why We Sleep: Unlocking the Power of Sleep and Dreams
-25% koodilla BOOKS
Varastossa
TOP
Astrophysics for People in a Hurry: Essays on the Universe and Our Place Within It
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Rise and Fall of the Dinosaurs: A New History of a Lost World
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Rise and Reign of the Mammals: A New History, from the Shadow of the Dinosaurs to Us
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Determined: The Science of Life Without Free Will
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Learn Faster, Perform Better: A Musician's Guide to the Neuroscience of Practicing
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Beyond Inheritance: Our Ever-Mutating Cells and a New Understanding of Health
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
How to Solve it: A New Aspect of Mathematical Method
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Thing Explainer: Complicated Stuff in Simple Words
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Introduction to Quantum Mechanics
Darrell F. Schroeter, David J. Griffiths
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Factfulness: Ten Reasons We're Wrong About the World--and Why Things Are Better Than You Think
Ola Rosling, Anna Rosling Rönnlund, Hans Rosling
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Universe: The Definitive Visual Guide
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
How Far the Light Reaches: A Life in Ten Sea Creatures
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Light Eaters: How the Unseen World of Plant Intelligence Offers a New Understanding of Life on Earth
-25% koodilla BOOKS
Toimittajalla varastossa
Kuvaus
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 problemsin 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.
Lisätietoja
| Kirjoittaja | Alexander J. Zaslavski |
|---|---|
| Julkaisija | Springer Nature Switzerland |
| Series | Springer Optimization and Its Applications |
| Julkaisuvuosi | 2018 |
| Kannen tyyppi | Kovakantinen |
| EAN | 9783319774367 |