The Resource Approximate Solutions of Common FixedPoint Problems, by Alexander J. Zaslavski, (electronic resource)
Approximate Solutions of Common FixedPoint Problems, by Alexander J. Zaslavski, (electronic resource)
Resource Information
The item Approximate Solutions of Common FixedPoint Problems, by Alexander J. Zaslavski, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in European University Institute.This item is available to borrow from 1 library branch.
Resource Information
The item Approximate Solutions of Common FixedPoint Problems, by Alexander J. Zaslavski, (electronic resource) represents a specific, individual, material embodiment of a distinct intellectual or artistic creation found in European University Institute.
This item is available to borrow from 1 library branch.
 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 .
 Language
 eng
 Extent
 1 online resource (IX, 454 pages)
 Contents

 1.Introduction
 2. Dynamic stringaveraging methods in Hilbert spaces
 3. Iterative methods in metric spaces
 4. Dynamic stringaveraging methods in normed spaces
 5. Dynamic stringmaximum methods in metric spaces
 6. Spaces with generalized distances
 7. Abstract version of CARP algorithm
 8. Proximal point algorithm
 9. Dynamic stringaveraging proximal point algorithm
 10. Convex feasibility problems
 11. Iterative subgradient projection algorithm
 12. Dynamic stringaveraging subgradient projection algorithm.– References.– Index
 Isbn
 9783319332550
 Label
 Approximate Solutions of Common FixedPoint Problems
 Title
 Approximate Solutions of Common FixedPoint Problems
 Statement of responsibility
 by 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 .
 Assigning source
 Provided by publisher
 http://library.link/vocab/creatorName
 Zaslavski, Alexander J
 Dewey number
 223
 Image bit depth
 0
 Literary form
 non fiction
 Nature of contents
 dictionaries
 Series statement

 Springer Optimization and Its Applications,
 Springer eBooks
 Series volume
 112
 http://library.link/vocab/subjectName

 Mathematics
 Operator theory
 Numerical analysis
 Calculus of variations
 Label
 Approximate Solutions of Common FixedPoint Problems, by Alexander J. Zaslavski, (electronic resource)
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier.
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent.
 Contents
 1.Introduction  2. Dynamic stringaveraging methods in Hilbert spaces  3. Iterative methods in metric spaces  4. Dynamic stringaveraging methods in normed spaces  5. Dynamic stringmaximum methods in metric spaces  6. Spaces with generalized distances  7. Abstract version of CARP algorithm  8. Proximal point algorithm  9. Dynamic stringaveraging proximal point algorithm  10. Convex feasibility problems  11. Iterative subgradient projection algorithm  12. Dynamic stringaveraging subgradient projection algorithm.– References.– Index
 Control code
 9783319332550
 Dimensions
 unknown
 Extent
 1 online resource (IX, 454 pages)
 File format
 multiple file formats
 Form of item

 online
 electronic
 Governing access note
 Use of this electronic resource may be governed by a license agreement which restricts use to the European University Institute community. Each user is responsible for limiting use to individual, noncommercial purposes, without systematically downloading, distributing, or retaining substantial portions of information, provided that all copyright and other proprietary notices contained on the materials are retained. The use of software, including scripts, agents, or robots, is generally prohibited and may result in the loss of access to these resources for the entire European University Institute community
 Isbn
 9783319332550
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia.
 Media type code
 c
 Other control number
 10.1007/9783319332550
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (OCoLC)953419584
 Label
 Approximate Solutions of Common FixedPoint Problems, by Alexander J. Zaslavski, (electronic resource)
 Antecedent source
 mixed
 Carrier category
 online resource
 Carrier category code
 cr
 Carrier MARC source
 rdacarrier.
 Color
 not applicable
 Content category
 text
 Content type code
 txt
 Content type MARC source
 rdacontent.
 Contents
 1.Introduction  2. Dynamic stringaveraging methods in Hilbert spaces  3. Iterative methods in metric spaces  4. Dynamic stringaveraging methods in normed spaces  5. Dynamic stringmaximum methods in metric spaces  6. Spaces with generalized distances  7. Abstract version of CARP algorithm  8. Proximal point algorithm  9. Dynamic stringaveraging proximal point algorithm  10. Convex feasibility problems  11. Iterative subgradient projection algorithm  12. Dynamic stringaveraging subgradient projection algorithm.– References.– Index
 Control code
 9783319332550
 Dimensions
 unknown
 Extent
 1 online resource (IX, 454 pages)
 File format
 multiple file formats
 Form of item

 online
 electronic
 Governing access note
 Use of this electronic resource may be governed by a license agreement which restricts use to the European University Institute community. Each user is responsible for limiting use to individual, noncommercial purposes, without systematically downloading, distributing, or retaining substantial portions of information, provided that all copyright and other proprietary notices contained on the materials are retained. The use of software, including scripts, agents, or robots, is generally prohibited and may result in the loss of access to these resources for the entire European University Institute community
 Isbn
 9783319332550
 Level of compression
 uncompressed
 Media category
 computer
 Media MARC source
 rdamedia.
 Media type code
 c
 Other control number
 10.1007/9783319332550
 Quality assurance targets
 absent
 Reformatting quality
 access
 Specific material designation
 remote
 System control number
 (OCoLC)953419584
Library Links
Embed (Experimental)
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.library.eui.eu/portal/ApproximateSolutionsofCommonFixedPoint/ydPNy1yO04/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.eui.eu/portal/ApproximateSolutionsofCommonFixedPoint/ydPNy1yO04/">Approximate Solutions of Common FixedPoint Problems, by Alexander J. Zaslavski, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.eui.eu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.eui.eu/">European University Institute</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 Item Approximate Solutions of Common FixedPoint Problems, by Alexander J. Zaslavski, (electronic resource)
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.library.eui.eu/portal/ApproximateSolutionsofCommonFixedPoint/ydPNy1yO04/" typeof="Book http://bibfra.me/vocab/lite/Item"><span property="name http://bibfra.me/vocab/lite/label"><a href="http://link.library.eui.eu/portal/ApproximateSolutionsofCommonFixedPoint/ydPNy1yO04/">Approximate Solutions of Common FixedPoint Problems, by Alexander J. Zaslavski, (electronic resource)</a></span>  <span property="potentialAction" typeOf="OrganizeAction"><span property="agent" typeof="LibrarySystem http://library.link/vocab/LibrarySystem" resource="http://link.library.eui.eu/"><span property="name http://bibfra.me/vocab/lite/label"><a property="url" href="http://link.library.eui.eu/">European University Institute</a></span></span></span></span></div>