The common fixed point set of commuting nonexpansive mappings in Cartesian products of separable spaces

2007 ◽  
Author(s):  
Tadeusz Kuczumow ◽  
Małgorzata Michalska
Keyword(s):  
Fixed Point ◽  
Common Fixed Point ◽  
Nonexpansive Mappings ◽  
Fixed Point Set ◽  
Cartesian Products ◽  
Point Set ◽  
The Common ◽  
Separable Spaces

scholarly journals Common Fixed-Point Problem for a Family Multivalued Mapping in Banach Space

2011 ◽  
Vol 2011 ◽  
pp. 1-9
Author(s):  
Zhanfei Zuo
Keyword(s):  
Fixed Point ◽  
Common Fixed Point ◽  
Nonexpansive Mappings ◽  
Fixed Point Problem ◽  
Point Problem ◽  
Fixed Point Set ◽  
Common Fixed Point Problem ◽  
The Family ◽  
Point Set ◽  
The Common

It is our purpose in this paper to prove two convergents of viscosity approximation scheme to a common fixed point of a family of multivalued nonexpansive mappings in Banach spaces. Moreover, it is the unique solution in to a certain variational inequality, where stands for the common fixed-point set of the family of multivalued nonexpansive mapping .

scholarly journals A General Composite Algorithms for Solving General Equilibrium Problems and Fixed Point Problems in Hilbert Spaces

2011 ◽  
Vol 2011 ◽  
pp. 1-25
Author(s):  
Rattanaporn Wangkeeree ◽  
Uthai Kamraksa ◽  
Rabian Wangkeeree
Keyword(s):  
Fixed Point ◽  
General Equilibrium ◽  
Hilbert Spaces ◽  
Nonexpansive Mappings ◽  
Common Element ◽  
Fixed Point Set ◽  
Strictly Pseudocontractive Mapping ◽  
Asymptotically Nonexpansive ◽  
Point Set ◽  
The Common

We introduce a general composite algorithm for finding a common element of the set of solutions of a general equilibrium problem and the common fixed point set of a finite family of asymptotically nonexpansive mappings in the framework of Hilbert spaces. Strong convergence of such iterative scheme is obtained which solving some variational inequalities for a strongly monotone and strictly pseudocontractive mapping. Our results extend the corresponding recent results of Yao and Liou (2010).

scholarly journals Iterative Algorithms with Perturbations for Solving the Systems of Generalized Equilibrium Problems and the Fixed Point Problems of Two Quasi-Nonexpansive Mappings

2012 ◽  
Vol 2012 ◽  
pp. 1-22
Author(s):  
Rabian Wangkeeree ◽  
Uraiwan Boonkong
Keyword(s):  
Fixed Point ◽  
Equilibrium Problems ◽  
Nonexpansive Mappings ◽  
Iterative Algorithms ◽  
Common Fixed Points ◽  
Common Element ◽  
Fixed Point Set ◽  
Generalized Equilibrium ◽  
Point Set ◽  
The Common

We introduce new iterative algorithms with perturbations for finding a common element of the set of solutions of the system of generalized equilibrium problems and the set of common fixed points of two quasi-nonexpansive mappings in a Hilbert space. Under suitable conditions, strong convergence theorems are obtained. Furthermore, we also consider the iterative algorithms with perturbations for finding a common element of the solution set of the systems of generalized equilibrium problems and the common fixed point set of the super hybrid mappings in Hilbert spaces.

scholarly journals String-averaging methods for best approximation to common fixed point sets of operators: the finite and infinite cases

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Yair Censor ◽  
Ariel Nisenbaum
Keyword(s):  
Fixed Point ◽  
Common Fixed Point ◽  
Best Approximation ◽  
Fixed Point Problem ◽  
Feasibility Problem ◽  
Point Problem ◽  
Fixed Point Set ◽  
Averaging Methods ◽  
Point Set ◽  
The Common

AbstractString-averaging is an algorithmic structure used when handling a family of operators in situations where the algorithm in hand requires to employ the operators in a specific order. Sequential orderings are well known, and a simultaneous order means that all operators are used simultaneously (in parallel). String-averaging allows to use strings of indices, constructed by subsets of the index set of all operators, to apply the operators along these strings, and then to combine their end-points in some agreed manner to yield the next iterate of the algorithm. String-averaging methods were discussed and used for solving the common fixed point problem or its important special case of the convex feasibility problem. In this paper we propose and investigate string-averaging methods for the problem of best approximation to the common fixed point set of a family of operators. This problem involves finding a point in the common fixed point set of a family of operators that is closest to a given point, called an anchor point, in contrast with the common fixed point problem that seeks any point in the common fixed point set.We construct string-averaging methods for solving the best approximation problem to the common fixed points set of either finite or infinite families of firmly nonexpansive operators in a real Hilbert space. We show that the simultaneous Halpern–Lions–Wittman–Bauschke algorithm, the Halpern–Wittman algorithm, and the Combettes algorithm, which were not labeled as string-averaging methods, are actually special cases of these methods. Some of our string-averaging methods are labeled as “static” because they use a fixed pre-determined set of strings. Others are labeled as “quasi-dynamic” because they allow the choices of strings to vary, between iterations, in a specific manner and belong to a finite fixed pre-determined set of applicable strings. For the problem of best approximation to the common fixed point set of a family of operators, the full dynamic case that would allow strings to unconditionally vary between iterations remains unsolved, although it exists and is validated in the literature for the convex feasibility problem where it is called “dynamic string-averaging”.

Iterative algorithm for a split equilibrium problem and fixed problem for finite asymptotically nonexpansive mappings in Hlbert space

Filomat ◽  
2017 ◽  
Vol 31 (5) ◽  
pp. 1423-1434 ◽  
Author(s):  
Sheng Wang ◽  
Min Chen
Keyword(s):  
Equilibrium Problem ◽  
Iterative Algorithm ◽  
Nonexpansive Mappings ◽  
Common Element ◽  
Fixed Point Set ◽  
Split Equilibrium Problem ◽  
Asymptotically Nonexpansive Mappings ◽  
Asymptotically Nonexpansive ◽  
Point Set ◽  
The Common

In this paper, we propose an iterative algorithm for finding the common element of solution set of a split equilibrium problem and common fixed point set of a finite family of asymptotically nonexpansive mappings in Hilbert space. The strong convergence of this algorithm is proved.

scholarly journals On convergence theorems for single-valued and multi-valued mappings in p-uniformly convex metric spaces

2021 ◽  
Vol 37 (3) ◽  
pp. 513-527
Author(s):  
JENJIRA PUIWONG ◽  
◽  
SATIT SAEJUNG ◽  
◽  
Keyword(s):  
Fixed Point ◽  
Metric Spaces ◽  
Nonexpansive Mappings ◽  
Iterative Sequence ◽  
Uniformly Convex ◽  
Fixed Point Set ◽  
Convergence Theorems ◽  
Convex Metric Spaces ◽  
Strict Fixed Point ◽  
Point Set

We prove ∆-convergence and strong convergence theorems of an iterative sequence generated by the Ishikawa’s method to a fixed point of a single-valued quasi-nonexpansive mappings in p-uniformly convex metric spaces without assuming the metric convexity assumption. As a consequence of our single-valued version, we obtain a result for multi-valued mappings by showing that every multi-valued quasi-nonexpansive mapping taking compact values admits a quasi-nonexpansive selection whose fixed-point set of the selection is equal to the strict fixed-point set of the multi-valued mapping. In particular, we immediately obtain all of the convergence theorems of Laokul and Panyanak [Laokul, T.; Panyanak, B. A generalization of the (CN) inequality and its applications. Carpathian J. Math. 36 (2020), no. 1, 81–90] and we show that some of their assumptions are superfluous.

Sign in / Sign up

Export Citation Format

Share Document