國立高雄大學圖資館 |

語系: 繁體中文

說明(常見問題)

圖資館首頁

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Algorithms for solving common fixed ...

SpringerLink (Online service)

Algorithms for solving common fixed point problems

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithms for solving common fixed point problemsby Alexander J. Zaslavski.
作者:	Zaslavski, Alexander J.
出版者:	Cham :Springer International Publishing :2018.
面頁冊數:	viii, 316 p. :ill., digital ;24 cm.
Contained By:	Springer eBooks
標題:	Mathematics.
電子資源:	http://dx.doi.org/10.1007/978-3-319-77437-4
ISBN:	9783319774374$q(electronic bk.)

Algorithms for solving common fixed point problems
Zaslavski, Alexander J.

Algorithms for solving common fixed point problems[electronic resource] /by Alexander J. Zaslavski. - Cham :Springer International Publishing :2018. - viii, 316 p. :ill., digital ;24 cm. - Springer optimization and its applications,v.1321931-6828 ;. - Springer optimization and its applications ;v. 3..

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.

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.

ISBN: 9783319774374$q(electronic bk.)

Standard No.: 10.1007/978-3-319-77437-4doiSubjects--Topical Terms:

184409
Mathematics.

LC Class. No.: QA329

Dewey Class. No.: 515.724

Algorithms for solving common fixed point problems
LDR:02931nmm a2200349 a 4500 001 537924
003 DE-He213
005 20180502092856.0
006 m d
007 cr nn 008maaau
008 190116s2018 gw s 0 eng d
020 $a 9783319774374$q(electronic bk.)
020 $a 9783319774367$q(paper)
024 7 $a 10.1007/978-3-319-77437-4 $2 doi
035 $a 978-3-319-77437-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA329
072 7 $a PBKQ $2 bicssc
072 7 $a PBU $2 bicssc
072 7 $a MAT005000 $2 bisacsh
072 7 $a MAT029020 $2 bisacsh
082 0 4 $a 515.724 $2 23
090 $a QA329 $b .Z38 2018
100 1 $a Zaslavski, Alexander J. $3 261260
245 1 0 $a Algorithms for solving common fixed point problems $h [electronic resource] / $c by Alexander J. Zaslavski.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2018.
300 $a viii, 316 p. : $b ill., digital ; $c 24 cm.
490 1 $a Springer optimization and its applications, $x 1931-6828 ; $v v.132
505 0 $a 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.
520 $a 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.
650 0 $a Mathematics. $3 184409
650 0 $a Operator theory. $3 229156
650 0 $a Numerical analysis. $3 182073
650 0 $a Calculus of variations. $3 191127
650 2 4 $a Calculus of Variations and Optimal Control; Optimization. $3 274198
650 2 4 $a Operator Theory. $3 274795
650 2 4 $a Numerical Analysis. $3 275681
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
830 0 $a Springer optimization and its applications ; $v v. 3. $3 440366
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-77437-4
950 $a Mathematics and Statistics (Springer-11649)