Approximate Solutions of Common Fixed-Point Problems

Name: Approximate Solutions of Common Fixed-Point Problems
Brand: Springer Nature
SKU: 9783319332550
Availability: InStock

Best Price (Coupon Required):
Buy Approximate Solutions of Common Fixed-Point Problems for $76.50 at @ Link.springer.com when you apply the 10% OFF coupon at checkout.
Click “Get Coupon & Buy” to copy the code and unlock the deal.

Set a price drop alert to never miss an offer.

1 Offer Price Range: $84.99 - $84.99

BEST PRICE

Single Product Purchase

$76.50

@ Link.springer.com with extra coupon

Price Comparison

Seller	Contact Seller	List Price	On Sale	Shipping	Best Promo	Final Price	Volume Discount	Financing	Availability	Seller's Page
BEST PRICE 1 Product Purchase @ Link.springer.com		$84.99	$84.99		10% OFF This deals requires coupon	$76.50		See Site	In stock	Visit Store

Product Details

Brand

Springer Nature

Manufacturer

N/A

Part Number

GTIN

9783319332550

Condition

New

Product 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.

Available Colors

N/A

Available Sizes

N/A