Common Fixed Points of a New Three-Step Iteration with Errors of ...
Common Fixed Points of a New Three-Step Iteration with Errors of ...
Common Fixed Points of a New Three-Step Iteration with Errors of ...
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
173 U. Inprasit and H. Wattanataweekul / Journal <strong>of</strong> Nonlinear Analysis and Optimization 1 (2010) 169-182<br />
Since {l n }, {m n }, {u n }, {v n }, {w n } are bounded, there exists a constant K > 0 such that α n m n b n +<br />
β n ≤ K, γ n + α n m n c n + (α n m n b n l n + β n l n )a n ≤ K, (m n l n + l n )‖u n − q‖ ≤ K, m n ‖v n − q‖ ≤<br />
K, ‖w n − q‖ ≤ K and α n ≤ K for all n ≥ 1. Then<br />
(6)<br />
‖x n+1 − q‖ ≤<br />
(<br />
1 + K ( (k n − 1) + (l n − 1) + (m n − 1) )) ‖x n − q‖<br />
+ K(δ n + σ n + ρ n )<br />
By Lemma 1.1, we obtain lim<br />
n→∞<br />
‖x n − q‖ exists.<br />
Next, we want to prove (ii), (iii) and (iv). It follows from (i) that {x n − q}, {T 1 (PT 1 ) n−1 x n −<br />
q}, {y n − q}, {T 3 (PT 3 ) n−1 y n − q}, {z n − q} and {T 2 (PT 2 ) n−1 z n − q} are all bounded. Let<br />
{<br />
M = max<br />
sup<br />
n≥1<br />
sup<br />
n≥1<br />
sup<br />
n≥1<br />
‖x n − q‖, sup<br />
n≥1<br />
‖T 3 (PT 3 ) n−1 y n − q‖, sup<br />
n≥1<br />
‖T 2 (PT 2 ) n−1 z n − q‖, sup<br />
n≥1<br />
‖T 1 (PT 1 ) n−1 x n − q‖, sup ‖y n − q‖,<br />
n≥1<br />
‖z n − q‖, sup ‖u n − q‖,<br />
n≥1<br />
}<br />
‖v n − q‖, sup ‖w n − q‖<br />
n≥1<br />
By Lemma 1.3, there exists a continuous, strictly increasing convex function g : [0, ∞) → [0, ∞)<br />
<strong>with</strong> g(0) = 0 such that<br />
.<br />
(7)<br />
‖λx + µy + ξz + ϑw + ζs‖ 2 ≤ λ‖x‖ 2 + µ‖y‖ 2 + ξ‖z‖ 2 + ϑ‖w‖ 2 + ζ‖s‖ 2<br />
− λµg ( ‖x − y‖ )<br />
for all x, y, z, w, s ∈ B r and all λ, µ, ξ, ϑ, ζ ∈ [0, 1] <strong>with</strong> λ + µ + ξ + ϑ + ζ = 1. By (7), we have<br />
(8)<br />
‖z n − q‖ 2 = ‖P[a n T 1 (PT 1 ) n−1 x n + (1 − a n − δ n )x n + δ n u n ] − P(q)‖ 2<br />
≤ ‖a n (T 1 (PT 1 ) n−1 x n − q) + (1 − a n − δ n )(x n − q) + δ n (u n − q)‖ 2<br />
≤ a n ‖T 1 (PT 1 ) n−1 x n − q‖ 2 + (1 − a n − δ n )‖x n − q‖ 2<br />
+ δ n ‖u n − q‖ 2 − a n (1 − a n − δ n )g ( ‖T 1 (PT 1 ) n−1 x n − x n ‖ )<br />
≤ a n k 2 n‖x n − q‖ 2 + (1 − a n − δ n )‖x n − q‖ 2 + δ n ‖u n − q‖ 2<br />
− a n (1 − a n − δ n )g ( ‖T 1 (PT 1 ) n−1 x n − x n ‖ )<br />
≤ (1 + a n (k 2 n − 1) − δ n )‖x n − q‖ 2 + δ n ‖u n − q‖ 2<br />
and<br />
(9)<br />
‖y n − q‖ 2 = ‖P[b n T 2 (PT 2 ) n−1 z n + c n T 1 (PT 1 ) n−1 x n + (1 − b n − c n − σ n )<br />
x n + σ n v n ] − P(q)‖ 2<br />
≤ ‖b n (T 2 (PT 2 ) n−1 z n − q) + c n (T 1 (PT 1 ) n−1 x n − q)<br />
+ (1 − b n − c n − σ n )(x n − q) + σ n (x n − q)‖ 2<br />
≤ b n ‖T 2 (PT 2 ) n−1 z n − q‖ 2 + (1 − b n − c n − σ n )‖x n − q‖ 2<br />
+ c n ‖T 1 (PT 1 ) n−1 x n − q‖ 2 + σ n ‖v n − q‖ 2<br />
− b n (1 − b n − c n − σ n )g ( ‖T 2 (PT 2 ) n−1 z n − x n ‖ )<br />
≤ b n l 2 n‖z n − q‖ 2 + (1 − b n − c n − σ n )‖x n − q‖ 2 + c n k 2 n‖x n − q‖ 2<br />
+ σ n ‖v n − q‖ 2 − b n (1 − b n − c n − σ n )g ( ‖T 2 (PT 2 ) n−1 z n − x n ‖ )