Falls Sie nur an einem bestimmten Exempar interessiert sind, können Sie aus der folgenden Liste jenes wählen, an dem Sie interessiert sind:
Nur diese Ausgabe anzeigen…
Nur diese Ausgabe anzeigen…
Nur diese Ausgabe anzeigen…
Algorithms for Solving Common Fixed Point Problems - 13 Angebote vergleichen
Bester Preis: € 4,15 (vom 12.09.2019)Algorithms for Solving Common Fixed Point Problems (Paperback) (2019)
ISBN: 9783030084554 bzw. 3030084558, in Deutsch, Springer, United Kingdom, Taschenbuch, neu.
Language: English. Brand new Book. 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.
Algorithms for Solving Common Fixed Point Problems
ISBN: 9783319774374 bzw. 3319774379, vermutlich in Englisch, Springer Shop, neu, E-Book, elektronischer Download.
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. eBook.
Algorithms for Solving Common Fixed Point Problems
ISBN: 9783319774367 bzw. 3319774360, in Deutsch, Springer-Verlag Gmbh, gebundenes Buch, neu.
Algorithms for Solving Common Fixed Point Problems: 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. Englisch, Buch.
Algorithms for Solving Common Fixed Point Problems (2019)
ISBN: 9783030084554 bzw. 3030084558, in Deutsch, Springer, neu, Nachdruck.
New Book. Shipped from US within 10 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Algorithms for Solving Common Fixed Point Problems (2019)
ISBN: 9783030084554 bzw. 3030084558, in Deutsch, Springer, neu, Nachdruck.
New Book. Delivered from our UK warehouse in 4 to 14 business days. THIS BOOK IS PRINTED ON DEMAND. Established seller since 2000.
Algorithms for Solving Common Fixed Point Problems (2018)
ISBN: 9783319774374 bzw. 3319774379, in Englisch, Springer, Springer, Springer, neu, E-Book, elektronischer Download.
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; co.
Algorithms for Solving Common Fixed Point Problems
ISBN: 9783319774367 bzw. 3319774360, in Deutsch, Springer International Publishing, gebundenes Buch, neu.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen
Algorithms for Solving Common Fixed Point Problems
ISBN: 9783030084554 bzw. 3030084558, in Deutsch, Springer Nature Customer Service Center Gmbh, Taschenbuch, neu.
Die Beschreibung dieses Angebotes ist von geringer Qualität oder in einer Fremdsprache. Trotzdem anzeigen