東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Solutions of fixed point problems with computational errors

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Solutions of fixed point problems with computational errors/ by Alexander J. Zaslavski.
作者:	Zaslavski, Alexander J.
出版者:	Cham :Springer Nature Switzerland : : 2024.,
面頁冊數:	ix, 386 p. :ill., digital ;24 cm.
內容註:	1 - Introduction -- 2 - Iterative methods in a Hilbert space -- 3 - The Cimmino algorithm in a Hilbert space -- 4 - Dynamic string-averaging methods in Hilbert spaces -- 5 - Methods with remotest set control in a Hilbert space -- 6 - Algorithms based on unions of nonexpansive maps -- 7 - Inconsistent convex feasibility problems -- 8 - Split common fixed point problems.
Contained By:	Springer Nature eBook
標題:	Mathematical optimization. -
電子資源:	https://doi.org/10.1007/978-3-031-50879-0
ISBN:	9783031508790

Solutions of fixed point problems with computational errors
Zaslavski, Alexander J.

Solutions of fixed point problems with computational errors[electronic resource] /by Alexander J. Zaslavski. - Cham :Springer Nature Switzerland :2024. - ix, 386 p. :ill., digital ;24 cm. - Springer optimization and its applications,v. 2101931-6836 ;. - Springer optimization and its applications ;v. 210..

1 - Introduction -- 2 - Iterative methods in a Hilbert space -- 3 - The Cimmino algorithm in a Hilbert space -- 4 - Dynamic string-averaging methods in Hilbert spaces -- 5 - Methods with remotest set control in a Hilbert space -- 6 - Algorithms based on unions of nonexpansive maps -- 7 - Inconsistent convex feasibility problems -- 8 - Split common fixed point problems.

The book is devoted to the study of approximate solutions of fixed point problems in the presence of computational errors. It begins with a study of approximate solutions of star-shaped feasibility problems in the presence of perturbations. The goal is to show the convergence of algorithms, which are known as important tools for solving convex feasibility problems and common fixed point problems. The text also presents studies of algorithms based on unions of nonexpansive maps, inconsistent convex feasibility problems, and split common fixed point problems. A number of algorithms are considered for solving convex feasibility problems and common fixed point problems. The book will be of interest for researchers and engineers working in optimization, numerical analysis, and fixed point theory. It also can be useful in preparation courses for graduate students. The main feature of the book which appeals specifically to this audience is the study of the influence of computational errors for several important algorithms used for nonconvex feasibility problems.

ISBN: 9783031508790

Standard No.: 10.1007/978-3-031-50879-0doiSubjects--Topical Terms:

517763
Mathematical optimization.

LC Class. No.: QA402.5

Dewey Class. No.: 519.6

Solutions of fixed point problems with computational errors
LDR:02505nmm a22003375a 4500 001 2370603
003 DE-He213
005 20240319000631.0
006 m d
007 cr nn 008maaau
008 241127s2024 sz s 0 eng d
020 $a 9783031508790 $q (electronic bk.)
020 $a 9783031508783 $q (paper)
024 7 $a 10.1007/978-3-031-50879-0 $2 doi
035 $a 978-3-031-50879-0
040 $a GP $c GP
041 0 $a eng
050 4 $a QA402.5
072 7 $a PBU $2 bicssc
072 7 $a MAT042000 $2 bisacsh
072 7 $a PBU $2 thema
082 0 4 $a 519.6 $2 23
090 $a QA402.5 $b .Z38 2024
100 1 $a Zaslavski, Alexander J. $3 814771
245 1 0 $a Solutions of fixed point problems with computational errors $h [electronic resource] / $c by Alexander J. Zaslavski.
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2024.
300 $a ix, 386 p. : $b ill., digital ; $c 24 cm.
490 1 $a Springer optimization and its applications, $x 1931-6836 ; $v v. 210
505 0 $a 1 - Introduction -- 2 - Iterative methods in a Hilbert space -- 3 - The Cimmino algorithm in a Hilbert space -- 4 - Dynamic string-averaging methods in Hilbert spaces -- 5 - Methods with remotest set control in a Hilbert space -- 6 - Algorithms based on unions of nonexpansive maps -- 7 - Inconsistent convex feasibility problems -- 8 - Split common fixed point problems.
520 $a The book is devoted to the study of approximate solutions of fixed point problems in the presence of computational errors. It begins with a study of approximate solutions of star-shaped feasibility problems in the presence of perturbations. The goal is to show the convergence of algorithms, which are known as important tools for solving convex feasibility problems and common fixed point problems. The text also presents studies of algorithms based on unions of nonexpansive maps, inconsistent convex feasibility problems, and split common fixed point problems. A number of algorithms are considered for solving convex feasibility problems and common fixed point problems. The book will be of interest for researchers and engineers working in optimization, numerical analysis, and fixed point theory. It also can be useful in preparation courses for graduate students. The main feature of the book which appeals specifically to this audience is the study of the influence of computational errors for several important algorithms used for nonconvex feasibility problems.
650 0 $a Mathematical optimization. $3 517763
650 0 $a Fixed point theory. $3 546826
650 1 4 $a Optimization. $3 891104
650 2 4 $a Operator Theory. $3 897311
650 2 4 $a Computational Mathematics and Numerical Analysis. $3 891040
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
830 0 $a Springer optimization and its applications ; $v v. 210. $3 3716078
856 4 0 $u https://doi.org/10.1007/978-3-031-50879-0
950 $a Mathematics and Statistics (SpringerNature-11649)