Implicit Relaxed and Hybrid Methods with Regularization for Minimization Problems and Asymptotically Strict Pseudocontractive Mappings in the Intermediate Sense
Abstract
We first introduce an implicit relaxed method with regularization for finding a common element of the set of fixed points of an asymptotically strict pseudocontractive mapping S in the intermediate sense and the set of solutions of the minimization problem (MP) for a convex and continuously Frechet differentiable functional in the setting of Hilbert spaces. The implicit relaxed method with regularization is based on three well-known methods: the extragradient method, viscosity approximation method, and gradient projection algorithm with regularization. We derive a weak convergence theorem for two sequences generated by this method. On the other hand, we also prove a new strong convergence theorem by an implicit hybrid method with regularization for the MP and the mapping S. The implicit hybrid method with regularization is based on four well-known methods: the CQ method, extragradient method, viscosity approximation method, and gradient projection algorithm with regularization.
1. Introduction
Definition 1. Let C be a nonempty subset of a normed space X. A mapping S : C → C is said to be asymptotically nonexpansive in the intermediate sense provided S is uniformly continuous and
They also studied iterative methods for the approximation of fixed points of such mappings.
Recently, Kim and Xu [3] introduced the following concept of asymptotically κ-strict pseudocontractive mappings in setting of Hilbert spaces.
Definition 2. Let C be a nonempty subset of a Hilbert space H. A mapping S : C → C is said to be an asymptotically κ-strict pseudocontractive mapping with sequence {γn} if there exists a constant κ ∈ [0,1) and a sequence {γn} in [0, ∞) with lim n→∞ γn = 0 such that
They studied weak and strong convergence theorems for this class of mappings. It is important to note that every asymptotically κ-strict pseudocontractive mapping with sequence {γn} is a uniformly ℒ-Lipschitzian mapping with .
Very recently, Sahu et al. [4] considered the following concept of asymptotically κ-strict pseudocontractive mappings in the intermediate sense, which are not necessarily Lipschitzian.
Definition 3. Let C be a nonempty subset of a Hilbert space H. A mapping S : C → C is said to be an asymptotically κ-strict pseudocontractive mapping in the intermediate sense with sequence {γn} if there exist a constant κ ∈ [0,1) and a sequence {γn} in [0, ∞) with lim n→∞ γn = 0 such that
To develop some new iterative methods for computing the approximate solutions of the minimization problem is one of the main areas of research in optimization and approximation theory. In the recent past, some study has also been done in the direction to suggest some iterative algorithms to compute the fixed point of a mapping which is also a solution of some minimization problem; for further detail, we refer to [5] and the references therein.
The main aim of this paper is to propose some iterative schemes for finding a common solution of fixed point set of an asymptotically κ-strict pseudocontractive mapping and the solution set of the minimization problem. In particular, we introduce an implicit relaxed algorithm with regularization for finding a common element of the fixed point set Fix (S) of an asymptotically κ-strict pseudocontractive mapping S and the solution set Γ of minimization problem (8). This implicit relaxed method with regularization is based on three well-known methods, namely, the extragradient method [6], viscosity approximation method, and gradient projection algorithm with regularization. We also propose an implicit hybrid algorithm with regularization for finding an element of Fix (S)∩Γ. The implicit hybrid method with regularization is based on four well-known methods, namely, the CQ method, extragradient method, viscosity approximation method, and gradient projection algorithm with regularization. The weak and strong convergence results of these two algorithms are established, respectively.
2. Preliminaries
Throughout the paper, unless otherwise specified, we use the following assumptions, notations, and terminologies.
We mention some important properties of projections in the following proposition.
Proposition 4. For given x ∈ H and z ∈ C,
- (i)
z = PCx⇔〈x − z, y − z〉 ≤ 0, for all y ∈ C;
- (ii)
z = PCx⇔ ∥x−z∥2 ≤ ∥x−y∥2 − ∥y−z∥2, for all y ∈ C;
- (iii)
, for all y ∈ H.
Consequently, PC is nonexpansive.
Definition 5. A mapping S : C → H is said to be
- (a)
monotone if
() - (b)
η-strongly monotone if there exists a constant η > 0 such that
() - (c)
α-inverse-strongly monotone (α-ism) if there exists a constant α > 0 such that
()
Obviously, if S is α-inverse-strongly monotone, then it is monotone and (1/α)-Lipschitz continuous. It can be easily seen that if S : C → C is nonexpansive, then I − S is monotone. It is also easy to see that a projection mapping PC is 1-ism. The inverse strongly monotone (also known as cocoercive) operators have been applied widely in solving practical problems in various fields.
We need some facts and tools which are listed in the form of the following lemmas.
Lemma 6. Let X be a real inner product space. Then,
Lemma 7 (see [7], Proposition 2.4.)Let {xn} be a bounded sequence in a reflexive Banach space X. If ωw({xn}) = {x}, then xn⇀x.
The theory of variational inequalities is a well-established subject in applied mathematics, nonlinear analysis, and optimization. For further details on variational inequalities, we refer to [8–13] and the references therein.
It is well known that the solution of a variational inequality can be characterized be a fixed point of a projection mapping. Therefore, by using Proposition 4(i), we have the following result.
Lemma 8. Let A : C → H be a monotone mapping. Then,
Lemma 9. The following assertions hold:
- (a)
∥x−y∥2 = ∥x∥2 − ∥y∥2 − 2〈x − y, y〉 for all x, y ∈ H;
- (b)
∥λx+μy+νz∥2 = λ∥x∥2 + μ∥y∥2 + ν∥z∥2 − λμ∥x−y∥2 − μν∥y−z∥2 − λ∥x−z∥2 for all x, y, z ∈ H and λ, μ, ν ∈ [0,1] with λ + μ + ν = 1 [14];
- (c)
if {xn} is a sequence in H such that xn⇀x, then
()
Lemma 10 (see [4], Lemma 2.5.)For given points x, y, z ∈ H and given also a real number a ∈ R, the set
Lemma 11 (see [4], Lemma 2.6.)Let C be a nonempty subset of a Hilbert space H and S : C → C an asymptotically κ-strict pseudocontractive mapping in the intermediate sense with sequence {γn}. Then,
Lemma 12 (see [4], Lemma 2.7.)Let C be a nonempty subset of a Hilbert space H and S : C → C a uniformly continuous asymptotically κ-strict pseudocontractive mapping in the intermediate sense with sequence {γn}. Let {xn} be a sequence in C such that and as n → ∞. Then, as n → ∞.
Lemma 13 (Demiclosedness Principle, [see [4, Proposition 3.1]]). Let C be a nonempty closed convex subset of a Hilbert space H and S : C → C be a continuous asymptotically κ-strict pseudocontractive mapping in the intermediate sense with sequence {γn}. Then I − S is demiclosed at zero in the sense that if {xn} is a sequence in C such that xn⇀x ∈ C and , then (I − S)x = 0.
Lemma 14 (see [4], Proposition 3.2.)Let C be a nonempty closed convex subset of a Hilbert space H and S : C → C a continuous asymptotically κ-strict pseudocontractive mapping in the intermediate sense with sequence {γn} such that Fix(S) ≠ ∅. Then, Fix(S) is closed and convex.
To prove a weak convergence theorem by an implicit relaxed method with regularization for the minimization problem (8) and the fixed point problem of an asymptotically κ-strict pseudocontractive mapping in the intermediate sense, we need the following lemma due to Osilike et al. [15].
Lemma 15 (see [15], page 80.)Let , , and be sequences of nonnegative real numbers satisfying the inequality
Corollary 16 (see [16], page 303.)Let and be two sequences of nonnegative real numbers satisfying the inequality
Lemma 17 (see [17].)Every Hilbert space H has the Kadec-Klee property; that is, given a sequence {xn} ⊂ H and a point x ∈ H, we have
3. Weak Convergence Theorem
In this section, we will prove a weak convergence theorem for an implicit relaxed method with regularization for finding a common element of the set of fixed points of an asymptotically κ-strict pseudocontractive mapping S : C → C in the intermediate sense and the set of solutions of the minimization problem (8) for a convex functional f : C → R with L-Lipschitz continuous gradient ∇f. This implicit relaxed method with regularization is based on the extragradient method, viscosity approximation method, and gradient projection algorithm (GPA) with regularization.
Theorem 18. Let C be a nonempty bounded closed convex subset of a real Hilbert space H. Let f : C → R be a convex functional with L-Lipschitz continuous gradient ∇f, Q : C → C a ρ-contraction with coefficient ρ ∈ [0,1), and S : C → C a uniformly continuous asymptotically κ-strict pseudocontractive mapping in the intermediate sense with sequence {γn} such that Fix(S)∩Γ is nonempty. Let {γn} and {cn} be defined as in Definition 3. Let {xn} and {yn} be the sequences generated by
- (i)
δ ≤ βn and σn + βn ≤ 1 − κ − τ, for all n ≥ 1 for some δ, τ ∈ (0,1);
- (ii)
, , and ;
- (iii)
lim n→∞ μn = 1;
- (iv)
λn(αn + L) < 1, for all n ≥ 1 and {λn}⊂[a, b] for some a, b ∈ (0, (1/L)).
Then, the sequences {xn}, {yn} converge weakly to some point u ∈ Fix (S)∩Γ.
Remark 19. Observe that for all x, y ∈ C and all n ≥ 1
Also, observe that for all x, y ∈ C and all n ≥ 1
Proof of Theorem 18. Note that the L-Lipschitz continuity of the gradient ∇f implies that ∇f is (1/L)-ism [20], that is,
We divide the rest of the proof into several steps.
Step 1. lim n→∞∥xn − u∥ exists for each u ∈ Fix (S)∩Γ.
Indeed, note that for all n ≥ 1. Take u ∈ Fix (S)∩Γ arbitrarily. From Proposition 4(ii), monotonicity of ∇f, and u ∈ Γ, we have
Step 2. lim n→∞∥xn − yn∥ = 0 and lim n→∞∥xn − tn∥ = 0.
Indeed, substituting (33) in (34), we get
Step 3. lim n→∞∥xn+1 − xn∥ = 0 and lim n→∞∥xn − Sxn∥ = 0.
Indeed, from (33) and (34), we conclude that
Step 4. ωw(xn) ⊂ Fix (S)∩Γ.
Indeed, from the boundedness of {xn}, we know that ωw({xn}) ≠ ∅. Take arbitrarily. Then, there exists a subsequence of {xn} such that converges weakly to . Note that S is uniformly continuous and ∥xn − Sxn∥ → 0. Hence, it is easy to see that ∥xn − Smxn∥ → 0 for all m ≥ 1. By Lemma 13, we obtain . Furthermore, we show . Since xn − tn → 0 and xn − yn → 0, we have and . Let
Step 5. {xn} and {yn} converge weakly to the same point u ∈ Fix (S)∩Γ.
Indeed, it is sufficient to show that ωw(xn) is a single-point set because xn − yn → 0 as n → ∞. Since ωw(xn) ≠ ∅, let us take two points arbitrarily. Then, there exist two subsequences and of {xn} such that and , respectively. In terms of Step 4, we know that . Meantime, according to Step 1, we also know that there exist both lim n→∞∥xn − u∥ and . Let us show that . Assume that . From the Opial condition [18], it follows that
4. Strong Convergence Theorem
In this section, we establish a strong convergence theorem for an implicit hybrid method with regularization for finding a common element of the set of fixed points of an asymptotically κ-strict pseudocontractive mapping S : C → C in the intermediate sense and the set of solutions of the MP (8) for a convex functional f : C → R with L-Lipschitz continuous gradient ∇f. This implicit hybrid method with regularization is based on the CQ method, extragradient method, viscosity approximation method, and gradient projection algorithm (GPA) with regularization.
Theorem 20. Let C be a nonempty closed convex subset of a real Hilbert space H. Let f : C → R be a convex functional with L-Lipschitz continuous gradient ∇f, Q : C → C a ρ-contraction with coefficient ρ ∈ [0,1), and S : C → C a uniformly continuous asymptotically κ-strict pseudocontractive mapping in the intermediate sense with sequence {γn} such that Fix(S)∩Γ is nonempty and bounded. Let {γn} and {cn} be defined as in Definition 3. Let {xn}, {yn}, and {zn} be the sequences generated by
Assume that the following conditions hold:
- (i)
δ ≤ βn and σn + βn ≤ 1 − κ, for all n ≥ 1 for some δ ∈ (0,1);
- (ii)
lim n→∞ αn = 0 and lim n→∞ σn = 0;
- (iii)
lim n→∞ μn = 1;
- (iv)
λn(αn + L) < 1, for all n ≥ 1 and {λn}⊂[a, b] for some a, b ∈ (0, (1/L)).
Then, the sequences {xn}, {yn}, and {zn} converge strongly to the same point PFix (S)∩Γx.
Proof. Utilizing the condition λn(αn + L) < 1 for all n ≥ 1 and repeating the same arguments as in Remark 19, we can see that {yn} and {zn} are defined well. Note that the L-Lipschitz continuity of the gradient ∇f implies that ∇f is (1/L)-ism [20], that is,
We divide the rest of the proof into several steps.
Step 1. {xn}, {yn}, and {zn} are bounded.
Indeed, take u ∈ Fix (S)∩Γ arbitrarily. Taking into account λn(αn + L) < 1, for all n ≥ 1, we deduce that
Step 2. lim n→∞∥xn − xn+1∥ = 0 and lim n→∞∥xn − zn∥ = 0.
Indeed, let q = PFix (S)∩Γx. From and q ∈ Fix (S)∩Γ ⊂ Cn∩Qn, we have
Step 3. lim n→∞∥xn − yn∥ = 0, lim n→∞∥xn − tn∥ = 0 and lim n→∞∥xn − Sxn∥ = 0.
Indeed, substituting (69) in (70), we get
Since zn = (1 − σn − βn)tn + σnQtn + βnSntn, we have βn(Sntn − tn) = (zn − tn) − σn(Qtn − tn). Then,
Step 4. ωw(xn) ⊂ Fix (S)∩Γ.
Indeed, repeating the same arguments as in Step 4 of the proof of Theorem 18, we can derive the desired conclusion.
Step 5. {xn}, {yn}, and {zn} converge strongly to q = PFix (S)∩Γx.
Indeed, take arbitrarily. Then, according to Step 4. Moreover, there exists a subsequence of {xn} such that . Hence, from q = PFix (S)∩Γx, , and (71), we have
Acknowledgments
In this research, first author was partially supported by the National Science Foundation of China (11071169), Innovation Program of Shanghai Municipal Education Commission (09ZZ133), and Ph.D. Profram Foundation of Ministry of Education of China (20123127110002). The research part of the second author was done during his visit to KFUPM, Dhahran, Saudi Arabia. The third author was partially supported by a Grant from the NSC 101-2115-M-037-001.