Skip to main content

Iterative algorithms with errors for zero points of m-accretive operators

Abstract

In this paper, we study the convergence of paths for continuous pseudocontractions in a real Banach space. As an application, we consider the problem of finding zeros of m-accretive operators based on an iterative algorithm with errors. Strong convergence theorems for zeros of m-accretive operators are established in a real Banach space.

MSC:47H05, 47H09, 47J25, 65J15.

1 Introduction and preliminaries

Let C be a nonempty closed convex subset of a real Banach space E and let E ∗ be the dual space of E. Let 〈⋅,⋅〉 denote the pairing between E and E ∗ . The normalized duality mapping J:E→ 2 E ∗ is defined by

J(x)= { f ∈ E ∗ : 〈 x , f 〉 = ∥ x ∥ 2 = ∥ f ∥ 2 }

for all x∈E. In the sequel, we use j to denote the single-valued normalized duality mapping. Let U E ={x∈E:∥x∥=1}. E is said to be smooth or is said to have a Gâteaux differentiable norm if the limit

lim t → 0 ∥ x + t y ∥ − ∥ x ∥ t

exists for each x,y∈ U E . E is said to have a uniformly Gâteaux differentiable norm if for each y∈ U E , the limit is attained uniformly for all x∈ U E . E is said to be uniformly smooth or is said to have a uniformly Fréchet differentiable norm if the limit is attained uniformly for x,y∈ U E . It is known that if the norm of E is uniformly Gâteaux differentiable, then the duality mapping J is single-valued and uniformly norm to weak∗ continuous on each bounded subset of E.

Recall that a closed convex subset C of a Banach space E is said to have a normal structure if for each bounded closed convex subset K of C which contains at least two points, there exists an element x of K which is not a diametral point of K, i.e.,

sup { ∥ x − y ∥ : y ∈ K } <d(K),

where d(K) is the diameter of K. It is well known that a closed convex subset of a uniformly convex Banach space has the normal structure and a compact convex subset of a Banach space has the normal structure; see [1] for more details.

Let T:C→C be a nonlinear mapping. In this paper, we use F(T) to denote the set of fixed points of T. Recall that T is said to be contractive if there exits a constant α∈(0,1) such that

∥Tx−Ty∥≤α∥x−y∥,∀x,y∈C.

For such a case, we also call T an α-contraction. T is said to be a strong contraction if there exits a constant α∈(0,1) and some j(x−y)∈J(x−y) such that

〈 T x − T y , j ( x − y ) 〉 ≤α ∥ x − y ∥ 2 ,∀x,y∈C.

For such a case, we also call T an α-strong pseudocontraction. T is said to be nonexpansive if

∥Tx−Ty∥≤∥x−y∥,∀x,y∈C.

T is said to be pseudocontractive if there exists some j(x−y)∈J(x−y) such that

〈 T x − T y , j ( x − y ) 〉 ≤ ∥ x − y ∥ 2 ,∀x,y∈C.

For the class of nonexpansive mappings, one classical way to study nonexpansive mappings is to use contractions to approximate a nonexpansive mapping [2, 3]. More precisely, take t∈(0,1) and define a contraction T t :C→C by

T t x=tu+(1−t)Tx,∀x∈C,

where u∈C is a fixed point. Banach’s contraction mapping principle guarantees that T t has a unique fixed point x t in C. That is,

x t =tu+(1−t)T x t .

In the case that T enjoys a fixed point, Browder [2] proved that if E is a Hilbert space, then x t converges strongly to a fixed point of T. Reich [3] extended Browder’s result to the setting of Banach spaces and proved that if E is a uniformly smooth Banach space, then x t converges strongly to a fixed point of T.

Let D be a nonempty subset of C. Let Q:C→D. Q is said to be contraction if Q 2 =Q; sunny if for each x∈C and t∈(0,1), we have Q(tx+(1−t)Qx)=Qx; sunny nonexpansive retraction if Q is sunny, nonexpansive, and contraction. K is said to be a nonexpansive retract of C if there exists a nonexpansive retraction from C onto D.

The following result, which was established in [4, 5], describes a characterization of sunny nonexpansive retractions on a smooth Banach space.

Let E be a smooth Banach space and let C be a nonempty subset of E. Let Q:E→C be a retraction and let j be the normalized duality mapping on E. Then the following are equivalent:

  1. (1)

    Q is sunny and nonexpansive;

  2. (2)

    ∥ Q x − Q y ∥ 2 ≤〈x−y,j(Qx−Qy)〉, ∀x,y∈E;

  3. (3)

    〈x−Qx,j(y−Qx)〉≤0, ∀x∈E, y∈C.

Recently, Xu [6] improved Reich’s results by considering the viscosity approximation method which was first introduced by Moudafi [7]. To be more precise, he studied the following continuous scheme:

where f is an α-contraction and T is a nonexpansive mapping. He showed that the sequence { x t } converges strongly to a point in F(T) in a uniformly smooth Banach space. If one defines Q: Π C →F(T), where Π C denotes the set of α-contractions, by

Q(f):= lim t → ∞ x t ,

then Q(f) solves the following variational inequality:

〈 ( I − f ) Q ( f ) , j ( Q ( f ) − p ) 〉 ≤0,∀p∈F(T).

The questions that naturally arise in connection with Xu’s results are as follows.

  1. (1)

    Can one extend the framework of the space from uniformly smooth Banach spaces to a more general Banach space?

  2. (2)

    Can one extend the viscosity approximation method by considering strong pseudocontractions instead of contractions?

  3. (3)

    Do Xu’s results still hold for a larger class of nonlinear mappings?

In Section 2, we give an affirmative answer to the above questions.

Let I denote the identity operator on E. An operator A⊂E×E with domain D(A)={z∈E:Az≠∅} and range R(A)=⋃{Az:z∈D(A)} is said to be accretive if for each x i ∈D(A) and y i ∈A x i , i=1,2, there exists j( x 1 − x 2 )∈J( x 1 − x 2 ) such that

〈 y 1 − y 2 , j ( x 1 − x 2 ) 〉 ≥0.

An accretive operator A is said to be m-accretive if R(I+rA)=E for all r>0. In a real Hilbert space, an operator A is m-accretive if and only if A is maximal monotone. In this paper, we use A − 1 (0) to denote the set of zeros of A. Interest in accretive operators, which is an important class of nonlinear operators, stems mainly from their firm connection with equations of evolution. It is known that many physically significant problems can be modeled by initial value problems of the form

x ′ (t)+Ax(t)=0,x(0)= x 0 ,
(1.1)

where A is an accretive operator in an appropriate Banach space. Typical examples where such evolution equations occur can be found in the heat, wave or Schrödinger equations. If x(t) is dependent on t, then (1.1) is reduced to

Au=0,
(1.2)

whose solutions correspond to the equilibrium points of the system (1.1). Consequently, considerable research efforts have been devoted, especially within the past 40 years or so, to methods for finding approximate solutions (when they exist) of equation (1.2). An early fundamental result in the theory of accretive operators, due to Browder [8], states that the initial value problem (1.1) is solvable if A is locally Lipschitz and accretive on E.

For an accretive operator A, we can define a nonexpansive single-valued mapping J r :R(I+rA)→D(A) by J r = ( I + r A ) − 1 for each r>0, which is called the resolvent of A.

One of classical methods for studying the problem 0∈Ax, where A⊂E×E is an accretive operator, is the following:

x 0 ∈E, x n + 1 = J r n x n ,∀n≥0,

where J r n = ( I + r n A ) − 1 and { r n } is a sequence of positive real numbers.

As we know, many well-known problems arising in various branches of science can be studied by using algorithms which are iterative in their nature. As an example, in computer tomography with limited data, each piece of information implies the existence of a convex set in which the required solution lies. The problem of finding a point in the intersection of the sets is then of crucial interest, and it cannot be usually solved directly. Therefore, an iterative algorithm must be used to approximate such a point.

Recall that the normal Mann iterative process was introduced by Mann [9] in 1953. The normal Mann iterative process generates a sequence { x n } in the following manner:

where { α n } is a sequence in the interval (0,1). If T is a nonexpansive mapping with a fixed point and the control sequence { α n } is chosen so that ∑ n = 1 ∞ α n (1− α n )=∞, then the sequence { x n } generated in the normal Mann iterative process converges weakly to a fixed point of T. In an infinite-dimensional Hilbert space, the normal Mann iteration process has only weak convergence, in general, even for nonexpansive mappings. Therefore, many authors try to modify the normal Mann iterative process to have strong convergence for nonexpansive mappings; see, e.g., [10–24] and the references therein.

Recently, Qin and Su [18] studied the problem of modifying the normal Mann iterative process to have strong convergence for m-accretive operators. To be more precise, they considered the following iterative process:

where u is a fixed element in C and J r n = ( I + r n A ) − 1 . They proved that the sequence { x n } generated in the above iterative process converges strongly to a zero of A.

In this paper, we study the convergence of paths for continuous pseudocontractions in a real Banach space by viscosity approximation methods. As applications, we consider the problem of finding zeros of m-accretive operators based on an iterative process with errors. Strong convergence theorems of zeros are established in a real Banach space.

In order to prove our main results, we also need the following lemmas.

Lemma 1.1 [25]

Let { a n }, { b n }, and { c n } be three nonnegative real sequences satisfying

a n + 1 ≤(1− t n ) a n + b n + c n ,∀n≥0,

where { t n } is a sequence in (0,1). Assume that the following conditions are satisfied:

  1. (a)

    ∑ n = 0 ∞ t n =∞ and b n =o( t n );

  2. (b)

    ∑ n = 0 ∞ c n <∞.

Then lim n → ∞ a n =0.

Lemma 1.2 [26]

Let C be a nonempty, bounded, closed, and convex subset of a reflexive Banach space E which also has the normal structure. Let T be a nonexpansive mapping of C into itself. Then F(T) is nonempty.

Lemma 1.3 [27]

Let C be a nonempty, closed, and convex subset of a Banach space E, and let T:C→C be a continuous and strong pseudocontraction. Then T has a unique fixed point in C.

Lemma 1.4 [28]

In a Banach space E, there holds the inequality

∥ x + y ∥ 2 ≤ ∥ x ∥ 2 +2 〈 y , j ( x + y ) 〉 ,∀x,y∈E,

where j(x+y)∈J(x+y).

Set A=(0,1), let B(A) denote the Banach space of all bounded real-valued functions on A with a supremum norm and let X be a subspace of B(A).

Lemma 1.5 [1]

Let C be a nonempty, closed, and convex subset of a Banach space E. Suppose that the norm of E is uniformly Gâteaux differentiable. Let { x t } be a bounded set in E, and z∈C. Let μ t be a mean on X. Then μ t ∥ x t − z ∥ 2 = min y ∈ C ∥ x t −y∥ if and only if μ t 〈y−z, x t −z〉≤0 for all y∈C.

Lemma 1.6 [29]

Let E be a Banach space and let A be an m-accretive operator. For λ>0, μ>0, and x∈E, we have

J λ x= J μ ( μ λ x + ( 1 − μ λ ) J λ x ) ,

where J λ = ( I + λ A ) − 1 and J μ = ( I + μ A ) − 1 .

Lemma 1.7 [30]

Let { x n } and { y n } be bounded sequences in a Banach space E, and let { β n } be a sequence in (0,1) with

0< lim inf n → ∞ β n ≤ lim sup n → ∞ β n <1.

Suppose that x n + 1 =(1− β n ) y n + β n x n , ∀n≥1 and

lim sup n → ∞ ( ∥ y n + 1 − y n ∥ − ∥ x n + 1 − x n ∥ ) ≤0.

Then lim n → ∞ ∥ y n − x n ∥=0.

2 Main results

Now, we are in a position to prove the strong convergence of paths for continuous pseudocontractions.

Theorem 2.1 Let E be a real reflexive Banach space with the uniformly Gâteaux differentiable norm and the normal structure, and let C be a nonempty closed convex subset of E. Let T:C→C be a continuous pseudocontraction with a fixed point, and let f:C→C be a fixed continuous bounded and strong pseudocontraction with the coefficient α∈(0,1). Let { x t } be a sequence generated by the following:

x t =tf( x t )+(1−t)T x t ,
(2.1)

where t∈(0,1). Then { x t } converges strongly as t→0 to a fixed point x ∗ of T, which is the unique solution in F(T) to the following variational inequality:

〈 f ( x ∗ ) − x ∗ , j ( x ∗ − p ) 〉 ≥0,∀p∈F(T).

Proof For t∈(0,1), define a mapping T t f :C→C by

T t f x=tf(x)+(1−t)Tx.

Then T t f :C→C is a continuous, strong pseudocontraction for each t∈(0,1). Indeed, we have

〈 T t f x − T t f y , j ( x − y ) 〉 = t 〈 f ( x ) − f ( y ) , j ( x − y ) 〉 + ( 1 − t ) 〈 T x − T y , j ( x − y ) 〉 ≤ t α ∥ x − y ∥ 2 + ( 1 − t ) ∥ x − y ∥ 2 = ( 1 − t ( 1 − α ) ) ∥ x − y ∥ 2 , ∀ x , y ∈ C .

In view of Lemma 1.3, we see that T t f has a unique fixed point x t in C for each t∈(0,1). Hence (2.1) is well defined. Next, we show that { x t } is bounded. For any p∈F(T) and t∈(0,1), we see that

∥ x t − p ∥ 2 = 〈 x t − p , j ( x t − p ) 〉 = t 〈 f ( x t ) − p , j ( x t − p ) 〉 + ( 1 − t ) 〈 T x t − p , j ( x t − p ) 〉 = t 〈 f ( x t ) − f ( p ) , j ( x t − p ) 〉 + t 〈 f ( p ) − p , j ( x t − p ) 〉 + ( 1 − t ) 〈 T x t − p , j ( x t − p ) 〉 ≤ t α ∥ x t − p ∥ 2 + t 〈 f ( p ) − p , j ( x t − p ) 〉 + ( 1 − t ) ∥ x t − p ∥ 2 ≤ ( 1 − t ( 1 − α ) ) ∥ x t − p ∥ 2 + t 〈 f ( p ) − p , j ( x t − p ) 〉 ,

which implies that

∥ x t − p ∥ 2 ≤ 1 1 − α 〈 f ( p ) − p , j ( x t − p ) 〉 .
(2.2)

It follows that

∥ x t −p∥≤ 1 1 − α ∥ f ( p ) − p ∥ .
(2.3)

This shows that { x t } is bounded, so is {T x t }. On the other hand, we see from (2.1) that

x t −T x t =t ( f ( x t ) − T x t ) .

Since f and { x t } are bounded, we obtain that f( x t ) is bounded. It follows that

lim t → 0 ∥ x t −T x t ∥=0.
(2.4)

Define g(x)= μ t ∥ x t − x ∥ 2 , ∀x∈C, where μ t is a Banach limit. Then g(x) is continuous, convex and g(x)→∞ as ∥x∥→∞. We see that g attains its infinimum over C (see, e.g., [1]). Set

D= { x ∈ C : g ( x ) = inf y ∈ C g ( y ) } .

Then D is a nonempty bounded closed convex subset of C. Next, we show that there exits a point x ∗ ∈D such that T x ∗ = x ∗ .

Indeed, for any y∈C, define a mapping S:C→C by

Sx= 1 2 y+ 1 2 Tx,∀x∈C.

It is easy to see that S is a continuous strong pseudocontraction. From Lemma 1.3, we see that S has a unique fixed point x in C, that is, x= 1 2 y+ 1 2 Tx. This implies that

y=(2I−T)x∈(2I−T)(C).

This shows that C⊆(2I−T)(C). Define another mapping h:C→C by

h(x)= ( 2 I − T ) − 1 x,∀x∈C.

We see that h is a nonexpansive mapping. Indeed, we have

∥ h ( x ) − h ( y ) ∥ = ∥ ( 2 I − T ) − 1 x − ( 2 I − T ) − 1 y ∥ ≤ ∥ ( I + ( I − T ) ) − 1 x − ( I + ( I − T ) ) − 1 y ∥ ≤ ∥ x − y ∥ , ∀ x , y ∈ C .

We also see that F(h)=F(T). Indeed,

x=h(x)⟺2x−Tx=x⟺x=Tx.

On the other hand, we have

∥ x − h ( x ) ∥ = ∥ h h − 1 ( x ) − h ( x ) ∥ ≤ ∥ h − 1 ( x ) − x ∥ = ∥ ( 2 I − T ) ( x ) − x ∥ = ∥ x − T x ∥ .

It follows from (2.4) that

lim t → 0 ∥ x t − h ( x t ) ∥ =0.

Fixing x∈D, we have

g ( h ( x ) ) = μ t ∥ x t − h ( x ) ∥ 2 = μ t ∥ h ( x t ) − h ( x ) ∥ 2 ≤ μ t ∥ x t − x ∥ 2 = g ( x ) .

This implies that h(x)∈D, that is, h(D)⊆D. Since C is a nonempty closed convex subset of E which has the normal structure, we see that h has a fixed point. We denote it by x ∗ . It follows from F(h)=F(T) that T x ∗ = x ∗ . From Lemma 1.5, we see that

μ t 〈 p − x ∗ , j ( x t − x ∗ ) 〉 ≤0,∀p∈C.

In particular, we have

μ t 〈 f ( x ∗ ) − x ∗ , j ( x t − x ∗ ) 〉 ≤0.
(2.5)

In view of (2.2), we arrive at

μ t ∥ x t − x ∗ ∥ 2 ≤0.

This implies that there exists a subnet { x t α } of { x t } such that x t α → x ∗ .

On the other hand, we have

x t −f( x t )=(1−t) ( T x t − f ( x t ) ) .

For any p∈F(T), we see that

〈 x t − f ( x t ) , j ( x t − p ) 〉 = ( 1 − t ) 〈 T x t − f ( x t ) , j ( x t − p ) 〉 = ( 1 − t ) 〈 T x t − x t , j ( x t − p ) 〉 + ( 1 − t ) 〈 x t − f ( x t ) , j ( x t − p ) 〉 = ( 1 − t ) 〈 T x t − p , j ( x t − p ) 〉 + ( 1 − t ) 〈 p − x t , j ( x t − p ) 〉 + ( 1 − t ) 〈 x t − f ( x t ) , j ( x t − p ) 〉 ≤ ( 1 − t ) 〈 x t − f ( x t ) , j ( x t − p ) 〉 ,

which implies that

〈 x t − f ( x t ) , j ( x t − p ) 〉 ≤0,∀p∈F(T).
(2.6)

In particular, we have

〈 x t α − f ( x t α ) , j ( x t α − p ) 〉 ≤0,∀p∈F(T).
(2.7)

It follows that

〈 x ∗ − f ( x ∗ ) , j ( x ∗ − p ) 〉 ≤0,∀p∈F(T).
(2.8)

If there exits another subnet { x t β } of { x t } such that x t β → x ∗ ∗ ∈F(T). From (2.8), we arrive at

〈 x ∗ − f ( x ∗ ) , j ( x ∗ − x ∗ ∗ ) 〉 ≤0.
(2.9)

It also follows from (2.6) that

〈 x t β − f ( x t β ) , j ( x t β − x ∗ ) 〉 ≤0.
(2.10)

It follows that

〈 x ∗ ∗ − f ( x ∗ ∗ ) , j ( x ∗ ∗ − x ∗ ) 〉 ≤0.
(2.11)

Adding up (2.9) and (2.11), we obtain that

〈 x ∗ − f ( x ∗ ) − x ∗ ∗ + f ( x ∗ ∗ ) , j ( x ∗ − x ∗ ∗ ) 〉 ≤0.

This implies that

∥ x ∗ − x ∗ ∗ ∥ 2 ≤α ∥ x ∗ − x ∗ ∗ ∥ 2 .

Note that α∈(0,1). We see that x ∗ = x ∗ ∗ . This shows that { x t } converges strongly to x ∗ ∈F(T), which is the unique solution to the variational inequality

〈 ( f − I ) x ∗ , p − x ∗ 〉 ≤0,∀p∈F(T).

This completes the proof. □

Remark 2.2 Note that uniformly smooth Banach spaces enjoy the uniformly Gâteaux differentiable norm and the uniform normal structure. Theorem 2.1, which gives an affirmative answer to the questions presented in Section 1, improves Theorem 4.1 of Xu [6] in the following aspects:

  1. (1)

    improves the framework of spaces from uniformly smooth Banach spaces to the Banach space with the uniformly Gâteaux differentiable norm;

  2. (2)

    improves the mapping f from the class of contractions to the class of strongly pseudocontractions;

  3. (3)

    improves the mapping T from the class of nonexpansive mappings to the class of pseudocontractions.

Remark 2.3 Under the conditions of Theorem 2.1, we can define a mapping Q: Π C →F(T), where Π C denotes the set of continuous bounded and strong pseudocontractions, by

Q(f):= lim t → 0 x t ,f∈ Π C .

It is not hard to see that Q is a sunny nonexpansive retraction from Π C onto F(T).

Remark 2.4 If T is a nonexpansive mapping and f(x)=u, a fixed element for every x∈C in Theorem 2.1, then { x t } defined by

x t =tu+(1−t)T x t ,

where t∈(0,1), converges strongly as t→0 to a fixed point Q(u) of T, where Q is the sunny nonexpansive retraction from C onto F(T). The point Q(u) is the unique solution in F(T) to the following variational inequality:

〈 u − Q ( u ) , j ( Q ( u ) − p ) 〉 ≥0,∀p∈F(T).

Next, we prove strong convergence of iterative processes with errors for m-accretive operators.

Theorem 2.5 Let E be a real reflexive Banach space with the uniformly Gâteaux differentiable norm and let A be an m-accretive operator in E. Assume that C:= D ( A ) ¯ is convex and has the normal structure. Let { α n }, { β n }, { γ n }, and { δ n } be real number sequences in (0,1). Let Q C be a sunny nonexpansive retraction from E onto C and let { x n } be a sequence generated in the following manner:

where { e n } is a sequence in E, { f n } is a bounded sequence in E, { r n } is a positive real numbers sequence, u is a fixed element in C and J r n = ( I + r n A ) − 1 . Assume that A − 1 (0)≠∅ and the above control sequences satisfy the following restrictions:

  1. (a)

    β n + γ n + δ n =1 for each n≥0;

  2. (b)

    lim n → ∞ α n =0 and ∑ n = 1 ∞ α n =∞;

  3. (c)

    0< lim inf n → ∞ β n ≤ lim sup n → ∞ β n <1;

  4. (d)

    ∑ n = 1 ∞ ∥ e n ∥<∞ and ∑ n = 0 ∞ δ n <∞;

  5. (e)

    r n ≥ϵ for each n≥1 and lim n → ∞ | r n − r n + 1 |=0.

Then the sequence { x n } generated by (Δ) converges strongly to a zero Q(u) of A, which is the unique solution to the following variational inequality:

〈 ( f − I ) Q ( u ) , p − Q ( u ) 〉 ≤0,∀p∈ A − 1 (0).

Proof First, we prove that { x n } is bounded. Fixing p∈ A − 1 (0), we see that

∥ x 1 − p ∥ = ∥ α 0 ( u − p ) + ( 1 − α 0 ) ( y 0 − p ) ∥ ≤ α 0 ∥ u − p ∥ + ( 1 − α 0 ) ∥ y 0 − p ∥ = α 0 ∥ u − p ∥ + ( 1 − α 0 ) ( ∥ β 0 ( x 0 − p ) + γ 0 ( J r 0 ( x 0 + e 1 ) − p ) + δ 0 ( Q C f 0 − p ) ∥ ) ≤ α 0 ∥ u − p ∥ + ( 1 − α 0 ) ( β 0 ∥ x 0 − p ∥ + γ 0 ∥ J r 0 ( x 0 + e 1 ) − p ∥ + δ 0 ∥ f 0 − p ∥ ) ≤ α 0 ∥ u − p ∥ + ( 1 − α 0 ) ( ( 1 − δ 0 ) ∥ x 0 − p ∥ + ∥ e 1 ∥ + δ 0 ∥ f 0 − p ∥ ) ≤ K ,

where K=∥u−p∥+∥ x 0 −p∥+∥ e 1 ∥+∥ f 0 −p∥<∞. Put

M 1 =max { K , sup n ≥ 0 ∥ f n − p ∥ } .

Next, we prove that

∥ x n −p∥≤ M 1 + ∑ i = 1 n ∥ e i ∥,∀n≥1.
(2.12)

It is easy to see that (2.12) holds for n=1. We assume that the result holds for some n. It follows that

∥ x n + 1 − p ∥ ≤ α n ∥ u − p ∥ + ( 1 − α n ) ∥ y n − p ∥ = α n ∥ u − p ∥ + ( 1 − α n ) ( ∥ β n ( x n − p ) + γ n ( J r n ( x n + e n + 1 ) − p ) + δ n ( Q C f n − p ) ∥ ) ≤ α n ∥ u − p ∥ + ( 1 − α n ) ( β n ∥ x n − p ∥ + γ n ∥ J r n ( x n + e n + 1 ) − p ∥ + δ n ∥ f n − p ∥ ) ≤ α n ∥ u − p ∥ + ( 1 − α n ) ( ( 1 − δ n ) ∥ x n − p ∥ + ∥ e n + 1 ∥ + δ n ∥ f n − p ∥ ) ≤ α n M 1 + ( 1 − α n ) ( ( 1 − δ n ) ( M 1 + ∑ i = 1 n ∥ e i ∥ ) + ∥ e n + 1 ∥ + δ n M 1 ) = M 1 + ∑ i = 1 n + 1 ∥ e i ∥ .

This shows that (2.12) holds for all n≥1. If r n + 1 ≥ r n , we see from Lemma 1.6 that

∥ J r n ( x n + e n + 1 ) − J r n + 1 ( x n + 1 + e n + 2 ) ∥ ≤ ∥ r n r n + 1 ( x n + e n + 1 ) + ( 1 − r n r n + 1 ) J r n + 1 ( x n + e n + 1 ) − ( x n + 1 + e n + 2 ) ∥ = ∥ r n r n + 1 ( ( x n + e n + 1 ) − ( x n + 1 + e n + 2 ) ) + r n + 1 − r n r n + 1 ( J r n + 1 ( x n + e n + 1 ) − ( x n + 1 + e n + 2 ) ) ∥ ≤ ∥ x n − x n + 1 ∥ + ∥ e n + 1 ∥ + ∥ e n + 2 ∥ + M 2 ϵ ( r n + 1 − r n ) ,
(2.13)

where M 2 is an appropriate constant such that

M 2 ≥ sup n ≥ 1 { ∥ J r n + 1 ( x n + e n + 1 ) − ( x n + 1 + e n + 2 ) ∥ } .

Put g n = x n + 1 − β n x n 1 − β n . This implies that

x n + 1 =(1− β n ) g n + β n x n ,n≥0.
(2.14)

Now, we compute ∥ g n + 1 − g n ∥. Note that

g n + 1 − g n = α n + 1 u + ( 1 − α n + 1 ) y n + 1 − β n + 1 x n + 1 1 − β n + 1 − α n u + ( 1 − α n ) y n − β n x n 1 − β n = α n + 1 ( u − y n + 1 ) + γ n + 1 J r n + 1 ( x n + 1 + e n + 2 ) + δ n + 1 Q C f n + 1 1 − β n + 1 − α n ( u − y n ) + γ n J r n ( x n + e n + 1 ) + δ n Q C f n 1 − β n = α n + 1 ( u − y n + 1 ) + δ n + 1 ( Q C f n + 1 − J r n + 1 ( x n + 1 + e n + 2 ) ) 1 − β n + 1 − α n ( u − y n ) + δ n ( Q C f n − J r n ( x n + e n + 1 ) ) 1 − β n + J r n + 1 ( x n + 1 + e n + 2 ) − J r n ( x n + e n + 1 ) .
(2.15)

It follows that

∥ g n + 1 − g n ∥ ≤ α n + 1 1 − β n + 1 ∥ u − y n + 1 ∥ + α n 1 − β n ∥ y n − u ∥ + ∥ δ n + 1 1 − β n + 1 ( Q C f n + 1 − J r n + 1 ( x n + 1 + e n + 2 ) ) − δ n 1 − β n ( Q C f n − J r n ( x n + e n + 1 ) ) ∥ + ∥ J r n + 1 ( x n + 1 + e n + 2 ) − J r n ( x n + e n + 1 ) ∥ ≤ α n + 1 1 − β n + 1 ∥ u − y n + 1 ∥ + α n 1 − β n ∥ y n − u ∥ + δ n + 1 1 − β n + 1 ∥ Q C f n + 1 − J r n + 1 ( x n + 1 + e n + 2 ) ∥ + δ n 1 − β n ∥ Q C f n − J r n ( x n + e n + 1 ) ∥ + ∥ J r n + 1 ( x n + 1 + e n + 2 ) − J r n ( x n + e n + 1 ) ∥ .
(2.16)

Substituting (2.13) into (2.16), we arrive at

∥ g n + 1 − g n ∥ − ∥ x n − x n + 1 ∥ ≤ α n + 1 1 − β n + 1 ∥ u − y n + 1 ∥ + α n 1 − β n ∥ y n − u ∥ + ∥ e n + 1 ∥ + ∥ e n + 2 ∥ + M 2 ϵ | r n + 1 − r n | + α n 1 − β n ∥ y n − u ∥ + δ n + 1 1 − β n + 1 ∥ Q C f n + 1 − J r n + 1 ( x n + 1 + e n + 2 ) ∥ + δ n 1 − β n ∥ Q C f n − J r n ( x n + e n + 1 ) ∥ .
(2.17)

In a similar way, we can obtain (2.17) when r n ≥ r n + 1 . From the conditions (b)-(e), we see that

lim sup n → ∞ ( ∥ g n + 1 − g n ∥ − ∥ x n − x n + 1 ∥ ) ≤0.

It follows from Lemma 1.7 that

lim n → ∞ ∥ g n − x n ∥=0.
(2.18)

In view of (2.14), we have

x n + 1 − x n =(1− β n )( g n − x n ),

which combines with the condition (c) and (2.18) gives that

lim n → ∞ ∥ x n + 1 − x n ∥=0.
(2.19)

On the other hand, we see from the algorithm (Δ) that

∥ x n − J r n ( x n + e n + 1 ) ∥ ≤ ∥ x n − x n + 1 ∥ + ∥ x n + 1 − y n ∥ + ∥ y n − J r n ( x n + e n + 1 ) ∥ ≤ ∥ x n − x n + 1 ∥ + α n ∥ u − y n ∥ + β n ∥ x n − J r n ( x n + e n + 1 ) ∥ + δ n ∥ Q C f n − x n ∥ .

This implies that

(1− β n ) ∥ x n − J r n ( x n + e n + 1 ) ∥ ≤∥ x n − x n + 1 ∥+ α n ∥u− y n ∥+ δ n ∥ Q C f n − x n ∥.

From the conditions (b)-(d) and (2.19), we conclude that

lim n → ∞ ∥ x n − J r n ( x n + e n + 1 ) ∥ =0.
(2.20)

Since ∑ n = 1 ∞ ∥ e n ∥<∞, we see that

lim n → ∞ ∥ x n − J r n x n ∥=0.
(2.21)

Take a fixed number r such that ϵ>r>0. From Lemma 1.6, we obtain that

∥ J r n x n − J r x n ∥ = ∥ J r ( r r n x n + ( 1 − r r n ) J r n x n ) − J r x n ∥ ≤ ∥ ( 1 − r r n ) ( J r n x n − x n ) ∥ ≤ ∥ J r n x n − x n ∥ .
(2.22)

Note that

∥ x n − J r x n ∥ = ∥ x n − J r n x n + J r n x n − J r x n ∥ ≤ ∥ x n − J r n x n ∥ + ∥ J r n x n − J r x n ∥ ≤ 2 ∥ x n − J r n x n ∥ .

From (2.21), we see that

lim n → ∞ ∥ x n − J r x n ∥=0.
(2.23)

Next, we claim that

lim sup n → ∞ 〈 u − Q ( u ) , j ( x n − Q ( u ) ) 〉 ≤0,
(2.24)

where

Qu= lim t → 0 z t ,u∈C

and z t solves the fixed point equation

z t =tu+(1−t) J r z t ,∀t∈(0,1),

from which it follows that

∥ z t − x n ∥= ∥ ( 1 − t ) ( J r z t − x n ) + t ( u − x n ) ∥ .

For any t∈(0,1), we see that

∥ z t − x n ∥ 2 = ( 1 − t ) 〈 J r z t − x n , j ( z t − x n ) 〉 + t 〈 u − x n , j ( z t − x n ) 〉 = ( 1 − t ) ( 〈 J r z t − J r x n , j ( z t − x n ) 〉 + 〈 J r x n − x n , j ( z t − x n ) 〉 ) + t 〈 u − z t , j ( z t − x n ) 〉 + t 〈 z t − x n , j ( z t − x n ) 〉 ≤ ( 1 − t ) ( ∥ z t − x n ∥ 2 + ∥ J r x n − x n ∥ ∥ z t − x n ∥ ) + t 〈 u − z t , j ( z t − x n ) 〉 + t ∥ z t − x n ∥ 2 ≤ ∥ z t − x n ∥ 2 + ∥ J r x n − x n ∥ ∥ z t − x n ∥ + t 〈 u − z t , j ( z t − x n ) 〉 .

It follows that

〈 z t − u , j ( z t − x n ) 〉 ≤ 1 t ∥ J r x n − x n ∥∥ z t − x n ∥,∀t∈(0,1).

In view of (2.23), we see that

lim sup n → ∞ 〈 z t − u , j ( z t − x n ) 〉 ≤0.
(2.25)

Since z t →Q(u) as t→0 and the fact that j is strong to weak∗ uniformly continuous on bounded subsets of E, we see that

| 〈 u − Q ( u ) , j ( x n − Q ( u ) ) 〉 − 〈 z t − u , j ( z t − x n ) 〉 | ≤ | 〈 u − Q ( u ) , j ( x n − Q ( u ) ) 〉 − 〈 u − Q ( u ) , j ( x n − z t ) 〉 | + | 〈 u − Q ( u ) , j ( x n − z t ) 〉 − 〈 z t − u , j ( z t − x n ) 〉 | ≤ | 〈 u − Q ( u ) , j ( x n − Q ( u ) ) − j ( x n − z t ) 〉 | + | 〈 z t − Q ( u ) , J ( x n − z t ) 〉 | ≤ ∥ u − Q ( u ) ∥ ∥ j ( x n − Q ( u ) ) − j ( x n − z t ) ∥ + ∥ z t − Q ( u ) ∥ ∥ x n − z t ∥ → 0 as  t → 0 .

Hence, for any ϵ>0, there exists δ>0 such that ∀t∈(0,δ) the following inequality holds:

〈 u − Q ( u ) , j ( x n − Q ( u ) ) 〉 ≤ 〈 z t − u , j ( z t − x n ) 〉 +ϵ.

This implies that

lim sup n → ∞ 〈 u − Q ( u ) , j ( x n − Q ( u ) ) 〉 ≤ lim sup n → ∞ 〈 z t − u , j ( z t − x n ) 〉 +ϵ.

Since ϵ is arbitrary and (2.25), we see that lim sup n → ∞ 〈u−Q(u),j( x n −Q(u))〉≤0. That is,

lim sup n → ∞ 〈 u − Q ( u ) , j ( x n + 1 − Q ( u ) ) 〉 ≤0.
(2.26)

Finally, we show that x n →Q(u) as n→∞. Note that

∥ y n − Q ( u ) ∥ = ∥ β n x n + γ n J r n ( x n + e n + 1 ) + δ n Q C f n − Q ( u ) ∥ ≤ β n ∥ x n − Q ( u ) ∥ + γ n ∥ J r n ( x n + e n + 1 ) − Q ( u ) ∥ + δ n ∥ Q C f n − Q ( u ) ∥ ≤ ( β n + γ n ) ∥ x n − Q ( u ) ∥ + ∥ e n + 1 ∥ + δ n ∥ f n − Q ( u ) ∥ ≤ ∥ x n − Q ( u ) ∥ + η n ,

where η n =∥ e n + 1 ∥+ δ n M 1 . From the condition (d), we see that ∑ n = 0 ∞ η n <∞. It follows from Lemma 1.5 that

∥ x n + 1 − Q ( u ) ∥ 2 = ∥ ( 1 − α n ) ( y n − Q ( u ) ) + α n ( u − Q ( u ) ) ∥ 2 ≤ ( 1 − α n ) 2 ∥ y n − Q ( u ) ∥ 2 + 2 α n 〈 u − Q ( u ) , J ( x n + 1 − Q ( u ) ) 〉 ≤ ( 1 − α n ) ( ∥ x n − Q ( u ) ∥ + η n ) 2 + 2 α n 〈 u − Q ( u ) , J ( x n + 1 − Q ( u ) ) 〉 = ( 1 − α n ) ( ∥ x n − Q ( u ) ∥ 2 + 2 η n ∥ x n − Q ( u ) ∥ + η n 2 ) + 2 α n 〈 u − Q ( u ) , J ( x n + 1 − Q ( u ) ) 〉 ≤ ( 1 − α n ) ∥ x n − Q ( u ) ∥ 2 + η n M 3 + 2 α n 〈 u − Q ( u ) , J ( x n + 1 − Q ( u ) ) 〉 ,
(2.27)

where M 3 is an appropriate constant such that M 3 ≥ sup n ≥ 0 {2∥ x n −Q(u)∥+ η n }. Let λ n + 1 =max{〈u−Q(u),J( x n + 1 −Q(u))〉,0}. Next, we show that lim n → ∞ λ n + 1 =0. Indeed, from (2.26), for any given ϵ>0, there exists a positive integer n 1 such that

〈 u − Q ( u ) , J ( x n + 1 − Q ( u ) ) 〉 <ϵ,∀n≥ n 1 .

This implies that 0≤ λ n + 1 <ϵ, ∀n≥ n 1 . Since ϵ>0 is arbitrary, we see that lim n → ∞ λ n + 1 =0. It follows from (2.27) that

∥ x n + 1 − Q ( u ) ∥ 2 ≤(1− α n ) ∥ x n − Q ( u ) ∥ 2 + η n M 3 +2 α n λ n + 1 .

Put a n = ∥ x n − Q ( u ) ∥ 2 , t n = α n , b n =2 α n λ n + 1 and c n = η n M 3 for every n≥0. In view of Lemma 1.1, we can obtain the desired conclusion easily. □

As an application of Theorem 2.5, we have the following results.

Corollary 2.6 Let E be a real reflexive Banach space with the uniformly Gâteaux differentiable norm and let A be an m-accretive operator in E. Assume that C:= D ( A ) ¯ is convex and has the normal structure. Let { α n } and { β n } be real number sequences in (0,1). Let { x n } be a sequence generated by (QS) , where { r n } is a positive real numbers sequence, u is a fixed element in C and J r n = ( I + r n A ) − 1 . Assume that A − 1 (0)≠∅ and the above control sequences satisfy the following restrictions:

  1. (a)

    lim n → ∞ α n =0 and ∑ n = 1 ∞ α n =∞;

  2. (b)

    0< lim inf n → ∞ β n ≤ lim sup n → ∞ β n <1;

  3. (c)

    r n ≥ϵ for each n≥1 and lim n → ∞ | r n − r n + 1 |=0.

Then the sequence { x n } converges strongly to a zero of A.

Remark 2.7 Corollary 2.6 improves Theorem 2.1 of Qin and Su [18]. To be more precise, we partially relax the restrictions on the parameters and extend the framework of the space; see [18] for more details.

Remark 2.8 It is of interest to design an explicit iterative process to approximate zeros of accretive operators by Moudafi’s viscosity approximation method with continuous strong pseudocontractions.

References

  1. Takahashi W: Nonlinear Functional Analysis - Fixed Point Theory and Its Application. Yokohama Publishers, Yokohama; 2000.

    Google Scholar 

  2. Browder FE: Convergence of approximants to fixed points of nonexpansive nonlinear mappings in Banach spaces. Arch. Ration. Mech. Anal. 1967, 24: 82–90.

    Article  MathSciNet  Google Scholar 

  3. Reich S: Strong convergence theorems for resolvents of accretive operators in Banach spaces. J. Math. Anal. Appl. 1980, 75: 287–292.

    Article  MathSciNet  Google Scholar 

  4. Bruck RE: Nonexpansive projections on subsets of Banach spaces. Pac. J. Math. 1973, 47: 341–355.

    Article  MathSciNet  Google Scholar 

  5. Reich S: Asymptotic behavior of contractions in Banach spaces. J. Math. Anal. Appl. 1973, 44: 57–70.

    Article  MathSciNet  Google Scholar 

  6. Xu HK: Viscosity approximation methods for nonexpansive mappings. J. Math. Anal. Appl. 2004, 298: 279–291.

    Article  MathSciNet  Google Scholar 

  7. Moudafi A: Viscosity approximation methods for fixed-points problems. J. Math. Anal. Appl. 2000, 241: 46–55.

    Article  MathSciNet  Google Scholar 

  8. Browder FE: Nonlinear mappings of nonexpansive and accretive type in Banach spaces. Bull. Am. Math. Soc. 1967, 73: 875–882.

    Article  MathSciNet  Google Scholar 

  9. Mann WR: Mean value methods in iteration. Proc. Am. Math. Soc. 1953, 4: 506–510.

    Article  Google Scholar 

  10. Ceng LC, Khan AR, Ansari QH, Yao JC: Strong convergence of composite iterative schemes for zeros of m -accretive operators in Banach spaces. Nonlinear Anal. 2009, 70: 1830–1840.

    Article  MathSciNet  Google Scholar 

  11. Ye J, Huang J: Strong convergence theorems for fixed point problems and generalized equilibrium problems of three relatively quasi-nonexpansive mappings in Banach spaces. J. Math. Comput. Sci. 2011, 1: 1–18.

    Article  MathSciNet  Google Scholar 

  12. Zegeye H, Shahzad N: Strong convergence theorem for a common point of solution of variational inequality and fixed point problem. Adv. Fixed Point Theory 2012, 2: 374–397.

    Google Scholar 

  13. Song Y, Chen R: An approximation method for continuous pseudocontractive mappings. J. Inequal. Appl. 2006., 2006: Article ID 28950

    Google Scholar 

  14. Luo H, Wang Y: Iterative approximation for the common solutions of a infinite variational inequality system for inverse-strongly accretive mappings. J. Math. Comput. Sci. 2012, 2: 1660–1670.

    MathSciNet  Google Scholar 

  15. Chen R, Lin PK, Song Y: An approximation method for strictly pseudocontractive mappings. Nonlinear Anal. 2006, 64: 2527–2535.

    Article  MathSciNet  Google Scholar 

  16. Qing Y, Kim JK: Weak convergence of algorithms for asymptotically strict pseudocontractions in the intermediate sense and equilibrium problems. Fixed Point Theory Appl. 2012., 2012: Article ID 132

    Google Scholar 

  17. Kim JK: Strong convergence theorems by hybrid projection methods for equilibrium problems and fixed point problems of the asymptotically quasi- Ï• -nonexpansive mappings. Fixed Point Theory Appl. 2011., 2011: Article ID 10

    Google Scholar 

  18. Qin X, Su Y: Approximation of a zero point of accretive operator in Banach spaces. J. Math. Anal. Appl. 2007, 329: 415–424.

    Article  MathSciNet  Google Scholar 

  19. Wang Z, Lou W: A new iterative algorithm of common solutions to quasi-variational inclusion and fixed point problems. J. Math. Comput. Sci. 2013, 3: 57–72.

    Google Scholar 

  20. Cho SY, Kang SM: Approximation of fixed points of pseudocontraction semigroups based on a viscosity iterative process. Appl. Math. Lett. 2011, 24: 224–228.

    Article  MathSciNet  Google Scholar 

  21. Marino G, Colao V, Qin X, Kang SM: Strong convergence of the modified Mann iterative method for strict pseudo-contractions. Comput. Math. Appl. 2009, 57: 455–465.

    Article  MathSciNet  Google Scholar 

  22. Cho YJ, Kang SM, Qin X: Approximation of common fixed points of an infinite family of nonexpansive mappings in Banach spaces. Comput. Math. Appl. 2008, 56: 2058–2064.

    Article  MathSciNet  Google Scholar 

  23. Jung JS: Convergence of composite iterative methods for finding zeros of accretive operators. Nonlinear Anal. 2009, 71: 1736–1746.

    Article  Google Scholar 

  24. Qin X, Cho SY, Kang SM: Strong convergence of shrinking projection methods for quasi- ϕ -nonexpansive mappings and equilibrium problems. J. Comput. Appl. Math. 2010, 234: 750–760.

    Article  MathSciNet  Google Scholar 

  25. Liu LS: Ishikawa and Mann iterative processes with errors for nonlinear strongly accretive mappings in Banach spaces. J. Math. Anal. Appl. 1995, 194: 114–125.

    Article  MathSciNet  Google Scholar 

  26. Kirk WA: A fixed point theorem for mappings which do not increase distances. Am. Math. Mon. 1965, 72: 1004–1006.

    Article  MathSciNet  Google Scholar 

  27. Deimling K: Zeros of accretive operators. Manuscr. Math. 1974, 13: 365–374.

    Article  MathSciNet  Google Scholar 

  28. Jung JS, Cho YJ, Zhou H: Iterative processes with mixed errors for nonlinear equations with perturbed m -accretive operators in Banach spaces. Appl. Math. Comput. 2002, 133: 389–406.

    Article  MathSciNet  Google Scholar 

  29. Barbu V: Nonlinear Semigroups and Differential Equations in Banach Space. Noordhoff, Leiden; 1976.

    Book  Google Scholar 

  30. Suzuki T: Strong convergence of Krasnoselskii and Mann’s type sequences for one-parameter nonexpansive semigroups without Bochne integrals. J. Math. Anal. Appl. 2005, 305: 227–239.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Lin Wang.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors’ contributions

All authors contributed equally and significantly in writing this paper. All authors read and approved the final manuscript.

Rights and permissions

Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License ( https://creativecommons.org/licenses/by/2.0 ), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Qin, X., Cho, S.Y. & Wang, L. Iterative algorithms with errors for zero points of m-accretive operators. Fixed Point Theory Appl 2013, 148 (2013). https://doi.org/10.1186/1687-1812-2013-148

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1186/1687-1812-2013-148

Keywords