Iterative Algorithm of Fixed Points for Nonexpansive Mappings by Metric Projections

2010 ◽  
Author(s):  
Yuanheng Wang ◽  
Zongsheng Sheng
Keyword(s):  
Fixed Points ◽  
Iterative Algorithm ◽  
Nonexpansive Mappings ◽  
Metric Projections

scholarly journals Iterative Algorithm for Common Fixed Points of Infinite Family of Nonexpansive Mappings in Banach Spaces

2012 ◽  
Vol 2012 ◽  
pp. 1-13 ◽  
Author(s):  
Songnian He ◽  
Jun Guo
Keyword(s):  
Fixed Points ◽  
Iterative Algorithm ◽  
Nonexpansive Mappings ◽  
Infinite Family ◽  
Common Fixed Points ◽  
Nonempty Closed Convex Subset ◽  
Duality Mapping ◽  
Normalized Duality Mapping ◽  
Uniformly Smooth ◽  
Computational Work

LetCbe a nonempty closed convex subset of a real uniformly smooth Banach spaceX,{Tk}k=1∞:C→Can infinite family of nonexpansive mappings with the nonempty set of common fixed points⋂k=1∞Fix⁡(Tk), andf:C→Ca contraction. We introduce an explicit iterative algorithmxn+1=αnf(xn)+(1-αn)Lnxn, whereLn=∑k=1n(ωk/sn)Tk,Sn=∑k=1nωk,  andwk>0with∑k=1∞ωk=1. Under certain appropriate conditions on{αn}, we prove that{xn}converges strongly to a common fixed pointx*of{Tk}k=1∞, which solves the following variational inequality:〈x*-f(x*),J(x*-p)〉≤0,    p∈⋂k=1∞Fix(Tk), whereJis the (normalized) duality mapping ofX. This algorithm is brief and needs less computational work, since it does not involveW-mapping.

MODIFIED HALPERN ITERATIVE ALGORITHM FOR NONEXPANSIVE MAPPINGS II

2011 ◽  
Vol 04 (04) ◽  
pp. 683-694
Author(s):  
Mengistu Goa Sangago
Keyword(s):  
Strong Convergence ◽  
Fixed Points ◽  
Banach Spaces ◽  
Iterative Algorithm ◽  
Nonexpansive Mappings ◽  
Convergence Conditions ◽  
Uniformly Smooth ◽  
Additional Control ◽  
Uniformly Smooth Banach Spaces

Halpern iterative algorithm is one of the most cited in the literature of approximation of fixed points of nonexpansive mappings. Different authors modified this iterative algorithm in Banach spaces to approximate fixed points of nonexpansive mappings. One of which is Yao et al. [16] modification of Halpern iterative algorithm for nonexpansive mappings in uniformly smooth Banach spaces. Unfortunately, some deficiencies are found in the Yao et al. [16] control conditions imposed on the modified iteration to obtain strong convergence. In this paper, counterexamples are constructed to prove that the strong convergence conditions of Yao et al. [16] are not sufficient and it is also proved that with some additional control conditions on the parameters strong convergence of the iteration is obtained.

scholarly journals Approximating fixed points of enriched nonexpansive mappings in Banach spaces by using a retraction-displacement condition

2020 ◽  
Vol 36 (1) ◽  
pp. 27-34 ◽  
Author(s):  
VASILE BERINDE
Keyword(s):  
Hilbert Space ◽  
Fixed Point ◽  
Fixed Points ◽  
Banach Spaces ◽  
Iterative Algorithm ◽  
Hilbert Spaces ◽  
Nonexpansive Mappings ◽  
Convergence Theorems ◽  
Displacement Condition ◽  
Nonlinear Mappings

In this paper, we prove convergence theorems for a fixed point iterative algorithm of Krasnoselskij-Mann typeassociated to the class of enriched nonexpansive mappings in Banach spaces. The results are direct generaliza-tions of the corresponding ones in [Berinde, V.,Approximating fixed points of enriched nonexpansive mappings byKrasnoselskij iteration in Hilbert spaces, Carpathian J. Math., 35 (2019), No. 3, 293–304.], from the setting of Hilbertspaces to Banach spaces, and also of some results in [Senter, H. F. and Dotson, Jr., W. G.,Approximating fixed pointsof nonexpansive mappings, Proc. Amer. Math. Soc.,44(1974), No. 2, 375–380.], [Browder, F. E., Petryshyn, W. V., Construction of fixed points of nonlinear mappings in Hilbert space, J. Math. Anal. Appl., 20 (1967), 197–228.], byconsidering enriched nonexpansive mappings instead of nonexpansive mappings. Many other related resultsin literature can be obtained as particular instances of our results.

scholarly journals New Iterative Algorithm for Solving Constrained Convex Minimization Problem and Split Feasibility Problem

2021 ◽  
Vol 1 (2) ◽  
pp. 106-132
Author(s):  
Austine Efut Ofem ◽  
Unwana Effiong Udofia ◽  
Donatus Ikechi Igbokwe
Keyword(s):  
Fixed Points ◽  
Iterative Algorithm ◽  
Nonexpansive Mappings ◽  
Iterative Algorithms ◽  
Split Feasibility Problem ◽  
Feasibility Problem ◽  
Almost Contraction ◽  
Contraction Mappings ◽  
Constrained Convex Minimization Problem ◽  
Split Feasibility

The purpose of this paper is to introduce a new iterative algorithm to approximate the fixed points of almost contraction mappings and generalized α-nonexpansive mappings. Also, we show that our proposed iterative algorithm converges weakly and strongly to the fixed points of almost contraction mappings and generalized α-nonexpansive mappings. Furthermore, it is proved analytically that our new iterative algorithm converges faster than one of the leading iterative algorithms in the literature for almost contraction mappings. Some numerical examples are also provided and used to show that our new iterative algorithm has better rate of convergence than all of S, Picard-S, Thakur and M iterative algorithms for almost contraction mappings and generalized α-nonexpansive mappings. Again, we show that the proposed iterative algorithm is stable with respect to T and data dependent for almost contraction mappings. Some applications of our main results and new iterative algorithm are considered. The results in this article are improvements, generalizations and extensions of several relevant results existing in the literature.

Sign in / Sign up

Export Citation Format

Share Document