𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An iterative method for finding coincidence points of two mappings

✍ Scribed by A. V. Arutyunov

Book ID
119883333
Publisher
SP MAIK Nauka/Interperiodica
Year
2012
Tongue
English
Weight
165 KB
Volume
52
Category
Article
ISSN
0965-5425

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An iterative algorithm for finding a nea
An iterative algorithm for finding a nearest pair of points in two convex subsets of Rn
✍ B. Llanas; M. Fernandez de Sevilla; V. Feliu πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 536 KB

We present an algorithm for finding a nearest pair of points in two convex sets of R n, and therefore, their distance. The algorithm is based on the fixed-point theory of nonexpansive operators on a Hilbert space. Its practical implementation requires a fast projection algorithm. We introduce such a

Strong convergence of an iterative metho
Strong convergence of an iterative method for non-expansive mappings
✍ Yisheng Song; Rudong Chen πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 142 KB

## Abstract Let __E__ be a real reflexive Banach space having a weakly continuous duality mapping __J__~__Ο†__~ with a gauge function __Ο†__, and let __K__ be a nonempty closed convex subset of __E__. Suppose that __T__ is a non‐expansive mapping from __K__ into itself such that __F__ (__T__) β‰  βˆ…οΈ.