Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

Approximate Solutions of Common Fixed-Point Problems

by Alexander J. Zaslavski
Save 35% Save 35%
Current price ₹7,277.00
Original price ₹11,194.00
Original price ₹11,194.00
Original price ₹11,194.00
(-35%)
₹7,277.00
Current price ₹7,277.00

Imported Edition - Ships in 12-14 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Hardcover
  • ISBN13: 9783319332536
  • Binding: Hardcover
  • Subject: N/A
  • Publisher: Springer
  • Publisher Imprint: Springer
  • Publication Date:
  • Pages: 454
  • Original Price: EUR 99.99
  • Language: English
  • Edition: 2016
  • Item Weight: 826 grams
  • BISAC Subject(s): Calculus, Number Systems, and Functional Analysis

From the Back Cover

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

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us