Computers and Mathematics with Applications 55 (2008) 2999–3002 www.elsevier.com/locate/camwa

Erratum

Erratum to “Mann and Ishikawa iterative processes for multivalued mappings in Banach spaces” [Comput. Math. Appl. 54 (2007) 872–877] Yisheng Song ∗ , Hongjun Wang College of Mathematics and Information Science, Henan Normal University, 453007, PR China Received 5 October 2007; accepted 17 November 2007

Abstract We show strong convergence for Mann and Ishikawa iterates of multivalued nonexpansive mapping T under some appropriate conditions, which revises a gap in Panyanak [B. Panyanak, Mann and Ishikawa iterative processes for multivalued mappings in Banach spaces, Comput. Math. Appl. 54 (2007) 872–877]. Furthermore, we also give an affirmative answer to Panyanak’s open question. c 2008 Elsevier Ltd. All rights reserved.

Keywords: Ishikawa iterates; Strong convergence; Uniformly convex Banach spaces

Let E be a Banach space and K a nonempty subset of E. We shall denote CB(E) by the family of nonempty closed and bounded subsets of E and the family of nonempty bounded proximinal subsets of E (see [1]). Let H be the Hausdorff metric on CB(E), that is, H (A, B) = max{sup d(x, B), sup d(x, A)} x∈A

for any A, B ∈ CB(E),

x∈B

where d(x, B) = inf{kx − yk; y ∈ B}. A multivalued mapping T : K → CB(E) is said to be nonexpansive, if for any x, y ∈ K , such that H (T x, T y) ≤ kx − yk. A point x is called a fixed point of T if x ∈ T x. From now on, F(T ) stands for the fixed point set of a mapping T . Recently, Panyanak [1] introduced the following Ishikawa iterates of a multivalued mapping T . Let K be a nonempty convex subset of E, fix p ∈ F(T ) and x0 ∈ K , yn = (1 − βn )xn + βn z n ,

βn ∈ [0, 1], n ≥ 0,

where z n ∈ T xn such that kz n − pk = d( p, T xn ), and xn+1 = (1 − αn )xn + αn z n0 ,

αn ∈ [0, 1], n ≥ 0,

DOI of original article: 10.1016/j.camwa.2007.03.012. ∗ Corresponding author.

E-mail address: [email protected] (Y. Song). c 2008 Elsevier Ltd. All rights reserved. 0898-1221/$ - see front matter doi:10.1016/j.camwa.2007.11.042

3000

Y. Song, H. Wang / Computers and Mathematics with Applications 55 (2008) 2999–3002

where z n0 ∈ T yn such that kz n0 − pk = d( p, T yn ). It is obvious that xn depends on p and T . For p ∈ F(T ), we have kz n − pk = d( p, T xn ) ≤ H (T p, T xn ) ≤ kxn − pk and kz n0 − pk = d( p, T yn ) ≤ H (T p, T yn ) ≤ kyn − pk. Clearly, if q ∈ F(T ) and q 6= p, then the above inequalities cannot be assured. Namely, from the monotony of {kxn − pk} in the proof of [1, Theorem 3.1], we cannot obtain {kxn − qk} is a decreasing sequence. Hence, the conclusion of Theorem 3.1 in [1] cannot be reached. Motivated by solving the above gap, we have tried to modify it. The aim of this paper is to find an iteration instead of the above one and to overcome its limitation. We will construct the following iteration. Let K be a nonempty convex subset of E, βn ∈ [0, 1], αn ∈ [0, 1] and γn ∈ (0, +∞) such that limn→∞ γn = 0. Choose x0 ∈ K and z 0 ∈ T x0 . Let y0 = (1 − β0 )x0 + β0 z 0 . There exists z 00 ∈ T y0 such that kz 0 − z 00 k ≤ H (T x0 , T y0 ) + γ0 (see [2,3]). Let x1 = (1 − α0 )x0 + α0 z 00 . There is z 1 ∈ T x1 such that kz 1 − z 00 k ≤ H (T x1 , T y0 ) + γ1 . Take y1 = (1 − β1 )x1 + β1 z 1 . There exists z 10 ∈ T y1 such that kz 1 − z 10 k ≤ H (T x1 , T y1 ) + γ1 . Let x2 = (1 − α1 )x1 + α1 z 10 . Inductively, we have yn = (1 − βn )xn + βn z n , xn+1 = (1 − αn )xn + αn z n0 ,

(1)

where kz n − z n0 k ≤ H (T xn , T yn ) + γn and kz n+1 − z n0 k ≤ H (T xn+1 , T yn ) + γn for z n ∈ T xn and z n0 ∈ T yn . We now show the strong convergence of the Ishikawa iteration (1) which shakes off the objection in [1, Theorem 3.1]. Theorem 1. Let K be a nonempty compact convex subset of a uniformly convex Banach space E. Suppose that T : K → CB(K ) is a multivalued nonexpansive mapping and F(T ) 6= ∅ satisfying T (y) = {y} for any fixed point y ∈ F(T ). Let {xn } be the sequence of Ishikawa iterates defined Pby (1). Assume that (i) αn , βn ∈ [0, 1); (ii) limn→∞ βn = 0 and (iii) ∞ n=0 αn βn = ∞. Then as n → ∞, the sequence {xn } strongly converges to some fixed point of T . Proof. Take p ∈ F(T ) (noting T p = { p} and kz n − pk = d(z n , T p)). Using a similar proof of Theorem 3.1 as in [1] (Xu’s inequality, see[1, Lemma 2.3]), we have kxn+1 − pk2 ≤ (1 − αn )kxn − pk2 + αn kz n0 − pk2 − αn (1 − αn )ϕ(kxn − z n0 k) ≤ (1 − αn )kxn − pk2 + αn (H (T yn , T p))2 ≤ (1 − αn )kxn − pk2 + αn kyn − pk2 ≤ (1 − αn )kxn − pk2 + αn [(1 − βn )kxn − pk2 + βn kz n − pk2 − βn (1 − βn )ϕ(kxn − z n k)] ≤ (1 − αn )kxn − pk2 + αn [(1 − βn )kxn − pk2 + βn (H (T xn , T p))2 − βn (1 − βn )ϕ(kxn − z n k)] ≤ kxn − pk2 − αn βn (1 − βn )ϕ(kxn − z n k).

Y. Song, H. Wang / Computers and Mathematics with Applications 55 (2008) 2999–3002

3001

Therefore, kxn+1 − pk2 ≤ kxn − pk2 and αn βn (1 − βn )ϕ(kxn − z n k) ≤ kxn − pk2 − kxn+1 − pk2 .

(2)

Then {kxn − pk} is a decreasing sequence and further limn→∞ kxn − pk exists for each p ∈ F(T ). It follows from (2) that ∞ X

αn βn (1 − βn )ϕ(kxn − z n k) ≤ kx1 − pk2 .

n=0

The remainder proof is the same as Theorem 3.1 of [1], we omit it. A multivalued mapping T : K → CB(K ) is said to satisfy Condition I if there is a nondecreasing function f : [0, ∞) → [0, ∞) with f (0) = 0, f (r ) > 0 for r ∈ (0, ∞) such that d(x, T x) ≥ f (d(x, F(T )))

for all x ∈ K . 

Next we give the affirmative answer of the open question in [1] using the iteration (1). Theorem 2. Let K be a nonempty closed convex subset of a uniformly convex Banach space E. Suppose that T : K → CB(K ) is a multivalued nonexpansive mapping that satisfies Condition I. Let {xn } be the sequence of Ishikawa iterates defined by (1). Assume that F(T ) 6= ∅ satisfying T (y) = {y} for any fixed point y ∈ F(T ) and αn , βn ∈ [a, b] ⊂ (0, 1). Then as n → ∞, the sequence {xn } strongly converges to some fixed point of T . Proof. Using a similar proof of Theorem 1, we obtain limn→∞ kxn − pk2 exists for p ∈ F(T ) and αn βn (1 − βn )ϕ(kxn − z n k) ≤ kxn − pk2 − kxn+1 − pk2 . Then a 2 (1 − b)ϕ(kxn − z n k) ≤ αn βn (1 − βn )ϕ(kxn − z n k) ≤ kxn − pk2 − kxn+1 − pk2 . Thus, limn→∞ ϕ(kxn − z n k) = 0 and hence limn→∞ kxn − z n k = 0. As z n ∈ T xn , then d(xn , T xn ) ≤ kxn − z n k. Therefore, limn→∞ d(xn , T xn ) = 0. Furthermore Condition I implies lim d(xn , F(T )) = 0.

n→∞



The remainder of the proof is the same as Theorem 3.8 of [1], and we omit it. Remark. The above results holds for Mann iteration (βn ≡ 0 in (1)). For the conclusion of Theorem 2, let xn+1 = (1 − αn )xn + αn z n for z n ∈ T xn and αn ∈ [a, b] ⊂ (0, 1). Then we have kxn+1 − pk2 ≤ (1 − αn )kxn − pk2 + αn kz n − pk2 − αn (1 − αn )ϕ(kxn − z n k) ≤ (1 − αn )kxn − pk2 + αn (H (T xn , T p))2 − αn (1 − αn )ϕ(kxn − z n k) ≤ (1 − αn )kxn − pk2 + αn kxn − pk2 − αn (1 − αn )ϕ(kxn − z n k) ≤ kxn − pk2 − αn (1 − αn )ϕ(kxn − z n k). Hence, a(1 − b)ϕ(kxn − z n k) ≤ αn (1 − βn )ϕ(kxn − z n k) ≤ kxn − pk2 − kxn+1 − pk2 . Thus we also have limn→∞ ϕ(kxn − z n k) = 0 and hence lim d(xn , F(T )) = 0.

n→∞

3002

Y. Song, H. Wang / Computers and Mathematics with Applications 55 (2008) 2999–3002

References [1] B. Panyanak, Mann and Ishikawa iterative processes for multivalued mappings in Banach spaces, Comput. Math. Appl. 54 (2007) 872–877. [2] N.A. Assad, W.A. Kirk, Fixed point theorems for set-valued mappings of contractive type, Pacific J. Math. 43 (1972) 553–562. [3] S.B. Nadler Jr., Multi-valued contraction mappings, Pacific J. Math. 30 (1969) 475–487.

Mann and Ishikawa iterative processes for multivalued ...

DOI of original article: 10.1016/j.camwa.2007.03.012. ∗ Corresponding author. E-mail address: songyisheng123@yahoo.com.cn (Y. Song). 0898-1221/$ - see ...

160KB Sizes 2 Downloads 221 Views

Recommend Documents

Iterative approximations for multivalued nonexpansive mappings in ...
Abstract. In this paper, we established the strong convergence of Browder type iteration {xt} for the multivalued nonexpansive nonself-mapping T satisfying the ...

Convergence of iterative algorithms for multivalued ...
A multivalued mapping T : K → 2E is called nonexpansive (respectively, contractive) ... Corresponding author. Tel.: +86 03733326149; fax: +86 03733326174.

Ishikawa Play
Autonomous Agents and Multiagent Systems (AAMAS 2013), Ito,. Jonker, Gini ..... call that Mann Iteration directly mixes its beliefs, xt, with a better response to them ..... Google Inter-University Center for Electronic Markets and Auc- tions. 7.

A Declarative Framework for Matching Iterative and ...
effective pattern matching in modern applications. A language for de- ..... “tick-shape” pattern is monitored for each company symbol over online stock events, see rules (1). ..... graphcq: Continuous dataflow processing for an uncertain world.

Mann-Whitney Test
Treatments. N. Mean Rank. Sum of Ranks. Treatment A (new hybrid). 2. 4.00. 8.00. Treatment B (current variety). 3. 2.33. 7.00. Total. 5. ShrubGirth. Mann-Whitney U. 1.000. Wilcoxon W. 7.000. Z. -1.155. Asymp. Sig. (2-tailed) .248. Exact Sig. [2*(1-ta

Monotonic iterative algorithm for minimum-entropy autofocus
m,n. |zmn|2 ln |zmn|2 + ln Ez. (3) where the minimum-entropy phase estimate is defined as. ˆφ = arg min .... aircraft with a nose-mounted phased-array antenna.

PERIODIC AND FIXED POINTS OF MULTIVALUED ...
smaller domains. We would like to remark that we find especially useful those ... X a closed subspace of Y ; and f : X → expk Y a continuous fixed-point free map.

Rasagiline formulations and processes for their preparation
Dec 5, 2006 - Webster dictionary, online version, www.merriam-webstercom/ dictionarv/carbon- I 3 .com”. ...... In addition, during the formulation development of the drug product, a special ... colloidal silicon diox ide, stearic acid or talc. 24.

Mann Whitney U.pdf
There was a problem previewing this document. Retrying... Download. Connect more apps... Try one of the apps below to open or edit this item. Mann Whitney ...

Iterative Data-based Modelling and Optimization for ...
factors that optimize the objective function. However, the .... ing the following likelihood function .... pre-selected basis functions (e.g. orthogonal polynomials.

On multiple solutions for multivalued elliptic equations ...
istence of multiple solutions for multivalued fourth order elliptic equations under Navier boundary conditions. Our main result extends similar ones known for the ...

Iterative methods
Nov 27, 2005 - For testing was used bash commands like this one: a=1000;time for i in 'seq ... Speed of other functions was very similar so it is not necessary to ...

ITERATIVE SYNCHRONISATION AND DC-OFFSET ...
number of channel taps (M), i.e. P ≥ M. The use of HOS and polynomial rooting was avoided in the TSS method pre- sented in [4], but required P ≥ 2M + 1.