scholarly journals A Modified Iterative Algorithm for Split Feasibility Problems of Right Bregman Strongly Quasi-Nonexpansive Mappings in Banach Spaces with Applications

Algorithms ◽  
2016 ◽  
Vol 9 (4) ◽  
pp. 75
Author(s):  
Anantachai Padcharoen ◽  
Poom Kumam ◽  
Yeol Cho ◽  
Phatiphat Thounthong
Keyword(s):  
Banach Spaces ◽  
Iterative Algorithm ◽  
Nonexpansive Mappings ◽  
Split Feasibility Problems ◽  
Split Feasibility

scholarly journals An iterative method for solving multiple-set split feasibility problems in Banach spaces

2020 ◽  
Vol 36 (1) ◽  
pp. 1-13
Author(s):  
SULIMAN AL-HOMIDAN ◽  
BASHIR ALI ◽  
YUSUF I. SULEIMAN
Keyword(s):  
Fixed Point ◽  
Iterative Method ◽  
Banach Spaces ◽  
Nonexpansive Mappings ◽  
Convergence Result ◽  
Uniformly Convex ◽  
Split Feasibility Problems ◽  
Uniformly Smooth ◽  
Convex Problem ◽  
Split Feasibility

"In this paper, we study generalized multiple-set split feasibility problems (in short, GMSSFP) in the frame workof p-uniformly convex real Banach spaces which are also uniformly smooth. We construct an iterative algo-rithm which is free from an operator norm and prove its strong convergence to a solution of GMSSFP, thatis, a solution of convex problem and a common fixed point of a countable family of Bregman asymptoticallyquasi-nonexpansive mappings without requirement for semi-compactness on the mappings. We illustrate ouralgorithm and convergence result by a numerical example. "

scholarly journals Iterative methods for generalized split feasibility problems in Banach spaces

2017 ◽  
Vol 33 (1) ◽  
pp. 09-26
Author(s):  
QAMRUL HASAN ANSARI ◽  
◽  
AISHA REHAN ◽  
◽  
Keyword(s):  
Weak Convergence ◽  
Banach Spaces ◽  
Iterative Methods ◽  
Hilbert Spaces ◽  
Equilibrium Problems ◽  
Iterative Algorithms ◽  
Approximate Solutions ◽  
Split Feasibility Problems ◽  
Convergence Results ◽  
Split Feasibility

Inspired by the recent work of Takahashi et al. [W. Takahashi, H.-K. Xu and J.-C. Yao, Iterative methods for generalized split feasibility problems in Hilbert spaces, Set-Valued Var. Anal., 23 (2015), 205–221], in this paper, we study generalized split feasibility problems (GSFPs) in the setting of Banach spaces. We propose iterative algorithms to compute the approximate solutions of such problems. The weak convergence of the sequence generated by the proposed algorithms is studied. As applications, we derive some algorithms and convergence results for some problems from nonlinear analysis, namely, split feasibility problems, equilibrium problems, etc. Our results generalize several known results in the literature including the results of Takahashi et al. [W. Takahashi, H.-K. Xu and J.-C. Yao, Iterative methods for generalized split feasibility problems in Hilbert spaces, SetValued Var. Anal., 23 (2015), 205–221].

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.

Sign in / Sign up

Export Citation Format

Share Document