Skip to main content
  • Book
  • © 2013

Iterative Methods for Fixed Point Problems in Hilbert Spaces

Authors:

  • The projection methods for fixed point problems are presented in a consolidated way
  • Over 60 figures help to understand the properties of important classes of algorithmic operators
  • The convergence properties of projection methods follow from a few general convergence theorems presented in the monograph
  • Includes supplementary material: sn.pub/extras

Part of the book series: Lecture Notes in Mathematics (LNM, volume 2057)

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (5 chapters)

  1. Front Matter

    Pages i-xvi
  2. Introduction

    • Andrzej Cegielski
    Pages 1-38
  3. Algorithmic Operators

    • Andrzej Cegielski
    Pages 39-103
  4. Convergence of Iterative Methods

    • Andrzej Cegielski
    Pages 105-127
  5. Algorithmic Projection Operators

    • Andrzej Cegielski
    Pages 129-202
  6. Projection Methods

    • Andrzej Cegielski
    Pages 203-274
  7. Back Matter

    Pages 275-298

About this book

Iterative methods for finding fixed points of non-expansive operators in Hilbert spaces have been described in many publications. In this monograph we try to present the methods in a consolidated way. We introduce several classes of operators, examine their properties, define iterative methods generated by operators from these classes and present general convergence theorems. On this basis we discuss the conditions under which particular methods converge. A large part of the results presented in this monograph can be found in various forms in the literature (although several results presented here are new). We have tried, however, to show that the convergence of a large class of iteration methods follows from general properties of some classes of operators and from some general convergence theorems.

Reviews

From the reviews:

“Cegielski provides us with a very carefully written monograph on solving convex feasibility (and more general fixed point) problems. … Cegielski’s monograph can serve as an excellent source for an upper-level undergraduate or graduate course. … researchers in this area now have a valuable source of recent results on projection methods to which the author contributed considerably in his work over the past two decades. In summary, I highly recommend this book to anyone interested in projection methods, their generalizations and recent developments.” (Heinz H. Bauschke, Mathematical Reviews, July, 2013)

“This book is mainly concerned with iterative methods to obtain fixed points. … this book is an excellent introduction to various aspects of the iterative approximation of fixed points of nonexpansive operators in Hilbert spaces, with focus on their important applications to convex optimization problems. It would be an excellent text for graduate students, and, by the way the material is structured and presented, it will also serve as a useful introductory text for young researchers in this field.” (Vasile Berinde, Zentralblatt MATH, Vol. 1256, 2013)

Authors and Affiliations

  • Faculty of Mathematics, Computer Science and Econometrics, University of Zielona Góra, Zielona Góra, Poland

    Andrzej Cegielski

Bibliographic Information

Buy it now

Buying options

eBook USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access