LEADER 01091nam0-22003371i-450- 001 990003745740403321 005 20001010 035 $a000374574 035 $aFED01000374574 035 $a(Aleph)000374574FED01 035 $a000374574 100 $a20001010d--------km-y0itay50------ba 101 0 $aita 105 $ay-------001yy 200 1 $a<>storia mi assolverā$fFidel Castro$gcon un saggio di Ariel Dorfman$gprefazione di Saverio Tutino$gtraduzione del testodi Castro di Raffaele Melis, traduzione del saggio di Dorfman di Franco Avicolli 205 $a1. ed. 210 $aRimini$cGuaraldi$d1976 215 $a174 p.$d18 cm 225 1 $aPassato e futuro. Serie di testi politici$fa cura di Mario Caciagli$v19 610 0 $aSCIENZA POLITICA$aTeoria 676 $a320.01 700 1$aCastro,$bFidel$f<1927- >$0129229 702 1$aDorfman,$bAriel 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990003745740403321 952 $a320.01 CAS 1$b324$fBFS 959 $aBFS 996 $aStoria mi assolverā$992087 997 $aUNINA DB $aING01 LEADER 03870nam 22005295 450 001 9910300106503321 005 20200706100929.0 010 $a3-319-77437-9 024 7 $a10.1007/978-3-319-77437-4 035 $a(CKB)4100000004243798 035 $a(DE-He213)978-3-319-77437-4 035 $a(MiAaPQ)EBC5379798 035 $a(PPN)227402677 035 $a(EXLCZ)994100000004243798 100 $a20180502d2018 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aAlgorithms for Solving Common Fixed Point Problems /$fby Alexander J. Zaslavski 205 $a1st ed. 2018. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2018. 215 $a1 online resource (VIII, 316 p.) 225 1 $aSpringer Optimization and Its Applications,$x1931-6828 ;$v132 311 $a3-319-77436-0 327 $a1. 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. 330 $aThis 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. . 410 0$aSpringer Optimization and Its Applications,$x1931-6828 ;$v132 606 $aCalculus of variations 606 $aOperator theory 606 $aNumerical analysis 606 $aCalculus of Variations and Optimal Control; Optimization$3https://scigraph.springernature.com/ontologies/product-market-codes/M26016 606 $aOperator Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/M12139 606 $aNumerical Analysis$3https://scigraph.springernature.com/ontologies/product-market-codes/M14050 615 0$aCalculus of variations. 615 0$aOperator theory. 615 0$aNumerical analysis. 615 14$aCalculus of Variations and Optimal Control; Optimization. 615 24$aOperator Theory. 615 24$aNumerical Analysis. 676 $a515.64 700 $aZaslavski$b Alexander J$4aut$4http://id.loc.gov/vocabulary/relators/aut$0721713 906 $aBOOK 912 $a9910300106503321 996 $aAlgorithms for Solving Common Fixed Point Problems$91564647 997 $aUNINA