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.
save
₹5,066.00
Algorithms for Solving Common Fixed Point Problems
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.
₹5,934.00₹11,000.00
Out of stock
| Weight | 1 kg |
|---|---|
| Dimensions | 24 × 16 × 2 cm |
| Book Author | Alexander J. Zaslavski |
| Edition | 1st |
| Format | Hardback |
| ISBN | 9783319774367 |
| Language | English |
| Pages | 324 |
| Publication Year | |
| Publisher |
Customer Reviews
There are no reviews yet.
Related products
-
Discrete Mathematics
₹3,434.00The text models various problem-solving techniques in detail, then provides opportunity to practice these techniques. The text also builds mathematical maturity by emphasizing how to read and write proofs. Many proofs are illustrated with annotated figures and/or motivated by special Discussion sections. The side margins of the text now include “tiny URLs” that direct students to relevant applications, extensions, and computer programs on the textbook website.
₹7,985.00 -
College Algebra
₹2,881.00Students will find carefully placed learning aids and review tools to help them do the math.
₹6,699.00 -
Abstract Algebra
₹4,006.00In addition to standard introductory material on the subject, such as Lagrange’s and Sylow’s theorems in group theory, the text provides important specific illustrations of general theory, discussing in detail finite fields, cyclotomic polynomials, and cyclotomic fields. The book also focuses on broader background, including brief but representative discussions of naive set theory and equivalents of the axiom of choice, quadratic reciprocity, Dirichlet’s theorem on primes in arithmetic progressions, and some basic complex analysis. Numerous worked examples and exercises throughout facilitate a thorough understanding of the material.
₹8,999.00 -
Finite Mathematics for Business, Economics, Life Sciences, and Social Sciences
₹3,593.00My Lab™ Math is the teaching and learning platform that empowers you to reach every student. By combining trusted author content with digital tools and a flexible platform, My Lab Math personalizes the learning experience and improves results for each student. Learn more about My Lab Math.
₹7,985.00 -
Database Concepts
₹3,234.00The text provides flexibility for choosing the software instructors want to use in class; allows students to work with new, complete databases, including Wedgewood Pacific Corporation, Heather Sweeney Designs, and Wallingford Motors; and includes coverage for some of the latest information on databases available.
₹7,350.00 -
Concepts of Combinatorial Optimization
₹7,035.00Concepts of Combinatorial Optimization, is divided into three parts:
– On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity;
– Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming;
– Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.₹16,750.00 -
Applications of Hyperstructure Theory
₹6,666.00Since the beginning, the Hyperstructure Theory and particu- larly the Hypergroup Theory, had applications to several domains. Marty, who introduced hypergroups in 1934, applied them to groups, algebraic functions and rational fractions. New applications to groups were also found among others by Eaton, Ore, Krasner, Utumi, Drbohlav, Harrison, Roth, Mockor, Sureau and Haddad. Connections with other subjects of classical pure Mathematics have been determined and studied: * Fields by Krasner, Stratigopoulos and Massouros Ch. * Lattices by Mittas, Comer, Konstantinidou, Serafimidis, Leoreanu and Calugareanu * Rings by Nakano, Kemprasit, Yuwaree * Quasigroups and Groupoids by Koskas, Corsini, Kepka, Drbohlav, Nemec * Semigroups by Kepka, Drbohlav, Nemec, Yuwaree, Kempra- sit, Punkla, Leoreanu * Ordered Structures by Prenowitz, Corsini, Chvalina IX x * Combinatorics by Comer, Tallini, Migliorato, De Salvo, Scafati, Gionfriddo, Scorzoni * Vector Spaces by Mittas * Topology by Mittas , Konstantinidou * Ternary Algebras by Bandelt and Hedlikova.
₹20,199.00 -
Advanced Probability Theory
₹5,384.00This edition provides examples early in the text of practical problems such as the safety of a piece of engineering equipment or the inevitability of wrong conclusions in seemingly accurate medical tests for AIDS and cancer.;College or university bookstores may order five or more copies at a special student price which is available upon request from Marcel Dekker, Inc.
₹12,150.00
Be the first to review “Algorithms for Solving Common Fixed Point Problems”