Algorithms for Solving Common Fixed Point Problems: Springer Optimization and Its Applications, cartea 132
Autor Alexander J. Zaslavskien Limba Engleză Hardback – 14 mai 2018
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.
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 635.73 lei 38-44 zile | |
Springer International Publishing – 30 ian 2019 | 635.73 lei 38-44 zile | |
Hardback (1) | 645.87 lei 38-44 zile | |
Springer International Publishing – 14 mai 2018 | 645.87 lei 38-44 zile |
Din seria Springer Optimization and Its Applications
- 15% Preț: 629.02 lei
- 15% Preț: 651.17 lei
- 18% Preț: 942.07 lei
- 17% Preț: 360.79 lei
- 17% Preț: 468.29 lei
- Preț: 361.01 lei
- 18% Preț: 771.96 lei
- 17% Preț: 397.79 lei
- 18% Preț: 1110.33 lei
- 15% Preț: 633.36 lei
- 15% Preț: 634.32 lei
- Preț: 392.43 lei
- Preț: 372.59 lei
- Preț: 383.90 lei
- Preț: 388.48 lei
- Preț: 535.24 lei
- 15% Preț: 634.95 lei
- Preț: 382.41 lei
- 15% Preț: 636.73 lei
- 24% Preț: 611.55 lei
- 18% Preț: 952.91 lei
- 20% Preț: 585.91 lei
- 15% Preț: 695.73 lei
- 18% Preț: 727.59 lei
- 15% Preț: 644.92 lei
- 15% Preț: 645.70 lei
- 18% Preț: 730.08 lei
- 15% Preț: 691.06 lei
- 20% Preț: 581.07 lei
Preț: 645.87 lei
Preț vechi: 849.83 lei
-24% Nou
Puncte Express: 969
Preț estimativ în valută:
123.62€ • 128.49$ • 102.40£
123.62€ • 128.49$ • 102.40£
Carte tipărită la comandă
Livrare economică 31 ianuarie-06 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9783319774367
ISBN-10: 3319774360
Pagini: 270
Ilustrații: VIII, 316 p.
Dimensiuni: 155 x 235 mm
Greutate: 0.63 kg
Ediția:1st ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seria Springer Optimization and Its Applications
Locul publicării:Cham, Switzerland
ISBN-10: 3319774360
Pagini: 270
Ilustrații: VIII, 316 p.
Dimensiuni: 155 x 235 mm
Greutate: 0.63 kg
Ediția:1st ed. 2018
Editura: Springer International Publishing
Colecția Springer
Seria Springer Optimization and Its Applications
Locul publicării:Cham, Switzerland
Cuprins
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-averaging proximal point algorithm.- 8. Convex feasibility problems.
Textul de pe ultima copertă
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.
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.
Caracteristici
Examines approximate solutions to common fixed point problems Offers a number of algorithms to solve convex feasibility problems and common fixed point problems Covers theoretical achievements and applications to engineering