OPEN EDUCATIONAL RESOURCES

UPA PERPUSTAKAAN UNEJ | NPP. 3509212D1000001

  • Home
  • Admin
  • Select Language :
    Arabic Bengali Brazilian Portuguese English Espanol German Indonesian Japanese Malay Persian Russian Thai Turkish Urdu

Search by :

ALL Author Subject ISBN/ISSN Advanced Search

Last search:

{{tmpObj[k].text}}
Image of Approximate Solutions of Common Fixed-Point Problems
Bookmark Share

Text

Approximate Solutions of Common Fixed-Point Problems

ZASLAVSKI, Alexander J. - Personal Name;

This book presents results on the convergence behavior of algorithms which are known as vital tools for solving convex feasibility problems and common fixed point problems. The main goal for us in dealing with a known computational error is to find what approximate solution can be obtained and how many iterates one needs to find it. According to know results, these algorithms should converge to a solution. In this exposition, these algorithms are studied, taking into account computational errors which remain consistent in practice. In this case the convergence to a solution does not take place. We show that our algorithms generate a good approximate solution if computational errors are bounded from above by a small positive constant.

Beginning with an introduction, this monograph moves on to study:

· dynamic string-averaging methods for common fixed point problems in a Hilbert space

· dynamic string methods for common fixed point problems in a metric space<

· dynamic string-averaging version of the proximal algorithm

· common fixed point problems in metric spaces
· common fixed point problems in the spaces with distances of the Bregman type

· a proximal algorithm for finding a common zero of a family of maximal monotone operators

· subgradient projections algorithms for convex feasibility problems in Hilbert spaces


Availability

No copy data

Detail Information
Series Title
Springer Optimization and Its Applications
Call Number
518 ZAS a
Publisher
Cham, Switzerland : Springer Cham., 2016
Collation
IX, 454
Language
English
ISBN/ISSN
978-3-319-33255-0
Classification
518
Content Type
text
Media Type
computer
Carrier Type
online resource
Edition
Ed. 1
Subject(s)
Numerical Analysis
Topics Calculus of Variations and Optimal Control
Specific Detail Info
-
Statement of Responsibility
Alexander J. Zaslavski
Other Information
Cataloger
umi
Source
https://link.springer.com/book/10.1007/978-3-319-33255-0
Validator
-
Digital Object Identifier (DOI)
-
Journal Volume
-
Journal Issue
-
Subtitle
-
Parallel Title
-
Other version/related

No other version available

File Attachment
  • Approximate Solutions of Common Fixed-Point Problems
Comments

You must be logged in to post a comment

OPEN EDUCATIONAL RESOURCES

Search

start it by typing one or more keywords for title, author or subject


Select the topic you are interested in
  • Computer Science, Information & General Works
  • Philosophy & Psychology
  • Religion
  • Social Sciences
  • Language
  • Pure Science
  • Applied Sciences
  • Art & Recreation
  • Literature
  • History & Geography
Icons made by Freepik from www.flaticon.com
Advanced Search
Where do you want to share?