Approximate solutions of common fixedpoint problems
Resource Information
The work Approximate solutions of common fixedpoint problems represents a distinct intellectual or artistic creation found in University of Oklahoma Libraries. This resource is a combination of several types including: Work, Language Material, Books.
The Resource
Approximate solutions of common fixedpoint problems
Resource Information
The work Approximate solutions of common fixedpoint problems represents a distinct intellectual or artistic creation found in University of Oklahoma Libraries. This resource is a combination of several types including: Work, Language Material, Books.
 Label
 Approximate solutions of common fixedpoint problems
 Statement of responsibility
 Alexander J. Zaslavski
 Language
 eng
 Summary
 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 stringaveraging methods for common fixed point problems in a Hilbert space · dynamic string methods for common fixed point problems in a metric space · dynamic stringaveraging 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
 Cataloging source
 GW5XE
 Dewey number
 515/.7248
 Index
 index present
 LC call number
 QA329.9
 Literary form
 non fiction
 Nature of contents

 dictionaries
 bibliography
 Series statement
 Springer optimization and its applications,
 Series volume
 volume 112
Context
Context of Approximate solutions of common fixedpoint problemsWork of
No resources found
No enriched resources found
Embed
Settings
Select options that apply then copy and paste the RDF/HTML data fragment to include in your application
Embed this data in a secure (HTTPS) page:
Layout options:
Include data citation:
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.libraries.ou.edu/resource/GSrB_iAgAR0/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/resource/GSrB_iAgAR0/">Approximate solutions of common fixedpoint problems</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>
Note: Adjust the width and height settings defined in the RDF/HTML code fragment to best match your requirements
Preview
Cite Data  Experimental
Data Citation of the Work Approximate solutions of common fixedpoint problems
Copy and paste the following RDF/HTML data fragment to cite this resource
<div class="citation" vocab="http://schema.org/"><i class="fa faexternallinksquare fafw"></i> Data from <span resource="http://link.libraries.ou.edu/resource/GSrB_iAgAR0/" typeof="CreativeWork http://bibfra.me/vocab/lite/Work"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.libraries.ou.edu/resource/GSrB_iAgAR0/">Approximate solutions of common fixedpoint problems</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.libraries.ou.edu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.libraries.ou.edu/">University of Oklahoma Libraries</a></span></span></span></span></div>