Warning: Constant WP_DEBUG already defined in C:\wwwroot\ebooks.wiki\wp-config.php on line 98

Warning: Constant WP_DEBUG_LOG already defined in C:\wwwroot\ebooks.wiki\wp-config.php on line 99

Warning: Constant WP_DEBUG_DISPLAY already defined in C:\wwwroot\ebooks.wiki\wp-config.php on line 100
Solutions of Fixed Point Problems with Computational Errors-电子书百科大全

Solutions of Fixed Point Problems with Computational Errors

Solutions of Fixed Point Problems with Computational Errors (Springer Optimization and Its Applications, 210)
Author: by Alexander J. Zaslavski (Author)
Publisher: Springer
Edition: 2024th
Publication Date: 2024-04-25
Language: English
Print Length: 395 pages
ISBN-10: 3031508785
ISBN-13: 9783031508783

Book Description

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 errorsfor several important algorithms used for nonconvex feasibility problems.


From the Back Cover

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.

About the Author

Alexander J. Zaslavski, Department of Mathematics, Technion – Israel Institute of Technology, Haifa, Israel.

Amazon page

 收藏 (0) 打赏

您可以选择一种方式赞助本站

支付宝扫一扫赞助

微信钱包扫描赞助

未经允许不得转载:电子书百科大全 » Solutions of Fixed Point Problems with Computational Errors

分享到: 生成海报

评论 抢沙发

评论前必须登录!

立即登录   注册

登录

忘记密码 ?

切换登录

注册

我们将发送一封验证邮件至你的邮箱, 请正确填写以完成账号注册和激活