skip to content
Approximate solutions of common fixed-point problems Preview this item
ClosePreview this item
Checking...

Approximate solutions of common fixed-point problems

Author: Alexander J Zaslavski
Publisher: Switzerland : Springer, 2016.
Series: Springer optimization and its applications, v. 112.
Edition/Format:   eBook : Document : EnglishView all editions and formats
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  Read more...
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy online

Links to this item

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Genre/Form: Electronic books
Additional Physical Format: Print version:
(OCoLC)945745241
Material Type: Document, Internet resource
Document Type: Internet Resource, Computer File
All Authors / Contributors: Alexander J Zaslavski
ISBN: 9783319332550 3319332554
OCLC Number: 953419584
Description: 1 online resource (ix, 454 pages).
Contents: 1.Introduction --
2. Dynamic string-averaging methods in Hilbert spaces --
3. Iterative methods in metric spaces --
4. Dynamic string-averaging methods in normed spaces --
5. Dynamic string-maximum methods in metric spaces --
6. Spaces with generalized distances --
7. Abstract version of CARP algorithm --
8. Proximal point algorithm --
9. Dynamic string-averaging proximal point algorithm --
10. Convex feasibility problems --
11. Iterative subgradient projection algorithm --
12. Dynamic string-averaging subgradient projection algorithm.- References.- Index. .
Series Title: Springer optimization and its applications, v. 112.
Responsibility: Alexander J. Zaslavski.

Abstract:

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 .

Reviews

Editorial reviews

Publisher Synopsis

"The present book on fixed point topics focusses on the study of the convergence of iterative algorithms which are mainly intended to approximate solutions of common fixed point problems and of Read more...

 
User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


Primary Entity

<http://www.worldcat.org/oclc/953419584> # Approximate solutions of common fixed-point problems
    a schema:Book, schema:MediaObject, schema:CreativeWork ;
   library:oclcnum "953419584" ;
   library:placeOfPublication <http://id.loc.gov/vocabulary/countries/sz> ;
   schema:about <http://dewey.info/class/515.7248/e23/> ;
   schema:about <http://experiment.worldcat.org/entity/work/data/3644561565#Topic/mathematics_calculus> ; # MATHEMATICS / Calculus
   schema:about <http://experiment.worldcat.org/entity/work/data/3644561565#Topic/fixed_point_theory> ; # Fixed point theory
   schema:about <http://experiment.worldcat.org/entity/work/data/3644561565#Topic/mathematics_mathematical_analysis> ; # MATHEMATICS / Mathematical Analysis
   schema:author <http://experiment.worldcat.org/entity/work/data/3644561565#Person/zaslavski_alexander_j> ; # Alexander J. Zaslavski
   schema:bookFormat schema:EBook ;
   schema:datePublished "2016" ;
   schema:description "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 ."@en ;
   schema:description "1.Introduction -- 2. Dynamic string-averaging methods in Hilbert spaces -- 3. Iterative methods in metric spaces -- 4. Dynamic string-averaging methods in normed spaces -- 5. Dynamic string-maximum methods in metric spaces -- 6. Spaces with generalized distances -- 7. Abstract version of CARP algorithm -- 8. Proximal point algorithm -- 9. Dynamic string-averaging proximal point algorithm -- 10. Convex feasibility problems -- 11. Iterative subgradient projection algorithm -- 12. Dynamic string-averaging subgradient projection algorithm.- References.- Index. ."@en ;
   schema:exampleOfWork <http://worldcat.org/entity/work/id/3644561565> ;
   schema:genre "Electronic books"@en ;
   schema:inLanguage "en" ;
   schema:isPartOf <http://worldcat.org/issn/1931-6828> ; # Springer optimization and its applications ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/945745241> ;
   schema:name "Approximate solutions of common fixed-point problems"@en ;
   schema:productID "953419584" ;
   schema:url <https://proxy1.library.eiu.edu/login?url=http://link.springer.com/10.1007/978-3-319-33255-0> ;
   schema:url <https://0-link-springer-com.pugwash.lib.warwick.ac.uk/book/10.1007/978-3-319-33255-0> ;
   schema:url <http://ebookcentral.proquest.com/lib/illcencol-ebooks/detail.action?docID=4573806> ;
   schema:url <http://link.springer.com/10.1007/978-3-319-33255-0> ;
   schema:url <https://grinnell.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-33255-0> ;
   schema:url <http://ezproxy.eui.eu/login?url=http://dx.doi.org/10.1007/978-3-319-33255-0> ;
   schema:url <http://libproxy.uwinnipeg.ca/login?url=http://link.springer.com/10.1007/978-3-319-33255-0> ;
   schema:url <http://proxy.ohiolink.edu:9099/login?url=http://link.springer.com/10.1007/978-3-319-33255-0> ;
   schema:url <http://lib.myilibrary.com?id=937443> ;
   schema:url <https://login.proxy.lib.strath.ac.uk/login?url=http://link.springer.com/10.1007/978-3-319-33255-0> ;
   schema:url <http://rave.ohiolink.edu/ebooks/ebc/9783319332550> ;
   schema:url <http://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=1214306> ;
   schema:url <https://login.libproxy.uregina.ca:8443/login?url=https://link.springer.com/openurl?genre=book&isbn=978-3-319-33253-6> ;
   schema:url <http://proxy.artic.edu/login?url=http://link.springer.com/10.1007/978-3-319-33255-0> ;
   schema:url <http://public.eblib.com/choice/PublicFullRecord.aspx?p=4573806> ;
   schema:url <http://er.llcc.edu:2048/login?url=http://link.springer.com/10.1007/978-3-319-33255-0> ;
   schema:url <https://login.libproxy.uregina.ca:8443/login?url=http://link.springer.com/openurl?genre=book&isbn=978-3-319-33253-6> ;
   schema:url <http://link.springer.com/openurl?genre=book&isbn=978-3-319-33253-6> ;
   schema:url <https://login.libproxy.noctrl.edu/login?url=http://link.springer.com/10.1007/978-3-319-33255-0> ;
   schema:url <http://sfx.carli.illinois.edu/sfxwhe/sfx_local?genre=book&sid=Voyager:WHE&sfx.ignore_date_threshold=1&svc.fulltext=yes&rft.isbn=978-3-319-33255-0> ;
   schema:url <http://dx.doi.org/10.1007/978-3-319-33255-0> ;
   schema:workExample <http://dx.doi.org/10.1007/978-3-319-33255-0> ;
   schema:workExample <http://worldcat.org/isbn/9783319332550> ;
   wdrs:describedby <http://www.worldcat.org/title/-/oclc/953419584> ;
    .


Related Entities

<http://ebookcentral.proquest.com/lib/illcencol-ebooks/detail.action?docID=4573806>
   rdfs:comment "Available for ICC via Ebook Central. Click here to access." ;
    .

<http://experiment.worldcat.org/entity/work/data/3644561565#Person/zaslavski_alexander_j> # Alexander J. Zaslavski
    a schema:Person ;
   schema:familyName "Zaslavski" ;
   schema:givenName "Alexander J." ;
   schema:name "Alexander J. Zaslavski" ;
    .

<http://experiment.worldcat.org/entity/work/data/3644561565#Topic/mathematics_calculus> # MATHEMATICS / Calculus
    a schema:Intangible ;
   schema:name "MATHEMATICS / Calculus"@en ;
    .

<http://experiment.worldcat.org/entity/work/data/3644561565#Topic/mathematics_mathematical_analysis> # MATHEMATICS / Mathematical Analysis
    a schema:Intangible ;
   schema:name "MATHEMATICS / Mathematical Analysis"@en ;
    .

<http://lib.myilibrary.com?id=937443>
   rdfs:comment "Connect to MyiLibrary resource." ;
    .

<http://link.springer.com/openurl?genre=book&isbn=978-3-319-33253-6>
   rdfs:comment "Springer eBooks (Mathematics and Statistics 2016)" ;
    .

<http://rave.ohiolink.edu/ebooks/ebc/9783319332550>
   rdfs:comment "Connect to resource" ;
    .

<http://worldcat.org/isbn/9783319332550>
    a schema:ProductModel ;
   schema:isbn "3319332554" ;
   schema:isbn "9783319332550" ;
    .

<http://worldcat.org/issn/1931-6828> # Springer optimization and its applications ;
    a bgn:PublicationSeries ;
   schema:hasPart <http://www.worldcat.org/oclc/953419584> ; # Approximate solutions of common fixed-point problems
   schema:issn "1931-6828" ;
   schema:name "Springer optimization and its applications ;" ;
   schema:name "Springer optimization and its applications," ;
    .

<http://www.worldcat.org/oclc/945745241>
    a schema:CreativeWork ;
   schema:description "Print version:" ;
   schema:isSimilarTo <http://www.worldcat.org/oclc/953419584> ; # Approximate solutions of common fixed-point problems
    .

<https://login.libproxy.uregina.ca:8443/login?url=http://link.springer.com/openurl?genre=book&isbn=978-3-319-33253-6>
   rdfs:comment "Full text available from SpringerLINK ebooks - Mathematics and Statistics (2016)" ;
    .

<https://login.libproxy.uregina.ca:8443/login?url=https://link.springer.com/openurl?genre=book&isbn=978-3-319-33253-6>
   rdfs:comment "Full text available from SpringerLINK ebooks - Mathematics and Statistics (2016)" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.