Journal of Applied Mathematics
Volume 2011 (2011), Article ID 953903, 28 pages
doi:10.1155/2011/953903
Research Article

Common Solutions of Generalized Mixed Equilibrium Problems, Variational Inclusions, and Common Fixed Points for Nonexpansive Semigroups and Strictly Pseudocontractive Mappings

Poom Kumam,1 Usa Hamphries,1 and Phayap Katchang2

1Department of Mathematics, Faculty of Science, King Mongkut's University of Technology Thonburi (KMUTT), Bangmod, Bangkok 10140, Thailand
2Department of Mathematics and Statistics, Faculty of Science and Agricultural Technology, Rajamangala University of Technology Lanna Tak, Tak 63000, Thailand

Received 24 April 2011; Accepted 12 July 2011

Academic Editor: Yansheng Liu

Copyright © 2011 Poom Kumam et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Abstract

We introduce a new iterative scheme by shrinking projection method for finding a common element of the set of solutions of generalized mixed equilibrium problems, the set of common solutions of variational inclusion problems with set-valued maximal monotone mappings and inverse-strongly monotone mappings, the set of solutions of fixed points for nonexpansive semigroups, and the set of common fixed points for an infinite family of strictly pseudocontractive mappings in a real Hilbert space. We prove that the sequence converges strongly to a common element of the above four sets under some mind conditions. Furthermore, by using the above result, an iterative algorithm for solution of an optimization problem was obtained. Our results improve and extend the corresponding results of Martinez-Yanes and Xu (2006), Shehu (2011), Zhang et al. (2008), and many authors.

1. Introduction

Throughout this paper, we assume that 𝐻 is a real Hilbert space with inner product and norm are denoted by ⟨ ⋅ , ⋅ ⟩ and ‖ ⋅ ‖ , respectively. Let 2 𝐻 denote the family of all subsets of 𝐻 , and let 𝐶 be a closed-convex subset of 𝐻 . Recall that a mapping 𝑇 ∶ 𝐶 → 𝐶 is said to be a 𝑘 -strict pseudocontraction [1] if there exists 0 ≤ 𝑘 < 1 such that ‖ 𝑇 𝑥 − 𝑇 𝑦 ‖ 2 ≤ ‖ 𝑥 − 𝑦 ‖ 2 + 𝑘 ‖ ( 𝐼 − 𝑇 ) 𝑥 − ( 𝐼 − 𝑇 ) 𝑦 ‖ 2 , ∀ 𝑥 , 𝑦 ∈ 𝐶 , ( 1 . 1 ) where 𝐼 denotes the identity operator on 𝐶 . When 𝑘 = 0 , 𝑇 ∶ 𝐶 → 𝐶 is said to be nonexpansive [2] if ‖ 𝑇 𝑥 − 𝑇 𝑦 ‖ ≤ ‖ 𝑥 − 𝑦 ‖ , ∀ 𝑥 , 𝑦 ∈ 𝐶 . ( 1 . 2 ) And when 𝑘 = 1 , 𝑇 ∶ 𝐶 → 𝐶 is said to be pseudocontraction if ‖ 𝑇 𝑥 − 𝑇 𝑦 ‖ 2 ≤ ‖ 𝑥 − 𝑦 ‖ 2 + ‖ ( 𝐼 − 𝑇 ) 𝑥 − ( 𝐼 − 𝑇 ) 𝑦 ‖ 2 , ∀ 𝑥 , 𝑦 ∈ 𝐶 . ( 1 . 3 ) Clearly, the class of 𝑘 -strict pseudocontraction falls into the one between classes of nonexpansive mappings and pseudocontraction mapping. We denote the set of fixed points of 𝑇 by 𝐹 ( 𝑇 ) .

A family 𝒮 = { 𝑆 ( 𝑠 ) ∶ 0 ≤ 𝑠 < ∞ } of mappings of 𝐶 into itself is called a nonexpansive semigroup on 𝐶 if it satisfies the following conditions: (i) 𝑆 ( 0 ) 𝑥 = 𝑥 for all 𝑥 ∈ 𝐶 ,(ii) 𝑆 ( 𝑠 + 𝑡 ) = 𝑆 ( 𝑠 ) 𝑆 ( 𝑡 ) for all 𝑠 , 𝑡 ≥ 0 ,(iii) ‖ 𝑆 ( 𝑠 ) 𝑥 − 𝑆 ( 𝑠 ) 𝑦 ‖ ≤ ‖ 𝑥 − 𝑦 ‖ for all 𝑥 , 𝑦 ∈ 𝐶 and 𝑠 ≥ 0 ,(iv)for all 𝑥 ∈ 𝐶 , 𝑠 ↦ 𝑆 ( 𝑠 ) 𝑥 is continuous.

We denote by 𝐹 ( 𝒮 ) the set of all common fixed points of 𝒮 = { 𝑆 ( 𝑠 ) ∶ 𝑠 ≥ 0 } , that is, ⋂ 𝐹 ( 𝑆 ) = 𝑠 ≥ 0 𝐹 ( 𝑆 ( 𝑠 ) ) . It is known that 𝐹 ( 𝒮 ) is closed and convex.

Let 𝐴 ∶ 𝐻 → 𝐻 be a single-valued nonlinear mapping, and let 𝑀 ∶ 𝐻 → 2 𝐻 be a set-valued mapping. We consider the following variational inclusion problem, which is to find a point 𝑢 ∈ 𝐻 such that 𝜃 ∈ 𝐴 ( 𝑢 ) + 𝑀 ( 𝑢 ) , ( 1 . 4 ) where 𝜃 is the zero vector in H. The set of solutions of problem (1.4) is denoted by 𝐼 ( 𝐴 , 𝑀 ) .

Let the set-valued mapping 𝑀 ∶ 𝐻 → 2 𝐻 be a maximal monotone. We define the resolvent operator 𝐽 𝑀 , 𝜆 associate with 𝑀 and 𝜆 as follows: 𝐽 𝑀 , 𝜆 ( 𝑢 ) = ( 𝐼 + 𝜆 𝑀 ) − 1 ( 𝑢 ) , 𝑢 ∈ 𝐻 , ( 1 . 5 ) where 𝜆 is a positive number. It is worth mentioning that the resolvent operator 𝐽 𝑀 , 𝜆 is single-valued, nonexpansive, and 1-inverse-strongly monotone ([3, 4]).

Let 𝐹 be a bifunction of 𝐶 × 𝐶 into ℝ , where ℝ is the set of real numbers, let 𝐴 ∶ 𝐶 → 𝐻 be a mapping, and let 𝜑 ∶ 𝐶 → ℝ be a real-valued function. The generalized mixed equilibrium problem is for finding 𝑥 ∈ 𝐶 such that 𝐹 ( 𝑥 , 𝑦 ) + ⟨ 𝐴 𝑥 , 𝑦 − 𝑥 ⟩ + 𝜑 ( 𝑦 ) − 𝜑 ( 𝑥 ) ≥ 0 , ∀ 𝑦 ∈ 𝐶 . ( 1 . 6 ) The set of solutions of (1.6) is denoted by G M E P ( 𝐹 , 𝜑 , 𝐴 ) , that is, G M E P ( 𝐹 , 𝜑 , 𝐴 ) = { 𝑥 ∈ 𝐶 ∶ 𝐹 ( 𝑥 , 𝑦 ) + ⟨ 𝐴 𝑥 , 𝑦 − 𝑥 ⟩ + 𝜑 ( 𝑦 ) − 𝜑 ( 𝑥 ) ≥ 0 , ∀ 𝑦 ∈ 𝐶 } . ( 1 . 7 ) If 𝐴 ≡ 0 , then the problem (1.6) is reduced into the mixed equilibrium problem for finding 𝑥 ∈ 𝐶 such that 𝐹 ( 𝑥 , 𝑦 ) + 𝜑 ( 𝑦 ) − 𝜑 ( 𝑥 ) ≥ 0 , ∀ 𝑦 ∈ 𝐶 . ( 1 . 8 ) The set of solutions of (1.8) is denoted by M E P ( 𝐹 , 𝜑 ) . The (generalized) mixed equilibrium problems include fixed-point problems, variational inequality problems, optimization problems, Nash equilibrium problems, noncooperative games, economics, and the equilibrium problem as special cases ([5–15]). In the last two decades, many papers have appeared in the literature on the existence of solutions of equilibrium problems; see, for example, [9] and references therein. Some solution methods have been proposed to solve the mixed equilibrium problems; see, for example, ([7–10, 12–20]) and references therein.

In 2006, Martinez-Yanes and Xu [21] introduced the following iterative: 𝑥 0 𝑦 ∈ 𝐶 , 𝑛 = 𝛼 𝑛 𝑥 0 + 1 − 𝛼 𝑛 𝑇 𝑥 𝑛 , 𝐶 𝑛 = ‖ ‖ 𝑦 𝑧 ∈ 𝐶 ∶ 𝑛 ‖ ‖ − 𝑧 2 ≤ ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑧 2 + 𝛼 𝑛 ‖ ‖ 𝑥 0 ‖ ‖ 2 + 2 ⟨ 𝑥 𝑛 − 𝑥 0 , 𝑄 , 𝑧 ⟩ 𝑛 = 𝑧 ∈ 𝐶 ∶ ⟨ 𝑥 𝑛 − 𝑧 , 𝑥 𝑛 − 𝑥 0 , 𝑥 ⟩ ≤ 0 𝑛 + 1 = 𝑃 𝐶 𝑛 ∩ 𝑄 𝑛 𝑥 0 , ( 1 . 9 ) where 𝑇 is a nonexpansive mapping in a Hilbert space 𝐻 , and 𝑃 𝐶 is metric projection of 𝐻 onto a closed and convex subset 𝐶 of 𝐻 . They proved that if the sequence { 𝛼 𝑛 } of parameters satisfies appropriate conditions, then the sequence { 𝑥 𝑛 } converges strongly to 𝑃 𝐹 ( 𝑇 ) 𝑥 0 .

In 2008, Zhang et al. [4] introduced an iterative scheme for finding a common element of the set of solutions to the variational inclusion problem with a multivalued maximal monotone mapping and an inverse-strongly monotone mapping and the set of fixed points of nonexpansive mapping in Hilbert spaces. The following iterative scheme 𝑥 0 = 𝑥 ∈ 𝐻 and 𝑦 𝑛 = 𝐽 𝑀 , 𝜆 𝑥 𝑛 − 𝜆 𝐴 𝑥 𝑛 , 𝑥 𝑛 + 1 = 𝛼 𝑛 𝑥 + 1 − 𝛼 𝑛 𝑆 𝑦 𝑛 , ( 1 . 1 0 ) for all 𝑛 ≥ 0 . They proved the strong convergence theorem under some mind conditions.

Recently, Shehu [19] introduced a new iterative scheme by hybrid method for finding a common element of the set of common fixed points of infinite family of 𝑘 -strictly pseudocontractive mappings, the set of common solutions to a system of generalized mixed equilibrium problems, and the set of solutions to a variational inequality problem in Hilbert spaces. Starting with an arbitrary 𝑥 0 ∈ 𝐶 , 𝐶 1 , 𝑖 = 𝐶 , 𝐶 1 = ⋂ ∞ 𝑖 = 1 𝐶 1 , 𝑖 , and 𝑥 1 = 𝑃 𝐶 1 𝑥 0 define sequence { 𝑥 𝑛 } , { 𝑤 𝑛 } , { 𝑢 𝑛 } , { 𝑧 𝑛 } , and { 𝑦 𝑛 , 𝑖 } as follows: 𝑧 𝑛 = 𝑇 ( 𝐹 1 , 𝜑 1 ) 𝑟 𝑛 𝑥 𝑛 − 𝑟 𝑛 𝐴 𝑥 𝑛 , 𝑦 𝑛 = 𝑇 ( 𝐹 2 , 𝜑 2 ) 𝜆 𝑛 𝑧 𝑛 − 𝜆 𝑛 𝐵 𝑧 𝑛 , 𝑤 𝑛 = 𝑃 𝐶 𝑢 𝑛 − 𝑠 𝑛 𝐷 𝑢 𝑛 , 𝑦 𝑛 , 𝑖 = 𝛼 𝑛 , 𝑖 𝑤 𝑛 + 1 − 𝛼 𝑛 , 𝑖 𝑇 𝑖 𝑤 𝑛 𝐶 , 𝑛 ≥ 1 , 𝑛 + 1 , 𝑖 = 𝑧 ∈ 𝐶 𝑛 , 𝑖 ∶ ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ ≤ ‖ ‖ 𝑥 − 𝑧 𝑛 ‖ ‖ 𝐶 − 𝑧 , 𝑛 ≥ 1 , 𝑛 + 1 = ∩ ∞ 𝑖 = 1 𝐶 𝑛 + 1 , 𝑖 , 𝑥 𝑛 + 1 = 𝑃 𝐶 𝑛 + 1 𝑥 0 , 𝑛 ≥ 1 , ( 1 . 1 1 ) where 𝑇 𝑖 is a 𝑘 𝑖 -strictly pseudocontractive mapping and for some 0 ≤ 𝑘 𝑖 < 1 , 𝐴 , 𝐵 is 𝛼 , 𝛽 -inverse-strongly monotone mapping of 𝐶 into 𝐻 . He proved that if the sequence { 𝛼 𝑛 , 𝑖 } , { 𝑟 𝑛 } , { 𝑠 𝑛 } , and { 𝜆 𝑛 } of parameters satisfies appropriate conditions, then { 𝑥 𝑛 } generated by (1.11) converges strongly to 𝑃 Ω 𝑥 0 .

In this paper, motivated by the above results, we present a new general iterative scheme for finding a common element of the set of solutions for a system of generalized mixed equilibrium problems, the set of common solutions of variational inclusion problems with set-valued maximal monotone mappings and inverse-strongly monotone mappings, the set of solutions of fixed points for nonexpansive semigroup mappings, and the set of common fixed points for an infinite family of strictly pseudocontractive mappings in a real Hilbert space. Then, we prove strong convergence theorem under some mind conditions. Furthermore, by using the above result, an iterative algorithm for solution of an optimization problem was obtained. The results presented in this paper extend and improve the results of Martinez-Yanes and Xu [21], Shehu [19], Zhang et al. [4], and many authors.

2. Preliminaries

Let 𝐻 be a real Hilbert space with norm ‖ ⋅ ‖ and inner product ⟨ ⋅ , ⋅ ⟩ , and let 𝐶 be a closed-convex subset of 𝐻 . When { 𝑥 𝑛 } is a sequence in 𝐻 , 𝑥 𝑛 ⇀ 𝑥 means that { 𝑥 𝑛 } converges weakly to 𝑥 , and 𝑥 𝑛 → 𝑥 means that { 𝑥 𝑛 } converges strongly to 𝑥 . In a real Hilbert space 𝐻 , we have ‖ 𝑥 − 𝑦 ‖ 2 = ‖ 𝑥 ‖ 2 − ‖ 𝑦 ‖ 2 − 2 ⟨ 𝑥 − 𝑦 , 𝑦 ⟩ , ( 2 . 1 ) ‖ 𝜆 𝑥 + ( 1 − 𝜆 ) 𝑦 ‖ 2 = 𝜆 ‖ 𝑥 ‖ 2 + ( 1 − 𝜆 ) ‖ 𝑦 ‖ 2 − 𝜆 ( 1 − 𝜆 ) ‖ 𝑥 − 𝑦 ‖ 2 , ∀ 𝑥 , 𝑦 ∈ 𝐻 , ( 2 . 2 ) and 𝜆 ∈ ℝ . For every point 𝑥 ∈ 𝐻 , there exists a unique nearest point in 𝐶 , denoted by 𝑃 𝐶 𝑥 , such that ‖ ‖ 𝑥 − 𝑃 𝐶 𝑥 ‖ ‖ ≤ ‖ 𝑥 − 𝑦 ‖ , ∀ 𝑦 ∈ 𝐶 . ( 2 . 3 ) 𝑃 𝐶 is called the metric projection of 𝐻 onto 𝐶 . It is well known that 𝑃 𝐶 is a nonexpansive mapping of 𝐻 onto 𝐶 and satisfies ⟨ 𝑥 − 𝑦 , 𝑃 𝐶 𝑥 − 𝑃 𝐶 ‖ ‖ 𝑃 𝑦 ⟩ ≥ 𝐶 𝑥 − 𝑃 𝐶 𝑦 ‖ ‖ 2 , ∀ 𝑥 , 𝑦 ∈ 𝐻 . ( 2 . 4 ) Moreover, 𝑃 𝐶 𝑥 is characterized by the following properties: 𝑃 𝐶 𝑥 ∈ 𝐶 and ⟨ 𝑥 − 𝑃 𝐶 𝑥 , 𝑦 − 𝑃 𝐶 𝑥 ⟩ ≤ 0 , ( 2 . 5 ) ‖ 𝑥 − 𝑦 ‖ 2 ≥ ‖ ‖ 𝑥 − 𝑃 𝐶 𝑥 ‖ ‖ 2 + ‖ ‖ 𝑦 − 𝑃 𝐶 𝑥 ‖ ‖ 2 , ∀ 𝑥 ∈ 𝐻 , 𝑦 ∈ 𝐶 . ( 2 . 6 ) Recall that a mapping 𝐴 of 𝐻 into itself is called 𝛼 -inverse-strongly monotone if there exists a positive real number 𝛼 such that ⟨ 𝐴 𝑥 − 𝐴 𝑦 , 𝑥 − 𝑦 ⟩ ≥ 𝛼 ‖ 𝐴 𝑥 − 𝐴 𝑦 ‖ 2 , ∀ , 𝑦 ∈ 𝐻 . ( 2 . 7 ) It is obvious that any 𝛼 -inverse-strongly monotone mapping 𝐴 is ( 1 / 𝛼 ) -Lipschitz monotone and continuous mapping.

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

Lemma 2.1 (see [22]). Let 𝑉 ∶ 𝐶 → 𝐻 be a 𝑘 -strict pseudocontraction, then
(1)the fixed-point set 𝐹 ( 𝑉 ) of 𝑉 is closed convex, so that the projection 𝑃 𝐹 ( 𝑉 ) is well defined;(2)define a mapping 𝑇 ∶ 𝐶 → 𝐻 by 𝑇 𝑥 = 𝑡 𝑥 + ( 1 − 𝑡 ) 𝑉 𝑥 , ∀ 𝑥 ∈ 𝐶 . ( 2 . 8 ) If 𝑡 ∈ [ 𝑘 , 1 ) , then 𝑇 is a nonexpansive mapping such that 𝐹 ( 𝑉 ) = 𝐹 ( 𝑇 ) .

A family of mappings { 𝑉 𝑖 ∶ 𝐶 → 𝐻 } ∞ 𝑖 = 1 is called a family of uniformly 𝑘 -strict pseudocontractions if there exists a constant 𝑘 ∈ [ 0 , 1 ) such that ‖ ‖ 𝑉 𝑖 𝑥 − 𝑉 𝑖 𝑦 ‖ ‖ 2 ≤ ‖ 𝑥 − 𝑦 ‖ 2 ‖ ‖ + 𝑘 ( 𝐼 − 𝑉 𝑖 ) 𝑥 − ( 𝐼 − 𝑉 𝑖 ‖ ‖ ) 𝑦 2 , ∀ 𝑥 , 𝑦 ∈ 𝐶 , ∀ 𝑖 ≥ 1 . ( 2 . 9 ) Let { 𝑉 𝑖 ∶ 𝐶 → 𝐶 } ∞ 𝑖 = 1 be a countable family of uniformly 𝑘 -strict pseudocontractions. Let { 𝑇 𝑖 ∶ 𝐶 → 𝐶 } ∞ 𝑖 = 1 be the sequence of nonexpansive mappings defined by (2.8), that is, 𝑇 𝑖 𝑥 = 𝑡 𝑥 + ( 1 − 𝑡 ) 𝑉 𝑖 [ 𝑥 , ∀ 𝑥 ∈ 𝐶 , ∀ 𝑖 ≥ 1 , 𝑡 ∈ 𝑘 , 1 ) . ( 2 . 1 0 )

Let { 𝑇 𝑖 } be a sequence of nonexpansive mappings of 𝐶 into itself defined by (2.10), and let { 𝜇 𝑖 } be a sequence of nonnegative numbers in [ 0 , 1 ] . For each 𝑛 ≥ 1 , define a mapping 𝑊 𝑛 of 𝐶 into itself as follows: 𝑈 𝑛 , 𝑛 + 1 𝑈 = 𝐼 , 𝑛 , 𝑛 = 𝜇 𝑛 𝑇 𝑛 𝑈 𝑛 , 𝑛 + 1 + 1 − 𝜇 𝑛 𝑈 𝐼 , 𝑛 , 𝑛 − 1 = 𝜇 𝑛 − 1 𝑇 𝑛 − 1 𝑈 𝑛 , 𝑛 + 1 − 𝜇 𝑛 − 1 ⋮ 𝑈 𝐼 , 𝑛 , 𝑘 = 𝜇 𝑘 𝑇 𝑘 𝑈 𝑛 , 𝑘 + 1 + 1 − 𝜇 𝑘 𝑈 𝐼 , 𝑛 , 𝑘 − 1 = 𝜇 𝑘 − 1 𝑇 𝑘 − 1 𝑈 𝑛 , 𝑘 + 1 − 𝜇 𝑘 − 1 ⋮ 𝑈 𝐼 , 𝑛 , 2 = 𝜇 2 𝑇 2 𝑈 𝑛 , 3 + 1 − 𝜇 2 𝑊 𝐼 , 𝑛 = 𝑈 𝑛 , 1 = 𝜇 1 𝑇 1 𝑈 𝑛 , 2 + 1 − 𝜇 1 𝐼 . ( 2 . 1 1 ) Such a mapping 𝑊 𝑛 is nonexpansive from 𝐶 to 𝐶 and it is called the 𝑊 -mapping generated by 𝑇 1 , 𝑇 2 , … , 𝑇 𝑛 and 𝜇 1 , 𝜇 2 , … , 𝜇 𝑛 .

For each 𝑛 , 𝑘 ∈ ℕ , let the mapping 𝑈 𝑛 , 𝑘 be defined by (2.11), then we can have the following crucial conclusions concerning 𝑊 𝑛 . You can find them in [23]. Now, we only need the following similar version in Hilbert spaces.

Lemma 2.2 (see [23]). Let 𝐶 be a nonempty closed-convex subset of a real Hilbert space 𝐻 . Let 𝑇 1 , 𝑇 2 , … be nonexpansive mappings of 𝐶 into itself such that ⋂ ∞ 𝑛 = 1 𝐹 ( 𝑇 𝑛 ) is nonempty, and let 𝜇 1 , 𝜇 2 , … be real numbers such that 0 ≤ 𝜇 𝑛 ≤ 𝑏 < 1 for every 𝑛 ≥ 1 , then
(1) 𝑊 𝑛 is nonexpansive and 𝐹 ( 𝑊 𝑛 ⋂ ) = 𝑛 𝑖 = 1 𝐹 ( 𝑇 𝑖 ) , ∀ 𝑛 ≥ 1 ,(2)for every 𝑥 ∈ 𝐶 and 𝑘 ∈ ℕ , the limit l i m 𝑛 → ∞ 𝑈 𝑛 , 𝑘 𝑥 exists,(3)a mapping 𝑊 ∶ 𝐶 → 𝐶 defined by 𝑊 𝑥 ∶ = l i m 𝑛 → ∞ 𝑊 𝑛 𝑥 = l i m 𝑛 → ∞ 𝑈 𝑛 , 1 𝑥 , ∀ 𝑥 ∈ 𝐶 ( 2 . 1 2 ) is a nonexpansive mapping satisfying ⋂ 𝐹 ( 𝑊 ) = ∞ 𝑖 = 1 𝐹 ( 𝑇 𝑖 ) , and it is called the 𝑊 -mapping generated by 𝑇 1 , 𝑇 2 , … and 𝜇 1 , 𝜇 2 , … .

Lemma 2.3 (see [24]). Let 𝐶 be a nonempty closed-convex subset of a Hilbert space 𝐻 , let { 𝑇 𝑖 ∶ 𝐶 → 𝐶 } be a countable family of nonexpansive mappings with ⋂ ∞ 𝑖 = 1 𝐹 ( 𝑇 𝑖 ) ≠ ∅ , and let { 𝜇 𝑖 } be a real sequence such that 0 < 𝜇 𝑖 ≤ 𝑏 < 1 , ∀ 𝑖 ≥ 1 . If 𝐷 is any bounded subset of 𝐶 , then l i m 𝑛 → ∞ s u p 𝑥 ∈ 𝐷 ‖ ‖ 𝑊 𝑥 − 𝑊 𝑛 𝑥 ‖ ‖ = 0 . ( 2 . 1 3 )

Lemma 2.4 (see [25]). Each Hilbert space 𝐻 satisfies Opials condition, that is, for any sequence { 𝑥 𝑛 } ⊂ 𝐻 with 𝑥 𝑛 ⇀ 𝑥 , the inequality l i m i n f 𝑛 → ∞ ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑥 < l i m i n f 𝑛 → ∞ ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑦 ( 2 . 1 4 ) holds for each 𝑦 ∈ 𝐻 with 𝑦 ≠ 𝑥 .

Lemma 2.5 (see [3]). Let 𝑀 ∶ 𝐻 → 2 𝐻 be a maximal monotone mapping, and let 𝐴 ∶ 𝐻 → 𝐻 be a monotone mapping, then the mapping 𝑆 = 𝑀 + 𝐴 ∶ 𝐻 → 2 𝐻 is a maximal monotone mapping.

Remark 2.6. Lemma 2.5 implies that 𝐼 ( 𝐴 , 𝑀 ) is closed and convex if 𝑀 ∶ 𝐻 → 2 𝐻 is a maximal monotone mapping and 𝐴 ∶ 𝐻 → 𝐻 is a monotone mapping.

Lemma 2.7 (see [4]). Let 𝑢 ∈ 𝐻 be a solution of variational inclusion (1.4) if and only if 𝑢 = 𝐽 𝑀 , 𝜆 ( 𝑢 − 𝜆 𝐴 𝑢 ) , ∀ 𝜆 > 0 , that is, 𝐼 𝐽 ( 𝐴 , 𝑀 ) = 𝐹 𝑀 , 𝜆 ( 𝐼 − 𝜆 𝐴 ) , ∀ 𝜆 > 0 . ( 2 . 1 5 )

Lemma 2.8 (see [20]). Let 𝐶 be a nonempty bounded closed-convex subset of a Hilbert space 𝐻 , and let 𝒮 = { 𝑆 ( 𝑠 ) ∶ 0 ≤ 𝑠 < ∞ } be a nonexpansive semigroup on 𝐶 , then for any ℎ ≥ 0 , l i m 𝑡 → ∞ s u p 𝑥 ∈ 𝐶 ‖ ‖ ‖ 1 𝑡 𝑡 0 1 𝑆 ( 𝑠 ) 𝑥 𝑑 𝑠 − 𝑆 ( ℎ ) 𝑡 𝑡 0 ‖ ‖ ‖ 𝑆 ( 𝑠 ) 𝑥 𝑑 𝑠 = 0 . ( 2 . 1 6 )

Lemma 2.9 (see [26]). Let C be a nonempty bounded closed-convex subset of H, let { 𝑥 𝑛 } be a sequence in C, and let 𝒮 = { 𝑆 ( 𝑠 ) ∶ 0 ≤ 𝑠 < ∞ } be a nonexpansive semigroup on C. If the following conditions are satisfied:
(1) 𝑥 𝑛 ⇀ 𝑧 ,(2) l i m s u p 𝑠 → ∞ l i m s u p 𝑛 → ∞ ‖ 𝑆 ( 𝑠 ) 𝑥 𝑛 − 𝑥 𝑛 ‖ = 0 , t h e n 𝑧 ∈ 𝐹 ( S ) .
For solving the generalized mixed equilibrium problem for 𝐹 ∶ 𝐶 × 𝐶 → ℝ , one gives the following assumptions for the bifunction F, 𝜑 and the set C:
(A1) 𝐹 ( 𝑥 , 𝑥 ) = 0 for all 𝑥 ∈ 𝐶 ,(A2) 𝐹 is monotone, that is, 𝐹 ( 𝑥 , 𝑦 ) + 𝐹 ( 𝑦 , 𝑥 ) ≤ 0 for all 𝑥 , 𝑦 ∈ 𝐶 ,(A3)for each 𝑥 , 𝑦 , 𝑧 ∈ 𝐶 , l i m 𝑡 → 0 𝐹 ( 𝑡 𝑧 + ( 1 − 𝑡 ) 𝑥 , 𝑦 ) ≤ 𝐹 ( 𝑥 , 𝑦 ) ,(A4)for each 𝑥 ∈ 𝐶 , 𝑦 ↦ 𝐹 ( 𝑥 , 𝑦 ) is convex and lower semicontinuous, (A5)for each 𝑦 ∈ 𝐶 , 𝑥 ↦ 𝐹 ( 𝑥 , 𝑦 ) is weakly upper semicontinuous,(B1)for each 𝑥 ∈ 𝐻 and 𝑟 > 0 , there exist a bounded subset 𝐷 𝑥 ⊆ 𝐶 and 𝑦 𝑥 ∈ 𝐶 such that for any 𝑧 ∈ 𝐶 ⧵ 𝐷 𝑥 , 𝐹 𝑧 , 𝑦 𝑥 𝑦 + 𝜑 𝑥 + 1 𝑟 ⟨ 𝑦 𝑥 − 𝑧 , 𝑧 − 𝑥 ⟩ < 𝜑 ( 𝑧 ) , ( 2 . 1 7 ) (B2)C is a bounded set,
then one has the following lemma.

Lemma 2.10 (see [18]). Let C be a nonempty closed-convex subset of H. Let 𝐹 ∶ 𝐶 × 𝐶 → ℝ be a bifunction that satisfies (A1)–(A5), and let 𝜑 ∶ 𝐶 → ℝ ∪ { + ∞ } be a proper lower semicontinuous and convex function. Assume that either (B1) or (B2) holds. For 𝑟 > 0 and 𝑥 ∈ 𝐻 , define a mapping 𝑇 𝑟 ∶ 𝐻 → 𝐶 as follows: 𝑇 𝑟 ( 𝐹 , 𝜑 ) 1 ( 𝑥 ) = 𝑧 ∈ 𝐶 ∶ 𝐹 ( 𝑧 , 𝑦 ) + 𝜑 ( 𝑦 ) + 𝑟 , ⟨ 𝑦 − 𝑧 , 𝑧 − 𝑥 ⟩ ≥ 𝜑 ( 𝑧 ) , ∀ 𝑦 ∈ 𝐶 ( 2 . 1 8 ) for all 𝑧 ∈ 𝐻 , then the following hold: (1)for each 𝑥 ∈ 𝐻 , 𝑇 𝑟 ( 𝐹 , 𝜑 ) ( 𝑥 ) ≠ ∅ ,(2) 𝑇 𝑟 ( 𝐹 , 𝜑 ) is single valued,(3) 𝑇 𝑟 ( 𝐹 , 𝜑 ) is firmly nonexpansive, that is, for any 𝑥 , 𝑦 ∈ 𝐻 , ‖ 𝑇 𝑟 ( 𝐹 , 𝜑 ) 𝑥 − 𝑇 𝑟 ( 𝐹 , 𝜑 ) 𝑦 ‖ 2 ≤ ⟨ 𝑇 𝑟 ( 𝐹 , 𝜑 ) 𝑥 − 𝑇 𝑟 ( 𝐹 , 𝜑 ) 𝑦 , 𝑥 − 𝑦 ⟩ ,(4) 𝐹 ( 𝑇 𝑟 ( 𝐹 , 𝜑 ) ) = 𝑀 𝐸 𝑃 ( 𝐹 , 𝜑 ) ,(5) 𝑀 𝐸 𝑃 ( 𝐹 , 𝜑 ) is closed and convex.

3. Main Result

In this section, we prove a strong convergence theorem for finding a common element of the set of solutions for a system of generalized mixed equilibrium problems, the set of common solutions of variational inclusion problems with set-valued maximal monotone mappings and inverse-strongly monotone mappings, the set of solutions of fixed points for nonexpansive semigroup mappings, and the set of common fixed points for an infinite family of strictly pseudocontractive mappings in a real Hilbert space.

Theorem 3.1. Let 𝐶 be a nonempty closed-convex subset of a real Hilbert Space 𝐻 . Let 𝐹 1 , 𝐹 2 be bifunctions of 𝐶 × 𝐶 into real numbers ℝ satisfying (A1)–(A5), and let 𝜑 1 , 𝜑 2 ∶ 𝐶 → ℝ ∪ { + ∞ } be proper lower semicontinuous and convex functions with assumption (B1) or (B2). Let 𝐴 , 𝐵 , 𝐸 1 , 𝐸 2 be 𝛼 , 𝛽 , 𝜂 1 , 𝜂 2 -inverse-strongly monotone mappings of 𝐶 into 𝐻 , respectively, and let 𝑀 1 , 𝑀 2 ∶ 𝐻 → 2 𝐻 be maximal monotone mappings. Let 𝒮 = { 𝑆 ( 𝑠 ) ∶ 0 ≤ 𝑠 < ∞ } be a nonexpansive semigroup on 𝐶 , and let { 𝑡 𝑛 } be a positive real divergent sequence. Let { 𝑉 𝑖 ∶ 𝐶 → 𝐶 } ∞ 𝑖 = 1 be a countable family of uniformly 𝑘 -strict pseudocontractions, let { 𝑇 𝑖 ∶ 𝐶 → 𝐶 } ∞ 𝑖 = 1 be a countable family of nonexpansive mappings defined by 𝑇 𝑖 𝑥 = 𝑡 𝑥 + ( 1 − 𝑡 ) 𝑉 𝑖 𝑥 , ∀ 𝑥 ∈ 𝐶 , ∀ 𝑖 ≥ 1 , 𝑡 ∈ [ 𝑘 , 1 ) , and let 𝑊 𝑛 be the 𝑊 -mapping defined by (2.11) and 𝑊 a mapping defined by (2.12) with 𝐹 ( 𝑊 ) ≠ ∅ . Suppose that Θ ∶ = 𝐹 ( S ) ∩ 𝐹 ( 𝑊 ) ∩ 𝐺 𝑀 𝐸 𝑃 ( 𝐹 1 , 𝜑 1 , 𝐴 ) ∩ 𝐺 𝑀 𝐸 𝑃 ( 𝐹 2 , 𝜑 2 , 𝐵 ) ∩ 𝐼 ( 𝐸 1 , 𝑀 1 ) ∩ 𝐼 ( 𝐸 2 , 𝑀 2 ) ≠ ∅ . Let { 𝑥 𝑛 } be a sequence generated by 𝑥 0 ∈ 𝐶 , 𝐶 1 , 𝑖 = 𝐶 , 𝐶 1 = ⋂ ∞ 𝑖 = 1 𝐶 1 , 𝑖 , 𝑥 1 = 𝑃 𝐶 1 𝑥 0 , and 𝑡 𝑛 = 𝑇 ( 𝐹 1 , 𝜑 1 ) 𝑟 𝑛 𝑥 𝑛 − 𝑟 𝑛 𝐴 𝑥 𝑛 , 𝑢 𝑛 = 𝑇 ( 𝐹 2 , 𝜑 2 ) 𝑞 𝑛 𝑡 𝑛 − 𝑞 𝑛 𝐵 𝑡 𝑛 , 𝑣 𝑛 = 𝐽 𝑀 1 , 𝜆 1 𝑢 𝑛 − 𝜆 1 𝐸 1 𝑢 𝑛 , 𝑤 𝑛 = 𝐽 𝑀 2 , 𝜆 2 𝑣 𝑛 − 𝜆 2 𝐸 2 𝑣 𝑛 , 𝑦 𝑛 , 𝑖 = 𝛼 𝑛 , 𝑖 𝑥 0 + 1 − 𝛼 𝑛 , 𝑖 1 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 𝐶 𝑑 𝑠 , 𝑛 + 1 , 𝑖 = 𝑧 ∈ 𝐶 𝑛 , 𝑖 ∶ ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑧 2 ≤ ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑧 2 + 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ 2 + 2 ⟨ 𝑥 𝑛 − 𝑥 0 , 𝐶 , 𝑧 ⟩ 𝑛 + 1 = ∞ 𝑖 = 1 𝐶 𝑛 + 1 , 𝑖 , 𝑥 𝑛 + 1 = 𝑃 𝐶 𝑛 + 1 𝑥 0 , ( 3 . 1 ) for every 𝑛 ≥ 0 , where { 𝛼 𝑛 , 𝑖 } ∞ 𝑛 = 1 ⊂ ( 0 , 1 ) , { 𝑟 𝑛 } , { 𝑞 𝑛 } ⊂ ( 0 , ∞ ) , 𝜆 1 ∈ ( 0 , 2 𝜂 1 ) , and 𝜆 2 ∈ ( 0 , 2 𝜂 2 ) satisfy the following conditions: (i) 0 < 𝑎 ≤ 𝑟 𝑛 ≤ 𝑏 < 2 𝛼 ,(ii) 0 < 𝑐 ≤ 𝑞 𝑛 ≤ 𝑑 < 2 𝛽 ,(iii) l i m 𝑛 → ∞ 𝛼 𝑛 , 𝑖 = 0 , (iv) 0 < 𝑒 ≤ 𝜆 1 ≤ 𝑓 < 2 𝜂 1 ,(v) 0 < 𝑔 ≤ 𝜆 2 ≤ 𝑗 < 2 𝜂 2 ,
then { 𝑥 𝑛 } converges strongly to 𝑃 Θ 𝑥 0 .

Proof. First, we show that 𝐼 − 𝜆 1 𝐸 1 and 𝐼 − 𝜆 2 𝐸 2 are nonexpansive. Indeed, for all 𝑥 , 𝑦 ∈ 𝐶 and 𝜆 1 ∈ ( 0 , 2 𝜂 1 ) , we obtain ‖ ‖ 𝐼 − 𝜆 1 𝐸 1 𝑥 − 𝐼 − 𝜆 1 𝐸 1 𝑦 ‖ ‖ 2 = ‖ ‖ 𝑥 − 𝑦 − 𝜆 1 𝐸 1 𝑥 − 𝐸 1 𝑦 ‖ ‖ 2 = ‖ 𝑥 − 𝑦 ‖ 2 − 2 𝜆 1 ⟨ 𝑥 − 𝑦 , 𝐸 1 𝑥 − 𝐸 1 𝑦 ⟩ + 𝜆 2 1 ‖ ‖ 𝐸 1 𝑥 − 𝐸 1 𝑦 ‖ ‖ 2 ≤ ‖ 𝑥 − 𝑦 ‖ 2 − 2 𝜆 1 𝜂 1 ‖ ‖ 𝐸 1 𝑥 − 𝐸 1 𝑦 ‖ ‖ 2 + 𝜆 2 1 ‖ ‖ 𝐸 1 𝑥 − 𝐸 1 𝑦 ‖ ‖ 2 ≤ ‖ 𝑥 − 𝑦 ‖ 2 + 𝜆 1 𝜆 1 − 2 𝜂 1 ‖ ‖ 𝐸 1 𝑥 − 𝐸 1 𝑦 ‖ ‖ 2 ≤ ‖ 𝑥 − 𝑦 ‖ 2 , ( 3 . 2 ) which implies that the mapping 𝐼 − 𝜆 1 𝐸 1 is nonexpansive, so is 𝐼 − 𝜆 2 𝐸 2 . Let 𝑝 ∈ Θ . We observe that ‖ ‖ 𝑤 𝑛 ‖ ‖ − 𝑝 2 = ‖ ‖ 𝐽 𝑀 2 , 𝜆 2 𝑣 𝑛 − 𝜆 2 𝐸 2 𝑣 𝑛 − 𝐽 𝑀 2 , 𝜆 2 𝑝 − 𝜆 2 𝐸 2 𝑝 ‖ ‖ 2 ≤ ‖ ‖ 𝑣 𝑛 − 𝜆 2 𝐸 2 𝑣 𝑛 − 𝑝 − 𝜆 2 𝐸 2 𝑝 ‖ ‖ 2 ≤ ‖ ‖ 𝑣 𝑛 ‖ ‖ − 𝑝 2 = ‖ ‖ 𝐽 𝑀 1 , 𝜆 1 𝑢 𝑛 − 𝜆 1 𝐸 1 𝑢 𝑛 − 𝐽 𝑀 1 , 𝜆 1 𝑝 − 𝜆 1 𝐸 1 𝑝 ‖ ‖ 2 ≤ ‖ ‖ 𝑢 𝑛 − 𝜆 1 𝐸 1 𝑢 𝑛 − 𝑝 − 𝜆 1 𝐸 1 𝑝 ‖ ‖ 2 = ‖ ‖ 𝑢 𝑛 ‖ ‖ − 𝑝 2 . ( 3 . 3 ) Since both 𝐼 − 𝑟 𝑛 𝐴 and 𝐼 − 𝑞 𝑛 𝐵 are nonexpansive for each 𝑛 ≥ 1 , let 𝑝 ∈ Θ , then 𝑝 = 𝑇 𝐹 1 , 𝜑 1 𝑟 𝑛 ( 𝑝 − 𝑟 𝑛 𝐴 𝑝 ) and 𝑝 = 𝑇 𝐹 2 , 𝜑 2 𝑞 𝑛 ( 𝑝 − 𝑞 𝑛 𝐵 𝑝 ) ; by conditions (i) and (ii), we have ‖ ‖ 𝑢 𝑛 ‖ ‖ − 𝑝 2 = ‖ ‖ 𝑇 ( 𝐹 2 , 𝜑 2 ) 𝑞 𝑛 𝐼 − 𝑞 𝑛 𝐵 𝑡 𝑛 − 𝑇 ( 𝐹 2 , 𝜑 2 ) 𝑞 𝑛 𝐼 − 𝑞 𝑛 𝐵 𝑝 ‖ ‖ 2 ≤ ‖ ‖ 𝐼 − 𝑞 𝑛 𝐵 𝑡 𝑛 − 𝐼 − 𝑞 𝑛 𝐵 𝑝 ‖ ‖ 2 ≤ ‖ ‖ 𝑡 𝑛 ‖ ‖ − 𝑝 2 + 𝑞 𝑛 𝑞 𝑛 ‖ ‖ − 2 𝛽 𝐵 𝑡 𝑛 ‖ ‖ − 𝐵 𝑝 2 ≤ ‖ ‖ 𝑡 𝑛 ‖ ‖ − 𝑝 2 , ‖ ‖ 𝑡 𝑛 ‖ ‖ − 𝑝 2 = ‖ ‖ 𝑇 ( 𝐹 1 , 𝜑 1 ) 𝑟 𝑛 𝐼 − 𝑟 𝑛 𝐴 𝑥 𝑛 − 𝑇 ( 𝐹 1 , 𝜑 1 ) 𝑟 𝑛 𝐼 − 𝑟 𝑛 𝐴 𝑝 ‖ ‖ 2 ≤ ‖ ‖ 𝐼 − 𝑟 𝑛 𝐴 𝑥 𝑛 − 𝐼 − 𝑟 𝑛 𝐴 𝑝 ‖ ‖ 2 ≤ ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 + 𝑟 𝑛 𝑟 𝑛 ‖ ‖ − 2 𝛼 𝐴 𝑥 𝑛 ‖ ‖ − 𝐴 𝑝 2 ≤ ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 . ( 3 . 4 ) Therefore, we get ‖ ‖ 𝑢 𝑛 ‖ ‖ ≤ ‖ ‖ 𝑥 − 𝑝 𝑛 ‖ ‖ . − 𝑝 ( 3 . 5 ) Next, we will divide the proof into five steps.
Step 1. We show that { 𝑥 𝑛 } is well defined. Let 𝑛 = 1 , then 𝐶 1 , 𝑖 = 𝐶 is closed and convex for each 𝑖 ≥ 1 . Suppose that 𝐶 𝑛 , 𝑖 is closed convex for some 𝑛 > 1 , then, from the definition of 𝐶 𝑛 + 1 , 𝑖 , we know that 𝐶 𝑛 + 1 , 𝑖 is closed convex for the same 𝑛 ≥ 1 . Hence, 𝐶 𝑛 , 𝑖 is closed convex for 𝑛 ≥ 1 and for each 𝑖 ≥ 1 . This implies that 𝐶 𝑛 is closed convex for 𝑛 ≥ 1 . Furthermore, we show that Θ ⊂ 𝐶 𝑛 . For 𝑛 = 1 , Θ ⊂ 𝐶 = 𝐶 1 , 𝑖 . For 𝑛 ≥ 2 , let 𝑝 ∈ Θ , then ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 = ‖ ‖ ‖ 𝛼 𝑛 , 𝑖 𝑥 0 + − 𝑝 1 − 𝛼 𝑛 , 𝑖 ( 1 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 ‖ ‖ ‖ 𝑑 𝑠 − 𝑝 ) 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ ‖ 1 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 ‖ ‖ ‖ 𝑑 𝑠 − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑤 𝑛 ‖ ‖ − 𝑝 2 = ‖ ‖ 𝑤 𝑛 ‖ ‖ − 𝑝 2 + 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑤 𝑛 ‖ ‖ − 𝑝 2 ≤ ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 + 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ 2 + 2 ⟨ 𝑥 𝑛 − 𝑥 0 , , 𝑝 ⟩ ( 3 . 6 ) which shows that 𝑝 ∈ 𝐶 𝑛 , 𝑖 , ∀ 𝑛 ≥ 2 , ∀ 𝑖 ≥ 1 . Thus, Θ ⊂ 𝐶 𝑛 , 𝑖 , ∀ 𝑛 ≥ 1 , ∀ 𝑖 ≥ 1 . Hence, it follows that ∅ ≠ Θ ⊂ 𝐶 𝑛 , ∀ 𝑛 ≥ 1 . This implies that { 𝑥 𝑛 } is well defined.Step 2. We claim that l i m 𝑛 → ∞ ‖ 𝑥 𝑛 + 1 − 𝑥 𝑛 ‖ = 0 and l i m 𝑛 → ∞ ‖ 𝑦 𝑛 , 𝑖 − 𝑥 𝑛 ‖ = 0 , for 𝑖 ≥ 1 . Since 𝑥 𝑛 = 𝑃 𝐶 𝑛 𝑥 0 and 𝑥 𝑛 + 1 = 𝑃 𝐶 𝑛 + 1 𝑥 0 ∈ 𝐶 𝑛 + 1 ⊂ 𝐶 𝑛 , ∀ 𝑛 ≥ 1 , we have ‖ ‖ 𝑥 𝑛 − 𝑥 0 ‖ ‖ ≤ ‖ ‖ 𝑥 𝑛 + 1 − 𝑥 0 ‖ ‖ , ∀ 𝑛 ≥ 1 . ( 3 . 7 ) Also, as Θ ⊂ 𝐶 𝑛 by (2.1), it follows that ‖ ‖ 𝑥 𝑛 − 𝑥 0 ‖ ‖ ≤ ‖ ‖ 𝑧 − 𝑥 0 ‖ ‖ , 𝑧 ∈ Θ , ∀ 𝑛 ≥ 1 . ( 3 . 8 ) Form (3.7) and (3.8), we have that l i m 𝑛 → ∞ ‖ 𝑥 𝑛 − 𝑥 0 ‖ exists. Hence, { 𝑥 𝑛 } is bounded and so are { 𝑦 𝑛 , 𝑖 } , ∀ 𝑖 ≥ 1 , { 𝑤 𝑛 } , { 𝑣 𝑛 } , { 𝑢 𝑛 } , { 𝑡 𝑛 } , { 𝐴 𝑥 𝑛 } , { 𝐵 𝑡 𝑛 } , { 𝐸 1 𝑢 𝑛 } , { 𝐸 2 𝑣 𝑛 } , { 𝑊 𝑛 𝑤 𝑛 } , and { ( 1 / 𝑡 𝑛 ) ∫ 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 𝑑 𝑠 } . For 𝑚 > 𝑛 ≥ 1 , we have that 𝑥 𝑚 = 𝑃 𝐶 𝑚 𝑥 0 ∈ 𝐶 𝑚 ⊂ 𝐶 𝑛 . By (2.5), we obtain ‖ ‖ 𝑥 𝑚 − 𝑥 𝑛 ‖ ‖ 2 ≤ ‖ ‖ 𝑥 𝑛 − 𝑥 0 ‖ ‖ 2 − ‖ ‖ 𝑥 𝑚 − 𝑥 0 ‖ ‖ 2 . ( 3 . 9 ) Letting 𝑚 , 𝑛 → ∞ and taking the limit in (3.9), we have ‖ 𝑥 𝑚 − 𝑥 𝑛 ‖ → 0 , which shows that { 𝑥 𝑛 } is Cauchy. In particular, l i m 𝑛 → ∞ ‖ ‖ 𝑥 𝑛 + 1 − 𝑥 𝑛 ‖ ‖ = 0 . ( 3 . 1 0 ) Since { 𝑥 𝑛 } is Cauchy, we assume that 𝑥 𝑛 → 𝑧 ∈ 𝐶 . Since 𝑥 𝑛 + 1 = 𝑃 𝐶 𝑛 + 1 𝑥 0 ∈ 𝐶 𝑛 + 1 , then ‖ ‖ 𝑦 𝑛 , 𝑖 − 𝑥 𝑛 + 1 ‖ ‖ 2 ≤ ‖ ‖ 𝑥 𝑛 − 𝑥 𝑛 + 1 ‖ ‖ 2 + 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ 2 𝑥 + 2 𝑛 − 𝑥 0 , 𝑥 𝑛 + 1 ⟶ 0 , ( 3 . 1 1 ) and it follows that ‖ ‖ 𝑦 𝑛 , 𝑖 − 𝑥 𝑛 ‖ ‖ ≤ ‖ ‖ 𝑦 𝑛 , 𝑖 − 𝑥 𝑛 + 1 ‖ ‖ + ‖ ‖ 𝑥 𝑛 + 1 − 𝑥 𝑛 ‖ ‖ . ( 3 . 1 2 ) Therefore, l i m 𝑛 → ∞ ‖ ‖ 𝑦 𝑛 , 𝑖 − 𝑥 𝑛 ‖ ‖ = 0 , ∀ 𝑖 ≥ 1 . ( 3 . 1 3 ) Step 3. We claim that the following statements hold: (1) l i m 𝑛 → ∞ ‖ 𝑢 𝑛 − 𝑡 𝑛 ‖ = 0 ,(2) l i m 𝑛 → ∞ ‖ 𝑡 𝑛 − 𝑥 𝑛 ‖ = 0 ,(3) l i m 𝑛 → ∞ ‖ 𝑤 𝑛 − 𝑣 𝑛 ‖ = 0 ,(4) l i m 𝑛 → ∞ ‖ 𝑣 𝑛 − 𝑢 𝑛 ‖ = 0 .
For 𝑝 ∈ Θ , from (3.4), and (3.6), we obtain ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑤 𝑛 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑢 𝑛 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑡 𝑛 ‖ ‖ − 𝑝 2 + 𝑞 𝑛 𝑞 𝑛 ‖ ‖ − 2 𝛽 𝐵 𝑡 𝑛 ‖ ‖ − 𝐵 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 𝑞 𝑛 𝑞 𝑛 ‖ ‖ − 2 𝛽 𝐵 𝑡 𝑛 ‖ ‖ − 𝐵 𝑝 2 . ( 3 . 1 4 ) Since 0 < 𝑐 ≤ 𝑞 𝑛 ≤ 𝑑 < 2 𝛽 , we have 1 − 𝛼 𝑛 , 𝑖 𝑞 𝑛 2 𝛽 − 𝑞 𝑛 ‖ ‖ 𝐵 𝑡 𝑛 ‖ ‖ − 𝐵 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 − 𝑦 𝑛 , 𝑖 ‖ ‖ ‖ ‖ 𝑥 𝑛 ‖ ‖ + ‖ ‖ 𝑦 − 𝑝 𝑛 , 𝑖 ‖ ‖ . − 𝑝 ( 3 . 1 5 ) Hence, by condition (iii) and (3.13), we have l i m 𝑛 → ∞ ‖ ‖ 𝐵 𝑡 𝑛 ‖ ‖ − 𝐵 𝑝 = 0 . ( 3 . 1 6 ) From (3.6), we have ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑤 𝑛 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑢 𝑛 ‖ ‖ − 𝑝 2 . ( 3 . 1 7 ) On the other hand, ‖ ‖ 𝑢 𝑛 ‖ ‖ − 𝑝 2 = ‖ ‖ 𝑇 ( 𝐹 2 , 𝜑 2 ) 𝑞 𝑛 𝑡 𝑛 − 𝑞 𝑛 𝐵 𝑡 𝑛 − 𝑇 ( 𝐹 2 , 𝜑 2 ) 𝑞 𝑛 𝑝 − 𝑞 𝑛 ‖ ‖ 𝐵 𝑝 2 ≤ 𝑡 𝑛 − 𝑞 𝑛 𝐵 𝑡 𝑛 − 𝑝 − 𝑞 𝑛 𝐵 𝑝 , 𝑢 𝑛 = 1 − 𝑝 2 ‖ ‖ 𝑡 𝑛 − 𝑞 𝑛 𝐵 𝑡 𝑛 − 𝑝 − 𝑞 𝑛 ‖ ‖ 𝐵 𝑝 2 + ‖ ‖ 𝑢 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑡 𝑛 − 𝑞 𝑛 𝐵 𝑡 𝑛 − 𝑝 − 𝑞 𝑛 − 𝑢 𝐵 𝑝 𝑛 ‖ ‖ − 𝑝 2 ≤ 1 2 ‖ ‖ 𝑡 𝑛 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑢 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑡 𝑛 − 𝑞 𝑛 𝐵 𝑡 𝑛 − 𝑝 − 𝑞 𝑛 − 𝑢 𝐵 𝑝 𝑛 ‖ ‖ − 𝑝 2 ≤ 1 2 ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑢 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑢 𝑛 − 𝑡 𝑛 ‖ ‖ 2 + 2 𝑞 𝑛 ⟨ 𝑡 𝑛 − 𝑢 𝑛 , 𝐵 𝑡 𝑛 − 𝐵 𝑝 ⟩ − 𝑠 2 𝑛 ‖ ‖ 𝐵 𝑡 𝑛 ‖ ‖ − 𝐵 𝑝 2 , ( 3 . 1 8 ) and hence, ‖ ‖ 𝑢 𝑛 ‖ ‖ − 𝑝 2 ≤ ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑢 𝑛 − 𝑡 𝑛 ‖ ‖ 2 + 2 𝑞 𝑛 ‖ ‖ 𝑡 𝑛 − 𝑢 𝑛 ‖ ‖ ‖ ‖ 𝐵 𝑡 𝑛 ‖ ‖ . − 𝐵 𝑝 ( 3 . 1 9 ) Putting (3.19) into (3.17), for 𝑖 ≥ 1 , we have ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑢 𝑛 − 𝑡 𝑛 ‖ ‖ 2 + 2 𝑞 𝑛 ‖ ‖ 𝑡 𝑛 − 𝑢 𝑛 ‖ ‖ ‖ ‖ 𝐵 𝑡 𝑛 ‖ ‖ − 𝐵 𝑝 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑢 𝑛 − 𝑡 𝑛 ‖ ‖ 2 + 2 𝑞 𝑛 ‖ ‖ 𝑡 𝑛 − 𝑢 𝑛 ‖ ‖ ‖ ‖ 𝐵 𝑡 𝑛 ‖ ‖ . − 𝐵 𝑝 ( 3 . 2 0 ) It follows that 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑢 𝑛 − 𝑡 𝑛 ‖ ‖ 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 + 2 𝑞 𝑛 ‖ ‖ 𝑡 𝑛 − 𝑢 𝑛 ‖ ‖ ‖ ‖ 𝐵 𝑡 𝑛 ‖ ‖ − 𝐵 𝑝 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 − 𝑦 𝑛 , 𝑖 ‖ ‖ ‖ ‖ 𝑥 𝑛 ‖ ‖ + ‖ ‖ 𝑦 − 𝑝 𝑛 , 𝑖 ‖ ‖ − 𝑝 + 2 𝑞 𝑛 ‖ ‖ 𝑡 𝑛 − 𝑢 𝑛 ‖ ‖ ‖ ‖ 𝐵 𝑡 𝑛 ‖ ‖ . − 𝐵 𝑝 ( 3 . 2 1 ) Therefore, from condition (iii), (3.13), and (3.16), we have l i m 𝑛 → ∞ ‖ ‖ 𝑢 𝑛 − 𝑡 𝑛 ‖ ‖ = 0 . ( 3 . 2 2 ) Furthermore, from (3.4), and (3.6), we get ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑤 𝑛 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑢 𝑛 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑡 𝑛 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 + 𝑟 𝑛 𝑟 𝑛 ‖ ‖ − 2 𝛼 𝐴 𝑥 𝑛 ‖ ‖ − 𝐴 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 𝑟 𝑛 𝑟 𝑛 ‖ ‖ − 2 𝛼 𝐴 𝑥 𝑛 ‖ ‖ − 𝐴 𝑝 2 . ( 3 . 2 3 ) Since 0 < 𝑎 ≤ 𝑟 𝑛 ≤ 𝑏 < 2 𝛼 , we have 1 − 𝛼 𝑛 , 𝑖 𝑟 𝑛 2 𝛼 − 𝑟 𝑛 ‖ ‖ 𝐴 𝑥 𝑛 ‖ ‖ − 𝐴 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 − 𝑦 𝑛 , 𝑖 ‖ ‖ ‖ ‖ 𝑥 𝑛 ‖ ‖ + ‖ ‖ 𝑦 − 𝑝 𝑛 , 𝑖 ‖ ‖ . − 𝑝 ( 3 . 2 4 ) Then, by condition (iii) and (3.13), we obtain that l i m 𝑛 → ∞ ‖ ‖ 𝐴 𝑥 𝑛 ‖ ‖ − 𝐴 𝑝 = 0 . ( 3 . 2 5 ) From (3.6), we have ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑤 𝑛 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑢 𝑛 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑡 𝑛 ‖ ‖ − 𝑝 2 . ( 3 . 2 6 ) On the other hand, we note that ‖ ‖ 𝑡 𝑛 ‖ ‖ − 𝑝 2 ≤ ‖ ‖ 𝑇 ( 𝐹 1 , 𝜑 1 ) 𝑟 𝑛 𝑥 𝑛 − 𝑟 𝑛 𝐴 𝑥 𝑛 − 𝑇 ( 𝐹 1 , 𝜑 1 ) 𝑟 𝑛 𝑝 − 𝑟 𝑛 ‖ ‖ 𝐴 𝑝 2 ≤ 𝑥 𝑛 − 𝑟 𝑛 𝐴 𝑥 𝑛 − 𝑝 − 𝑟 𝑛 𝐴 𝑝 , 𝑡 𝑛 = 1 − 𝑝 2 ‖ ‖ 𝑥 𝑛 − 𝑟 𝑛 𝐴 𝑥 𝑛 − 𝑝 − 𝑟 𝑛 ‖ ‖ 𝐴 𝑝 2 + ‖ ‖ 𝑡 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑥 𝑛 − 𝑟 𝑛 𝐴 𝑥 𝑛 − 𝑝 − 𝑟 𝑛 − 𝑡 𝐴 𝑝 𝑛 ‖ ‖ − 𝑝 2 ≤ 1 2 ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑡 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑥 𝑛 − 𝑟 𝑛 𝐴 𝑥 𝑛 − 𝑝 − 𝑟 𝑛 − 𝑡 𝐴 𝑝 𝑛 ‖ ‖ − 𝑝 2 = 1 2 ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑡 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑡 𝑛 − 𝑥 𝑛 ‖ ‖ 2 + 2 𝑟 𝑛 ⟨ 𝑥 𝑛 − 𝑡 𝑛 , 𝐴 𝑥 𝑛 − 𝐴 𝑝 ⟩ − 𝑟 2 𝑛 ‖ ‖ 𝐴 𝑥 𝑛 ‖ ‖ − 𝐴 𝑝 2 , ( 3 . 2 7 ) and hence, ‖ ‖ 𝑡 𝑛 ‖ ‖ − 𝑝 2 ≤ ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑡 𝑛 − 𝑥 𝑛 ‖ ‖ 2 + 2 𝑟 𝑛 ‖ ‖ 𝑥 𝑛 − 𝑡 𝑛 ‖ ‖ ‖ ‖ 𝐴 𝑥 𝑛 ‖ ‖ . − 𝐴 𝑝 ( 3 . 2 8 ) Putting (3.28) into (3.26), we have ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑡 𝑛 − 𝑥 𝑛 ‖ ‖ 2 + 2 𝑟 𝑛 ‖ ‖ 𝑥 𝑛 − 𝑡 𝑛 ‖ ‖ ‖ ‖ 𝐴 𝑥 𝑛 ‖ ‖ − 𝐴 𝑝 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑡 𝑛 − 𝑥 𝑛 ‖ ‖ 2 + 2 𝑟 𝑛 ‖ ‖ 𝑥 𝑛 − 𝑡 𝑛 ‖ ‖ ‖ ‖ 𝐴 𝑥 𝑛 ‖ ‖ . − 𝐴 𝑝 ( 3 . 2 9 ) It follows that 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 𝑛 − 𝑡 𝑛 ‖ ‖ 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 + 2 𝑟 𝑛 ‖ ‖ 𝑥 𝑛 − 𝑧 𝑛 ‖ ‖ ‖ ‖ 𝐴 𝑥 𝑛 ‖ ‖ − 𝐴 𝑝 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 − 𝑦 𝑛 , 𝑖 ‖ ‖ ‖ ‖ 𝑥 𝑛 ‖ ‖ + ‖ ‖ 𝑦 − 𝑝 𝑛 , 𝑖 ‖ ‖ − 𝑝 + 2 𝑟 𝑛 ‖ ‖ 𝑥 𝑛 − 𝑧 𝑛 ‖ ‖ ‖ ‖ 𝐴 𝑥 𝑛 ‖ ‖ . − 𝐴 𝑝 ( 3 . 3 0 ) Therefore, by condition (iii), (3.13), and (3.25), we have l i m 𝑛 → ∞ ‖ ‖ 𝑥 𝑛 − 𝑡 𝑛 ‖ ‖ = 0 . ( 3 . 3 1 ) Condition (iii) implies that ‖ ‖ ‖ 𝑦 𝑛 , 𝑖 − 1 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 ‖ ‖ ‖ 𝑑 𝑠 2 = 𝛼 𝑛 , 𝑖 ‖ ‖ ‖ 𝑥 0 − 1 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 ‖ ‖ ‖ 𝑑 𝑠 ⟶ 0 . ( 3 . 3 2 ) It follows that ‖ ‖ ‖ 𝑥 𝑛 − 1 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 ‖ ‖ ‖ ≤ ‖ ‖ 𝑥 𝑑 𝑠 𝑛 − 𝑦 𝑛 , 𝑖 ‖ ‖ + ‖ ‖ ‖ 𝑦 𝑛 , 𝑖 + 1 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 ‖ ‖ ‖ 𝑑 𝑠 ⟶ 0 . ( 3 . 3 3 ) From (3.6), we have ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑤 𝑛 ‖ ‖ − 𝑝 2 = 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝐽 𝑀 2 , 𝜆 2 ( 𝑣 𝑛 − 𝜆 2 𝐸 2 𝑣 𝑛 ) − 𝐽 𝑀 2 , 𝜆 2 ( 𝑝 − 𝜆 2 𝐸 2 ‖ ‖ 𝑝 ) 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ ( 𝑣 𝑛 − 𝜆 2 𝐸 2 𝑣 𝑛 ) − ( 𝑝 − 𝜆 2 𝐸 2 ‖ ‖ 𝑝 ) 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑣 𝑛 ‖ ‖ − 𝑝 2 + 𝜆 2 𝜆 2 − 2 𝜂 2 ‖ ‖ 𝐸 2 𝑣 𝑛 − 𝐸 2 𝑝 ‖ ‖ 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 𝜆 2 𝜆 2 − 2 𝜂 2 ‖ ‖ 𝐸 2 𝑣 𝑛 − 𝐸 2 𝑝 ‖ ‖ 2 . ( 3 . 3 4 ) Since 0 < 𝑔 ≤ 𝜆 2 ≤ 𝑗 < 2 𝜂 2 , we have 1 − 𝛼 𝑛 , 𝑖 𝜆 2 2 𝜂 2 − 𝜆 2 ‖ ‖ 𝐸 2 𝑣 𝑛 − 𝐸 2 𝑝 ‖ ‖ 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 − 𝑦 𝑛 , 𝑖 ‖ ‖ ‖ ‖ 𝑥 𝑛 ‖ ‖ + ‖ ‖ 𝑦 − 𝑝 𝑛 , 𝑖 ‖ ‖ . − 𝑝 ( 3 . 3 5 ) Then, by condition (iii) and (3.13), we obtain that l i m 𝑛 → ∞ ‖ ‖ 𝐸 2 𝑣 𝑛 − 𝐸 2 𝑝 ‖ ‖ = 0 . ( 3 . 3 6 ) From (3.6), we have ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑤 𝑛 ‖ ‖ − 𝑝 2 . ( 3 . 3 7 ) On the other hand, we note that ‖ ‖ 𝑤 𝑛 ‖ ‖ − 𝑝 2 ≤ ‖ ‖ 𝐽 𝑀 2 , 𝜆 2 𝑣 𝑛 − 𝜆 2 𝐸 2 𝑣 𝑛 − 𝐽 𝑀 2 , 𝜆 2 𝑝 − 𝜆 2 𝐸 2 𝑝 ‖ ‖ 2 𝑣 ≤ ⟨ 𝑛 − 𝜆 2 𝐸 2 𝑣 𝑛 − 𝑝 − 𝜆 2 𝐸 2 𝑝 , 𝑤 𝑛 = 1 − 𝑝 ⟩ 2 ‖ ‖ 𝑣 𝑛 − 𝜆 2 𝐸 2 𝑣 𝑛 − 𝑝 − 𝜆 2 𝐸 2 𝑝 ‖ ‖ 2 + ‖ ‖ 𝑤 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑣 𝑛 − 𝜆 2 𝐸 2 𝑣 𝑛 − 𝑝 − 𝜆 2 𝐸 2 𝑝 − 𝑤 𝑛 ‖ ‖ − 𝑝 2 ≤ 1 2 ‖ ‖ 𝑣 𝑛 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑤 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ ( 𝑣 𝑛 − 𝜆 2 𝐸 2 𝑣 𝑛 ) − ( 𝑝 − 𝜆 2 𝐸 2 𝑝 ) − ( 𝑤 𝑛 ‖ ‖ − 𝑝 ) 2 ≤ 1 2 ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑤 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑤 𝑛 − 𝑣 𝑛 ‖ ‖ 2 + 2 𝜆 2 ⟨ 𝑣 𝑛 − 𝑤 𝑛 , 𝐸 2 𝑣 𝑛 − 𝐸 2 𝑝 ⟩ − 𝜆 2 2 ‖ ‖ 𝐸 2 𝑣 𝑛 − 𝐸 2 𝑝 ‖ ‖ 2 , ( 3 . 3 8 ) and hence, ‖ ‖ 𝑤 𝑛 ‖ ‖ − 𝑝 2 ≤ ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑤 𝑛 − 𝑣 𝑛 ‖ ‖ 2 + 2 𝜆 2 ‖ ‖ 𝑣 𝑛 − 𝑤 𝑛 ‖ ‖ ‖ ‖ 𝐸 2 𝑣 𝑛 − 𝐸 2 𝑝 ‖ ‖ . ( 3 . 3 9 ) Putting (3.39) into (3.37), ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑤 𝑛 − 𝑣 𝑛 ‖ ‖ 2 + 2 𝜆 2 ‖ ‖ 𝑣 𝑛 − 𝑤 𝑛 ‖ ‖ ‖ ‖ 𝐸 2 𝑣 𝑛 − 𝐸 2 𝑝 ‖ ‖ ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑤 𝑛 − 𝑣 𝑛 ‖ ‖ 2 + 2 𝜆 2 ‖ ‖ 𝑣 𝑛 − 𝑤 𝑛 ‖ ‖ ‖ ‖ 𝐸 2 𝑣 𝑛 − 𝐸 2 𝑝 ‖ ‖ , ( 3 . 4 0 ) this implies that 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑤 𝑛 − 𝑣 𝑛 ‖ ‖ 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 + 2 𝜆 2 ‖ ‖ 𝑤 𝑛 − 𝑣 𝑛 ‖ ‖ ‖ ‖ 𝐸 2 𝑣 𝑛 − 𝐸 2 𝑝 ‖ ‖ ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 − 𝑦 𝑛 , 𝑖 ‖ ‖ ‖ ‖ 𝑥 𝑛 ‖ ‖ + ‖ ‖ 𝑦 − 𝑝 𝑛 , 𝑖 ‖ ‖ − 𝑝 + 2 𝜆 2 ‖ ‖ 𝑤 𝑛 − 𝑣 𝑛 ‖ ‖ ‖ ‖ 𝐸 2 𝑣 𝑛 − 𝐸 2 𝑝 ‖ ‖ . ( 3 . 4 1 ) Therefore, by condition (iii), (3.13), and (3.36), we have l i m 𝑛 → ∞ ‖ ‖ 𝑤 𝑛 − 𝑣 𝑛 ‖ ‖ = 0 . ( 3 . 4 2 ) Furthermore, from (3.6), we have ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑤 𝑛 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑣 𝑛 ‖ ‖ − 𝑝 2 = 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝐽 𝑀 1 , 𝜆 1 ( 𝑢 𝑛 − 𝜆 1 𝐸 1 𝑢 𝑛 ) − 𝐽 𝑀 1 , 𝜆 1 ( 𝑝 − 𝜆 1 𝐸 1 ‖ ‖ 𝑝 ) 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ ( 𝑢 𝑛 − 𝜆 1 𝐸 1 𝑢 𝑛 ) − ( 𝑝 − 𝜆 1 𝐸 1 ‖ ‖ 𝑝 ) 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑢 𝑛 ‖ ‖ − 𝑝 2 + 𝜆 1 𝜆 1 − 2 𝜂 1 ‖ ‖ 𝐸 1 𝑢 𝑛 − 𝐸 1 𝑝 ‖ ‖ 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 𝜆 1 𝜆 1 − 2 𝜂 1 ‖ ‖ 𝐸 1 𝑢 𝑛 − 𝐸 1 𝑝 ‖ ‖ 2 . ( 3 . 4 3 ) Since 0 < 𝑒 ≤ 𝜆 1 ≤ 𝑓 < 2 𝜂 1 , we have 1 − 𝛼 𝑛 , 𝑖 𝜆 1 2 𝜂 1 − 𝜆 1 ‖ ‖ 𝐸 1 𝑢 𝑛 − 𝐸 1 𝑝 ‖ ‖ 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 − 𝑦 𝑛 , 𝑖 ‖ ‖ ‖ ‖ 𝑥 𝑛 ‖ ‖ + ‖ ‖ 𝑦 − 𝑝 𝑛 , 𝑖 ‖ ‖ . − 𝑝 ( 3 . 4 4 ) Then, by condition (iii) and (3.13), we obtain that l i m 𝑛 → ∞ ‖ ‖ 𝐸 1 𝑢 𝑛 − 𝐸 1 𝑝 ‖ ‖ = 0 . ( 3 . 4 5 ) From (3.6), we have ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑤 𝑛 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑣 𝑛 ‖ ‖ − 𝑝 2 . ( 3 . 4 6 ) On the other hand, we note that ‖ ‖ 𝑣 𝑛 ‖ ‖ − 𝑝 2 ≤ ‖ ‖ 𝐽 𝑀 1 , 𝜆 1 ( 𝑢 𝑛 − 𝜆 1 𝐸 1 𝑢 𝑛 ) − 𝐽 𝑀 1 , 𝜆 1 ( 𝑝 − 𝜆 1 𝐸 1 ‖ ‖ 𝑝 ) 2 ≤ 𝑢 𝑛 − 𝜆 1 𝐸 1 𝑢 𝑛 − 𝑝 − 𝜆 1 𝐸 1 𝑝 , 𝑣 𝑛 = 1 − 𝑝 2 ‖ ‖ 𝑢 𝑛 − 𝜆 1 𝐸 1 𝑢 𝑛 − 𝑝 − 𝜆 1 𝐸 1 𝑝 ‖ ‖ 2 + ‖ ‖ 𝑣 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑢 𝑛 − 𝜆 1 𝐸 1 𝑢 𝑛 − 𝑝 − 𝜆 1 𝐸 1 𝑝 − 𝑣 𝑛 ‖ ‖ − 𝑝 2 ≤ 1 2 ‖ ‖ 𝑢 𝑛 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑣 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑢 𝑛 − 𝜆 1 𝐸 1 𝑢 𝑛 − 𝑝 − 𝜆 1 𝐸 1 𝑝 − 𝑣 𝑛 ‖ ‖ − 𝑝 2 ≤ 1 2 ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑣 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑣 𝑛 − 𝑢 𝑛 ‖ ‖ 2 + 2 𝜆 1 ⟨ 𝑢 𝑛 − 𝑣 𝑛 , 𝐸 1 𝑢 𝑛 − 𝐸 1 𝑝 ⟩ − 𝜆 2 1 ‖ ‖ 𝐸 1 𝑢 𝑛 − 𝐸 1 𝑝 ‖ ‖ 2 , ( 3 . 4 7 ) and hence, ‖ ‖ 𝑣 𝑛 ‖ ‖ − 𝑝 2 ≤ ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑣 𝑛 − 𝑢 𝑛 ‖ ‖ 2 + 2 𝜆 1 ‖ ‖ 𝑢 𝑛 − 𝑣 𝑛 ‖ ‖ ‖ ‖ 𝐸 1 𝑢 𝑛 − 𝐸 1 𝑝 ‖ ‖ . ( 3 . 4 8 ) Putting (3.48) into (3.46), ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑣 𝑛 − 𝑢 𝑛 ‖ ‖ 2 + 2 𝜆 1 ‖ ‖ 𝑢 𝑛 − 𝑣 𝑛 ‖ ‖ ‖ ‖ 𝐸 1 𝑢 𝑛 − 𝐸 1 𝑝 ‖ ‖ ≤ 𝛼 𝑛 , i ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑣 𝑛 − 𝑢 𝑛 ‖ ‖ 2 + 2 𝜆 1 ‖ ‖ 𝑢 𝑛 − 𝑣 𝑛 ‖ ‖ ‖ ‖ 𝐸 1 𝑢 𝑛 − 𝐸 1 𝑝 ‖ ‖ , ( 3 . 4 9 ) this implies that 1 − 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑣 𝑛 − 𝑢 𝑛 ‖ ‖ 2 ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑝 2 − ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑝 2 + 2 𝜆 1 ‖ ‖ 𝑣 𝑛 − 𝑢 𝑛 ‖ ‖ ‖ ‖ 𝐸 1 𝑢 𝑛 − 𝐸 1 𝑝 ‖ ‖ ≤ 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ − 𝑝 2 + ‖ ‖ 𝑥 𝑛 − 𝑦 𝑛 , 𝑖 ‖ ‖ ‖ ‖ 𝑥 𝑛 ‖ ‖ + ‖ ‖ 𝑦 − 𝑝 𝑛 , 𝑖 ‖ ‖ − 𝑝 + 2 𝜆 1 ‖ ‖ 𝑣 𝑛 − 𝑢 𝑛 ‖ ‖ ‖ ‖ 𝐸 1 𝑢 𝑛 − 𝐸 1 𝑝 ‖ ‖ . ( 3 . 5 0 ) Therefore, by condition (iii), (3.13), and (3.45), we have l i m 𝑛 → ∞ ‖ ‖ 𝑣 𝑛 − 𝑢 𝑛 ‖ ‖ = 0 . ( 3 . 5 1 ) Step 4. We show that 𝑧 ∈ Θ ∶ = 𝐹 ( 𝒮 ) ∩ 𝐹 ( 𝑊 ) ∩ G M E P ( 𝐹 1 , 𝜑 1 , 𝐴 ) ∩ G M E P ( 𝐹 2 , 𝜑 2 , 𝐵 ) ∩ 𝐼 ( 𝐸 1 , 𝑀 1 ) ∩ 𝐼 ( 𝐸 2 , 𝑀 2 ) . Since { 𝑤 𝑛 𝑖 } is bounded, there exists a subsequence { 𝑤 𝑛 𝑖 𝑗 } of { 𝑤 𝑛 𝑖 } which converges weakly to 𝑧 ∈ 𝐶 . Without loss of generality, we can assume that 𝑤 𝑛 𝑖 ⇀ 𝑧 .
(1) First, we prove that 𝑧 ∈ 𝐹 ( 𝒮 ) . From (3.22), (3.31), (3.33), (3.42), and (3.51), we get l i m 𝑛 → ∞ ‖ ‖ ‖ 𝑤 𝑛 − 1 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 ‖ ‖ ‖ 𝑑 𝑠 = 0 . ( 3 . 5 2 ) Since { 𝑊 𝑛 𝑤 𝑛 } is bounded and from Lemma 2.8 for all s ≥ 0 , we have l i m 𝑛 → ∞ ‖ ‖ ‖ 1 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 1 𝑑 𝑠 − 𝑆 ( 𝑠 ) 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 ‖ ‖ ‖ 𝑑 𝑠 = 0 , ( 3 . 5 3 ) and since ‖ ‖ 𝑤 𝑛 − 𝑆 ( 𝑠 ) 𝑤 𝑛 ‖ ‖ ≤ ‖ ‖ ‖ 𝑤 𝑛 − 1 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 ‖ ‖ ‖ + ‖ ‖ ‖ 1 𝑑 𝑠 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 1 𝑑 𝑠 − 𝑆 ( 𝑠 ) 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 ‖ ‖ ‖ + ‖ ‖ ‖ 1 𝑑 𝑠 𝑆 ( 𝑠 ) 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 𝑑 𝑠 − 𝑆 ( 𝑠 ) 𝑤 𝑛 ‖ ‖ ‖ ‖ ‖ ‖ 𝑤 ≤ 2 𝑛 − 1 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 ‖ ‖ ‖ + ‖ ‖ ‖ 1 𝑑 𝑠 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 1 𝑑 𝑠 − 𝑆 ( 𝑠 ) 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 ‖ ‖ ‖ . 𝑑 𝑠 ( 3 . 5 4 ) It follows from (3.52) and (3.53) that l i m n → ∞ ‖ ‖ 𝑤 𝑛 − 𝑆 ( 𝑠 ) 𝑤 𝑛 ‖ ‖ = 0 . ( 3 . 5 5 ) Indeed, from Lemma 2.9 and (3.55), we get 𝑧 ∈ 𝐹 ( 𝒮 ) , that is, 𝑧 = 𝑆 ( 𝑠 ) 𝑧 , ∀ 𝑠 ≥ 0 .
(2) Next, we show that ⋂ 𝑧 ∈ 𝐹 ( 𝑊 ) = ∞ 𝑛 = 1 𝐹 ( 𝑊 𝑛 ) , where 𝐹 ( 𝑊 𝑛 ⋂ ) = 𝑛 𝑖 = 1 𝐹 ( 𝑇 𝑖 ) , ∀ 𝑛 ≥ 1 , and 𝐹 ( 𝑊 𝑛 + 1 ) ⊂ 𝐹 ( 𝑊 𝑛 ) . Assume that 𝑧 ∉ 𝐹 ( 𝑊 ) , then there exists a positive integer 𝑚 such that 𝑧 ∉ 𝐹 ( 𝑇 𝑚 ) , and so ⋂ 𝑧 ∉ 𝑚 𝑖 = 1 𝐹 ( 𝑇 𝑖 ) . Hence, for any ⋂ 𝑛 ≥ 𝑚 , 𝑧 ∉ 𝑛 𝑖 = 1 𝐹 ( 𝑇 𝑖 ) = 𝐹 ( 𝑊 𝑛 ) , that is, 𝑧 ≠ 𝑊 𝑛 𝑧 . This together with 𝑧 = 𝑆 ( 𝑠 ) 𝑧 , ∀ 𝑠 ≥ 0 shows that 𝑧 = 𝑆 ( 𝑠 ) 𝑧 ≠ 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑧 , ∀ 𝑠 ≥ 0 ; therefore, we have 𝑧 ≠ ( 1 / 𝑡 𝑛 ) ∫ 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑧 𝑑 𝑠 , ∀ 𝑛 ≥ 𝑚 . It follows from the Opial's condition and (3.52) that l i m i n f 𝑖 → ∞ ‖ ‖ 𝑤 𝑛 𝑖 ‖ ‖ − 𝑧 < l i m i n f 𝑖 → ∞ ‖ ‖ ‖ 𝑤 𝑛 𝑖 − 1 𝑡 𝑛 𝑖 𝑡 𝑛 𝑖 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑖 ‖ ‖ ‖ 𝑧 𝑑 𝑠 ≤ l i m i n f 𝑖 → ∞ ‖ ‖ ‖ 𝑤 𝑛 𝑖 − 1 𝑡 𝑛 𝑖 𝑡 𝑛 𝑖 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑖 𝑤 𝑛 𝑖 ‖ ‖ ‖ + ‖ ‖ ‖ 1 𝑑 𝑠 𝑡 𝑛 𝑖 𝑡 𝑛 𝑖 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑖 𝑤 𝑛 𝑖 1 𝑑 𝑠 − 𝑡 𝑛 𝑖 𝑡 𝑛 𝑖 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑖 ‖ ‖ ‖ 𝑧 𝑑 𝑠 ≤ l i m i n f 𝑖 → ∞ ‖ ‖ 𝑤 𝑛 𝑖 ‖ ‖ , − 𝑧 ( 3 . 5 6 ) which is a contradiction. Thus, we get 𝑧 ∈ 𝐹 ( 𝑊 ) .
(3) Now, we prove that 𝑧 ∈ G M E P ( 𝐹 1 , 𝜑 , 𝐴 ) . Since 𝑡 𝑛 = 𝑇 ( 𝐹 1 , 𝜑 1 ) 𝑟 𝑛 ( 𝑥 𝑛 − 𝑟 𝑛 𝐴 𝑥 𝑛 ) , 𝑛 ≥ 1 , we have for any 𝑦 ∈ 𝐶 that 𝐹 1 𝑡 𝑛 , 𝑦 + 𝜑 1 ( 𝑦 ) − 𝜑 1 𝑡 𝑛 + ⟨ 𝐴 𝑥 𝑛 , 𝑦 − 𝑡 𝑛 1 ⟩ + 𝑟 𝑛 ⟨ 𝑦 − 𝑡 𝑛 , 𝑡 𝑛 − 𝑥 𝑛 ⟩ ≥ 0 , ∀ 𝑦 ∈ C . ( 3 . 5 7 ) From (A2), we also have 𝜑 1 ( 𝑦 ) − 𝜑 1 𝑡 𝑛 + ⟨ 𝐴 𝑥 𝑛 , 𝑦 − 𝑡 𝑛 1 ⟩ + 𝑟 𝑛 ⟨ 𝑦 − 𝑡 𝑛 , 𝑡 𝑛 − 𝑥 𝑛 ⟩ ≥ 𝐹 1 𝑦 , 𝑡 𝑛 , ∀ 𝑦 ∈ C . ( 3 . 5 8 ) For 𝑡 with 0 < 𝑡 ≤ 1 and 𝑦 ∈ C , let 𝑦 𝑡 = 𝑡 𝑦 + ( 1 − 𝑡 ) 𝑧 . Since 𝑦 ∈ 𝐶 and 𝑧 ∈ 𝐶 , we have 𝑦 𝑡 ∈ 𝐶 . Then, we have ⟨ 𝑦 𝑡 − 𝑡 𝑛 𝑖 , 𝐴 𝑦 𝑡 ⟩ ≥ ⟨ 𝑦 𝑡 − 𝑡 𝑛 𝑖 , 𝐴 𝑦 𝑡 ⟩ − 𝜑 1 𝑦 𝑡 + 𝜑 1 𝑡 𝑛 𝑖 − ⟨ 𝑦 𝑡 − 𝑡 𝑛 𝑖 , 𝐴 𝑥 𝑛 𝑖 ⟩ − 𝑦 𝑡 − 𝑡 𝑛 𝑖 , 𝑡 𝑛 𝑖 − 𝑥 𝑛 𝑖 𝑟 𝑛 𝑖 + 𝐹 1 𝑦 𝑡 , 𝑡 𝑛 𝑖 = ⟨ 𝑦 𝑡 − 𝑡 𝑛 𝑖 , 𝐴 𝑦 𝑡 − 𝐴 𝑡 𝑛 𝑖 ⟩ + ⟨ 𝑦 𝑡 − 𝑡 𝑛 𝑖 , 𝐴 𝑡 𝑛 𝑖 − 𝐴 𝑥 𝑛 𝑖 ⟩ − 𝜑 1 𝑦 𝑡 + 𝜑 1 𝑡 𝑛 𝑖 − 𝑦 𝑡 − 𝑡 𝑛 𝑖 , 𝑡 𝑛 𝑖 − 𝑥 𝑛 𝑖 𝑟 𝑛 𝑖 + 𝐹 1 𝑦 𝑡 , 𝑡 𝑛 𝑖 . ( 3 . 5 9 ) Since ‖ 𝑡 𝑛 𝑖 − 𝑥 𝑛 𝑖 ‖ → 0 , we have ‖ 𝐴 𝑡 𝑛 𝑖 − 𝐴 𝑥 𝑛 𝑖 ‖ → 0 . Furthermore, from the inverse-strongly monotonicity of 𝐴 , we have ⟨ 𝑦 𝑡 − 𝑡 𝑛 𝑖 , 𝐴 𝑦 𝑡 − 𝐴 𝑡 𝑛 𝑖 ⟩ ≥ 0 . So, from (A4), (A5), and the weak lower semicontinuity of 𝜑 1 , ( 𝑡 𝑛 𝑖 − 𝑥 𝑛 𝑖 ) / 𝑟 𝑛 𝑖 → 0 and 𝑡 𝑛 𝑖 ⇀ 𝑧 , we have at the limit ⟨ 𝑦 𝑡 − 𝑧 , 𝐴 𝑦 𝑡 ⟩ ≥ − 𝜑 1 𝑦 𝑡 + 𝜑 1 ( 𝑧 ) + 𝐹 1 𝑦 𝑡 , 𝑧 , ( 3 . 6 0 ) as 𝑖 → ∞ . From (A1), (A4), and (3.60), we also get 0 = 𝐹 1 𝑦 𝑡 , 𝑦 𝑡 + 𝜑 1 𝑦 𝑡 − 𝜑 1 𝑦 𝑡 ≤ 𝑡 𝐹 1 𝑦 𝑡 , 𝑦 + ( 1 − 𝑡 ) 𝐹 1 𝑦 𝑡 , 𝑧 + 𝑡 𝜑 1 ( 𝑦 ) − ( 1 − 𝑡 ) 𝜑 1 ( 𝑦 𝑧 ) − 𝜑 𝑡 𝐹 = 𝑡 1 𝑦 𝑡 , 𝑦 + 𝜑 1 ( 𝑦 ) − 𝜑 1 𝑦 𝑡 + 𝐹 ( 1 − 𝑡 ) 1 𝑦 𝑡 , 𝑧 + 𝜑 1 ( 𝑧 ) − 𝜑 1 𝑦 𝑡 𝐹 ≤ 𝑡 1 𝑦 𝑡 , 𝑦 + 𝜑 1 ( 𝑦 ) − 𝜑 1 𝑦 𝑡 + ( 1 − 𝑡 ) ⟨ 𝑦 𝑡 − 𝑧 , 𝐴 𝑦 𝑡 ⟩ 𝐹 = 𝑡 1 𝑦 𝑡 , 𝑦 + 𝜑 1 ( 𝑦 ) − 𝜑 1 𝑦 𝑡 + ( 1 − 𝑡 ) 𝑡 ⟨ 𝑦 − 𝑧 , 𝐴 𝑦 𝑡 ⟩ , ( 3 . 6 1 ) and hence, 0 ≤ 𝐹 1 𝑦 𝑡 , 𝑦 + 𝜑 1 ( 𝑦 ) − 𝜑 1 𝑦 𝑡 + ( 1 − 𝑡 ) ⟨ 𝑦 − 𝑧 , 𝐴 𝑦 𝑡 ⟩ . ( 3 . 6 2 ) Letting 𝑡 → 0 , we have, for each 𝑦 ∈ 𝐶 , 𝐹 1 ( 𝑧 , 𝑦 ) + 𝜑 1 ( 𝑦 ) − 𝜑 1 ( 𝑧 ) + ⟨ 𝑦 − 𝑧 , 𝐴 𝑧 ⟩ ≥ 0 . ( 3 . 6 3 ) This implies that 𝑧 ∈ G M E P ( 𝐹 1 , 𝜑 , 𝐴 ) . By following the same arguments, we can show that 𝑧 ∈ G M E P ( 𝐹 2 , 𝜑 , 𝐵 ) .
(4) At last, we show that 𝑧 ∈ 𝐼 ( 𝐸 2 , 𝑀 2 ) . Infact, since 𝐸 2 is 𝜂 2 -inverse-strongly monotone, this implies that 𝐸 2 is ( 1 / 𝜂 2 ) -Lipschitz continuous monotone mapping and domain of 𝐸 2 equal to 𝐻 . It follows from Lemma 2.5 that 𝑀 2 + 𝐸 2 is a maximal monotone. Let ( 𝑦 , 𝑔 ) ∈ 𝐺 ( 𝑀 2 + 𝐸 2 ) , that is, 𝑔 − 𝐸 2 𝑦 ∈ 𝑀 2 ( 𝑦 ) . Since 𝑤 𝑛 𝑖 = 𝐽 𝑀 2 , 𝜆 2 ( 𝑣 𝑛 𝑖 − 𝜆 2 𝐸 2 𝑣 𝑛 𝑖 ) , we have 𝑣 𝑛 𝑖 − 𝜆 2 𝐸 2 𝑣 𝑛 𝑖 ∈ ( 𝐼 + 𝜆 2 𝑀 2 ) ( 𝑤 𝑛 𝑖 ) , that is, 1 𝜆 2 𝑣 𝑛 𝑖 − 𝑤 𝑛 𝑖 − 𝜆 2 𝐸 2 𝑣 𝑛 𝑖 ∈ 𝑀 2 𝑤 𝑛 𝑖 . ( 3 . 6 4 ) Since 𝑀 2 + 𝐸 2 is a maximal monotone, we have 𝑦 − 𝑤 𝑛 𝑖 1 , 𝑔 − 𝐵 𝑦 − 𝜆 2 𝑣 𝑛 𝑖 − 𝑤 𝑛 𝑖 − 𝜆 2 𝐸 2 𝑣 𝑛 𝑖 ≥ 0 , ( 3 . 6 5 ) and so ⟨ 𝑦 − 𝑤 𝑛 𝑖 , 𝑔 ⟩ ≥ 𝑦 − 𝑤 𝑛 𝑖 , 𝐸 2 1 𝑦 + 𝜆 2 𝑣 𝑛 𝑖 − 𝑤 𝑛 𝑖 − 𝜆 2 𝐸 2 𝑣 𝑛 𝑖 = 𝑦 − 𝑤 𝑛 𝑖 , 𝐸 2 𝑦 − 𝐸 2 𝑤 𝑛 𝑖 + 𝐸 2 𝑤 𝑛 𝑖 − 𝐸 2 𝑣 𝑛 𝑖 + 1 𝜆 2 𝑣 𝑛 𝑖 − 𝑤 𝑛 𝑖 ≥ 0 + 𝑦 − 𝑤 𝑛 𝑖 , 𝐸 2 𝑤 𝑛 𝑖 − 𝐸 2 𝑣 𝑛 𝑖 + 𝑦 − 𝑤 𝑛 𝑖 , 1 𝜆 2 𝑣 𝑛 𝑖 − 𝑤 𝑛 𝑖 . ( 3 . 6 6 ) It follows from ‖ 𝑣 𝑛 − 𝑤 𝑛 ‖ → 0 , ‖ 𝐸 2 𝑣 𝑛 − 𝐸 2 𝑤 𝑛 ‖ → 0 , and 𝑤 𝑛 𝑖 ⇀ 𝑧 that l i m 𝑖 → ∞ ⟨ 𝑦 − 𝑤 𝑛 𝑖 , 𝑔 ⟩ = ⟨ 𝑦 − 𝑤 , 𝑔 ⟩ ≥ 0 . ( 3 . 6 7 ) It follows from the maximal monotonicity of 𝑀 2 + 𝐸 2 that 0 ∈ ( 𝑀 2 + 𝐸 2 ) ( 𝑧 ) , that is, 𝑧 ∈ 𝐼 ( 𝐸 2 , 𝑀 2 ) . By following the same arguments, we can show that 𝑧 ∈ 𝐼 ( 𝐸 1 , 𝑀 1 ) . Hence, by (1)–(4), we have 𝑧 ∈ Θ .Step 5. Noting that 𝑥 𝑛 = 𝑃 𝐶 𝑛 𝑥 0 , by (2.5), we have ⟨ 𝑥 0 − 𝑥 𝑛 , 𝑦 − 𝑥 𝑛 ⟩ ≤ 0 , ∀ 𝑦 ∈ 𝐶 𝑛 . ( 3 . 6 8 ) Since Θ ⊂ C 𝑛 and by the continuity of inner product, we obtain from the above inequality that ⟨ 𝑥 0 − 𝑧 , 𝑦 − 𝑧 ⟩ ≤ 0 , ∀ 𝑦 ∈ 𝐶 . ( 3 . 6 9 ) By (2.5) again, we conclude that z = 𝑃 Θ 𝑥 0 . This completes the proof.

Using Theorem 3.1, we obtain the following corollaries.

Corollary 3.2. Let C be a nonempty closed-convex subset of a real Hilbert Space H . Let F 1 , F 2 be bifunctions of 𝐶 × 𝐶 into real numbers ℝ satisfying ( A 1 ) - ( A 5 ) , and let 𝜑 1 , 𝜑 2 ∶ C → ℝ ∪ { + ∞ } be proper lower semicontinuous and convex functions with assumption (B1) or (B2). Let A , B , E 1 , E 2 be 𝛼 , 𝛽 , 𝜂 1 , 𝜂 2 -inverse-strongly monotone mappings of C into H , respectively. Let 𝒮 = { 𝑆 ( 𝑠 ) ∶ 0 ≤ 𝑠 < ∞ } be a nonexpansive semigroup on C , and let { t n } be a positive real divergent sequence. Let { 𝑉 𝑖 ∶ 𝐶 → 𝐶 } ∞ 𝑖 = 1 be a countable family of uniformly k -strict pseudocontractions, let { 𝑇 𝑖 ∶ 𝐶 → 𝐶 } ∞ 𝑖 = 1 be a countable family of nonexpansive mappings defined by T i x = t x + ( 1 − t ) V i x , ∀ x ∈ C , ∀ i ≥ 1 , t ∈ [ k , 1 ) , and let Wn be the W -mapping defined by (2.11) and W a mapping defined by (2.12) with F ( W ) ≠ ∅ . Suppose that Θ ∶ = 𝐹 ( 𝒮 ) ∩ 𝐹 ( 𝑊 ) ∩ 𝐺 𝑀 𝐸 𝑃 ( 𝐹 1 , 𝜑 1 , 𝐴 ) ∩ 𝐺 𝑀 𝐸 𝑃 ( 𝐹 2 , 𝜑 2 , 𝐵 ) ∩ 𝑉 𝐼 ( 𝐶 , 𝐸 1 ) ∩ 𝑉 𝐼 ( 𝐶 , 𝐸 2 ) ≠ ∅ . Let { 𝑥 𝑛 } be a sequence generated by 𝑥 0 ∈ 𝐶 , 𝐶 1 , 𝑖 = 𝐶 , 𝐶 1 = ⋂ ∞ 𝑖 = 1 𝐶 1 , 𝑖 , 𝑥 1 = 𝑃 𝐶 1 𝑥 0 , and 𝑡 𝑛 = 𝑇 ( 𝐹 1 , 𝜑 1 ) 𝑟 𝑛 𝑥 𝑛 − 𝑟 𝑛 𝐴 𝑥 𝑛 , 𝑢 𝑛 = 𝑇 ( 𝐹 2 , 𝜑 2 ) 𝑞 𝑛 𝑡 𝑛 − 𝑞 𝑛 𝐵 𝑡 𝑛 , 𝑣 𝑛 = 𝑃 𝐶 𝑢 𝑛 − 𝜆 1 𝐸 1 𝑢 𝑛 , 𝑤 𝑛 = 𝑃 𝐶 𝑣 𝑛 − 𝜆 2 𝐸 2 𝑣 𝑛 , 𝑦 𝑛 , 𝑖 = 𝛼 𝑛 , 𝑖 𝑥 0 + 1 − 𝛼 𝑛 , 𝑖 1 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 𝐶 𝑑 𝑠 , 𝑛 + 1 , 𝑖 = 𝑧 ∈ 𝐶 𝑛 , 𝑖 ∶ ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑧 2 ≤ ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑧 2 + 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ 2 + 2 ⟨ 𝑥 𝑛 − 𝑥 0 , 𝐶 , 𝑧 ⟩ 𝑛 + 1 = ∞ 𝑖 = 1 𝐶 𝑛 + 1 , 𝑖 , 𝑥 𝑛 + 1 = 𝑃 𝐶 𝑛 + 1 𝑥 0 , ( 3 . 7 0 ) for every n ≥ 0 , where { 𝛼 𝑛 , 𝑖 } ∞ 𝑛 = 1 ⊂ ( 0 , 1 ) , { 𝑟 𝑛 } , { 𝑞 𝑛 } ⊂ ( 0 , ∞ ) , 𝜆 1 ∈ ( 0 , 2 𝜂 1 ) , and 𝜆 2 ∈ ( 0 , 2 𝜂 2 ) satisfy the following conditions: (i) 0 < 𝑎 ≤ 𝑟 𝑛 ≤ 𝑏 < 2 𝛼 , (ii) 0 < 𝑐 ≤ 𝑞 𝑛 ≤ 𝑑 < 2 𝛽 , (iii) l i m 𝑛 → ∞ 𝛼 𝑛 , 𝑖 = 0 , (iv) 0 < 𝑒 ≤ 𝜆 1 ≤ 𝑓 < 2 𝜂 1 , (v) 0 < g ≤ 𝜆 2 ≤ j < 2 𝜂 2 ,
then { 𝑥 𝑛 } converges strongly to 𝑃 Θ 𝑥 0 .

Proof. From Theorem 3.1, put 𝑀 = 𝜕 𝛿 𝐶 , then 𝐽 𝑀 , 𝜆 1 = 𝑃 𝐶 and 𝐽 𝑀 , 𝜆 2 = 𝑃 𝐶 . So we have 𝑣 𝑛 = 𝑃 𝐶 ( 𝑢 𝑛 − 𝜆 1 𝐸 1 𝑢 𝑛 ) and 𝑤 𝑛 = 𝑃 𝐶 ( 𝑣 𝑛 − 𝜆 2 𝐸 2 𝑣 𝑛 ) . The conclusion of Corollary 3.2 can be obtained from Theorem 3.1 immediately.

4. Applications

In this section, we study a kind of multiobjective optimization problem by using the result of this paper. We will give an iterative algorithm of solution for the following optimization problem with nonempty set of solutions: m i n ℎ 1 ( 𝑥 ) m i n ℎ 2 ( 𝑥 ) 𝑥 ∈ C , ( 4 . 1 ) where ℎ ( 𝑥 ) is a convex and lower semicontinuous functional, and define C as a closed-convex subset of a real Hilbert space 𝐻 . We denote the set of solutions of (4.1) by 𝑀 ( ℎ 1 ) and 𝑀 ( ℎ 2 ) . Let 𝐹 𝑖 ∶ 𝐶 × 𝐶 → ℝ be a bifunction defined by 𝐹 𝑖 ( 𝑥 , 𝑦 ) = ℎ 𝑖 ( 𝑦 ) − ℎ 𝑖 ( 𝑥 ) . We consider the equilibrium problem, and it is obvious that 𝐸 𝑃 ( 𝐹 𝑖 ) = 𝑀 ( ℎ 𝑖 ) , 𝑖 = 1 , 2 . Therefore, from Theorem 3.1, we obtain the following Corollaries.

Corollary 4.1. Let C be a nonempty closed-convex subset of a real Hilbert Space H . Let ℎ 1 , ℎ 2 ∶ C → ℝ ∪ { + ∞ } be proper lower semicontinuous and convex functions. Let E 1 , E 2 be 𝜂 1 , 𝜂 2 -inverse-strongly monotone mappings of C into H , respectively, and let M 1 , M 2 ∶ H → 2 H be maximal monotone mappings. Let 𝒮 = { S ( s ) ∶ 0 ≤ s < ∞ } be a nonexpansive semigroup on C , and let { t n } be a positive real divergent sequence. Let { V i ∶ C → C } ∞ i = 1 be a countable family of uniformly k -strict pseudocontractions, let { T i ∶ C → C } ∞ i = 1 be a countable family of nonexpansive mappings defined by 𝑇 𝑖 𝑥 = 𝑡 𝑥 + ( 1 − 𝑡 ) 𝑉 𝑖 𝑥 , ∀ 𝑥 ∈ 𝐶 , ∀ 𝑖 ≥ 1 , 𝑡 ∈ [ 𝑘 , 1 ) , and let W 𝑛 be the W -mapping defined by (2.11) and W a mapping defined by (2.12) with F ( W ) ≠ ∅ . Suppose that Θ ∶ = F ( 𝒮 ) ∩ F ( W ) ∩ M ( ℎ 1 ) ∩ M ( ℎ 2 ) ∩ 𝐼 ( E 1 , M 1 ) ∩ 𝐼 ( E 2 , M 2 ) ≠ ∅ . Let { x n } be a sequence generated by 𝑥 0 ∈ 𝐶 , 𝐶 1 , 𝑖 = 𝐶 , 𝐶 1 = ⋂ ∞ 𝑖 = 1 𝐶 1 , 𝑖 , 𝑥 1 = 𝑃 𝐶 1 𝑥 0 , and ℎ 1 ( 𝑡 ) − ℎ 1 𝑡 𝑛 + 1 𝑟 𝑛 ⟨ 𝑡 − 𝑡 𝑛 , 𝑡 𝑛 − 𝑥 𝑛 ℎ ⟩ ≥ 0 , ∀ 𝑡 ∈ 𝐶 , 2 ( 𝑢 ) − ℎ 2 𝑢 𝑛 + 1 𝑞 𝑛 ⟨ 𝑢 − 𝑢 𝑛 , 𝑢 𝑛 − 𝑡 𝑛 𝑣 ⟩ ≥ 0 , ∀ 𝑢 ∈ 𝐶 , 𝑛 = 𝐽 𝑀 1 , 𝜆 1 𝑢 𝑛 − 𝜆 1 𝐸 1 𝑢 𝑛 , 𝑤 𝑛 = 𝐽 𝑀 2 , 𝜆 2 𝑣 𝑛 − 𝜆 2 𝐸 2 𝑣 𝑛 , 𝑦 𝑛 , 𝑖 = 𝛼 𝑛 , 𝑖 𝑥 0 + 1 − 𝛼 𝑛 , 𝑖 1 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 𝐶 𝑑 𝑠 , 𝑛 + 1 , 𝑖 = 𝑧 ∈ 𝐶 𝑛 , 𝑖 ∶ ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑧 2 ≤ ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑧 2 + 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ 2 + 2 ⟨ 𝑥 𝑛 − 𝑥 0 , 𝐶 , 𝑧 ⟩ 𝑛 + 1 = ∞ 𝑖 = 1 𝐶 𝑛 + 1 , 𝑖 , 𝑥 𝑛 + 1 = 𝑃 𝐶 𝑛 + 1 𝑥 0 , ( 4 . 2 ) for every n ≥ 0 , where { 𝛼 n , i } ∞ n = 1 ⊂ ( 0 , 1 ) , { r n } , { q n } ⊂ ( 0 , ∞ ) , 𝜆 1 ∈ ( 0 , 2 𝜂 1 ) , and 𝜆 2 ∈ ( 0 , 2 𝜂 2 ) satisfy the following conditions: (i) l i m i n f 𝑛 → ∞ 𝑟 𝑛 > 0 , (ii) l i m i n f 𝑛 → ∞ 𝑞 𝑛 > 0 , (iii) l i m 𝑛 → ∞ 𝛼 𝑛 , 𝑖 = 0 , (iv) 0 < e ≤ 𝜆 1 ≤ f < 2 𝜂 1 , (v) 0 < g ≤ 𝜆 2 ≤ j < 2 𝜂 2 , then { 𝑥 𝑛 } converges strongly to 𝑃 Θ 𝑥 0 .

Proof. From Theorem 3.1, put 𝐹 1 ( 𝑡 𝑛 , 𝑡 ) = ℎ 1 ( 𝑡 ) − ℎ 1 ( 𝑡 𝑛 ) , 𝐹 2 ( 𝑢 𝑛 , 𝑢 ) = ℎ 2 ( 𝑢 ) − ℎ 2 ( 𝑢 𝑛 ) , and 𝐴 , 𝐵 , 𝜑 1 , 𝜑 2 ≡ 0 . The conclusion of Corollary 4.1 can be obtained from Theorem 3.1 immediately.

Corollary 4.2. Let C be a nonempty closed-convex subset of a real Hilbert Space H . Let ℎ 1 , ℎ 2 ∶ C → ℝ ∪ { + ∞ } be proper lower semicontinuous and convex functions. Let E 1 , E 2 be 𝜂 1 , 𝜂 2 -inverse-strongly monotone mappings of C into H , respectively, and let 𝑀 1 , 𝑀 2 ∶ 𝐻 → 2 𝐻 be maximal monotone mappings. Let 𝒮 = { 𝑆 ( 𝑠 ) ∶ 0 ≤ 𝑠 < ∞ } be a nonexpansive semigroup on C , and let { t n } be a positive real divergent sequence. Let { 𝑉 𝑖 ∶ 𝐶 → 𝐶 } ∞ 𝑖 = 1 be a countable family of uniformly k -strict pseudocontractions, let { T i ∶ C → C } ∞ i = 1 be a countable family of nonexpansive mappings defined by 𝑇 𝑖 𝑥 = 𝑡 𝑥 + ( 1 − 𝑡 ) 𝑉 𝑖 𝑥 , ∀ 𝑥 ∈ 𝐶 , ∀ 𝑖 ≥ 1 , 𝑡 ∈ [ 𝑘 , 1 ) , and let 𝑊 𝑛 be the W -mapping defined by (2.11) and W a mapping defined by (2.12) with F ( W ) ≠ ∅ . Suppose that Θ ∶ = F ( 𝒮 ) ∩ F ( W ) ∩ M ( ℎ 1 ) ∩ M ( ℎ 2 ) ∩ 𝑉 𝐼 ( C , E 1 ) ∩ 𝑉 𝐼 ( C , E 2 ) ≠ ∅ . Let { x n } be a sequence generated by 𝑥 0 ∈ 𝐶 , 𝐶 1 , 𝑖 = 𝐶 , 𝐶 1 = ⋂ ∞ 𝑖 = 1 𝐶 1 , 𝑖 , 𝑥 1 = 𝑃 𝐶 1 𝑥 0 , and ℎ 1 ( 𝑡 ) − ℎ 1 𝑡 𝑛 + 1 𝑟 𝑛 ⟨ 𝑡 − 𝑡 𝑛 , 𝑡 𝑛 − 𝑥 𝑛 ℎ ⟩ ≥ 0 , ∀ 𝑡 ∈ 𝐶 , 2 ( 𝑢 ) − ℎ 2 𝑢 𝑛 + 1 𝑞 𝑛 ⟨ 𝑢 − 𝑢 𝑛 , 𝑢 𝑛 − 𝑡 𝑛 𝑣 ⟩ ≥ 0 , ∀ 𝑢 ∈ 𝐶 , 𝑛 = 𝑃 𝐶 𝑢 𝑛 − 𝜆 1 𝐸 1 𝑢 𝑛 , 𝑤 𝑛 = 𝑃 𝐶 𝑣 𝑛 − 𝜆 2 𝐸 2 𝑣 𝑛 , 𝑦 𝑛 , 𝑖 = 𝛼 𝑛 , 𝑖 𝑥 0 + 1 − 𝛼 𝑛 , 𝑖 1 𝑡 𝑛 𝑡 𝑛 0 𝑆 ( 𝑠 ) 𝑊 𝑛 𝑤 𝑛 𝐶 𝑑 𝑠 , 𝑛 + 1 , 𝑖 = 𝑧 ∈ 𝐶 𝑛 , 𝑖 ∶ ‖ ‖ 𝑦 𝑛 , 𝑖 ‖ ‖ − 𝑧 2 ≤ ‖ ‖ 𝑥 𝑛 ‖ ‖ − 𝑧 2 + 𝛼 𝑛 , 𝑖 ‖ ‖ 𝑥 0 ‖ ‖ 2 + 2 ⟨ 𝑥 𝑛 − 𝑥 0 , 𝐶 , 𝑧 ⟩ 𝑛 + 1 = ∞ 𝑖 = 1 𝐶 𝑛 + 1 , 𝑖 , 𝑥 𝑛 + 1 = 𝑃 𝐶 𝑛 + 1 𝑥 0 , ( 4 . 3 ) for every n ≥ 0 , where { 𝛼 n , i } ∞ n = 1 ⊂ ( 0 , 1 ) , { r n } , { q n } ⊂ ( 0 , ∞ ) , 𝜆 1 ∈ ( 0 , 2 𝜂 1 ) , and 𝜆 2 ∈ ( 0 , 2 𝜂 2 ) satisfy the following conditions:
(i) l i m i n f 𝑛 → ∞ 𝑟 𝑛 > 0 , (ii) l i m i n f 𝑛 → ∞ 𝑞 𝑛 > 0 , (iii) l i m 𝑛 → ∞ 𝛼 𝑛 , 𝑖 = 0 , (iv) 0 < 𝑒 ≤ 𝜆 1 ≤ 𝑓 < 2 𝜂 1 , (v) 0 < 𝑔 ≤ 𝜆 2 ≤ 𝑗 < 2 𝜂 2 , then { 𝑥 𝑛 } converges strongly to 𝑃 Θ 𝑥 0 .

Acknowledgments

The authors thank the referees for their appreciation, valuable comments, and suggestions. They would like to thank the Higher Education Research Promotion and National Research University Project of Thailand, Office of the Higher Education Commission for financial support. Furthermore, they would like to thank the Faculty of science (KMUTT) and the National Research Council of Thailand. This work was completed with the support of the National Research Council of Thailand (NRCT 2010-2011).

References

  1. F. E. Browder and W. V. Petryshyn, “Construction of fixed points of nonlinear mappings in Hilbert space,” Journal of Mathematical Analysis and Applications, vol. 20, no. 2, pp. 197–228, 1967.
  2. K. Goebel and W. A. Kirk, Topics on Metric Fixed-Point Theory, Cambridge University Press, Cambridge, UK, 1990.
  3. H. Brézis, Opérateurs Maximaux Monotones et Semi-Groupes de Contractions dans les Espaces de Hilbert, North-Holland Mathematics Studies, no. 5. Notas de Mathemática no. 50, North-Holland, Amsterdam, The Netherlands, 1973.
  4. S.-S. Zhang, J. H. W. Lee, and C. K. Chan, “Algorithms of common solutions to quasi variational inclusion and fixed point problems,” Applied Mathematics and Mechanics, vol. 29, no. 5, pp. 571–581, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. R. S. Burachik, J. O. Lopes, and G. J. P. da Silva, “An inexact interior point proximal method for the variational inequality problem,” Computational and Applied Mathematics, vol. 28, no. 1, pp. 15–36, 2009.
  6. E. Blum and W. Oettli, “From optimization and variational inequalities to equilibrium problems,” The Mathematics Student, vol. 63, pp. 123–145, 1994.
  7. O. Chadli, N. C. Wong, and J. C. Yao, “Equilibrium problems with applications to eigenvalue problems,” Journal of Optimization Theory and Applications, vol. 117, no. 2, pp. 245–266, 2003. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. O. Chadli, S. Schaible, and J. C. Yao, “Regularized equilibrium problems with application to noncoercive hemivariational inequalities,” Journal of Optimization Theory and Applications, vol. 121, no. 3, pp. 571–596, 2004. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  9. S. D. Flåm and A. S. Antipin, “Equilibrium programming using proximal-like algorithms,” Mathematical Programming, Series B, vol. 78, no. 1, pp. 29–41, 1997.
  10. A. Moudafi and M. Thera, “Proximal and dynamical approaches to equilibrium problems,” in Lecture note in Economics and Mathematical Systems, vol. 477, pp. 187–201, Springer, New York, NY, USA, 1999.
  11. Z. Wang and Y. Su, “Strong convergence theorems of common elements for equilibrium problems and fixed point problems in Banach paces,” Journal of Applied Mathematics and Informatics, vol. 28, no. 3-4, pp. 783–796, 2010.
  12. R. Wangkeeree and R. Wangkeeree, “Strong convergence of the iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems of an infinite family of nonexpansive mappings,” Nonlinear Analysis: Hybrid Systems, vol. 3, no. 4, pp. 719–733, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  13. Y. Yao, M. Aslam Noor, S. Zainab, and Y.-C. Liou, “Mixed equilibrium problems and optimization problems,” Journal of Mathematical Analysis and Applications, vol. 354, no. 1, pp. 319–329, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  14. Y. Yao, Y. J. Cho, and R. Chen, “An iterative algorithm for solving fixed point problems, variational inequality problems and mixed equilibrium problems,” Nonlinear Analysis, Theory, Methods and Applications, vol. 71, no. 7-8, pp. 3363–3373, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  15. L. C. Zeng, S. Y. Wu, and J. C. Yao, “Generalized KKM theorem with applications to generalized minimax inequalities and generalized equilibrium problems,” Taiwanese Journal of Mathematics, vol. 10, no. 6, pp. 1497–1514, 2006.
  16. P. Kumam, “A hybrid approximation method for equilibrium and fixed point problems for a monotone mapping and a nonexpansive mapping,” Nonlinear Analysis: Hybrid Systems, vol. 2, no. 4, pp. 1245–1255, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  17. P. Kumam, “A new hybrid iterative method for solution of equilibrium problems and fixed point problems for an inverse strongly monotone operator and a nonexpansive mapping,” Journal of Applied Mathematics and Computing, vol. 29, no. 1-2, pp. 263–280, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  18. J.-W. Peng and J.-C. Yao, “Strong convergence theorems of iterative scheme based on the extragradient method for mixed equilibrium problems and fixed point problems,” Mathematical and Computer Modelling, vol. 49, no. 9-10, pp. 1816–1828, 2009. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  19. Y. Shehu, “Iterative methods for family of strictly pseudocontractive mappings and system of generalized mixed equilibrium problems and variational inequality problems,” Fixed Point Theory and Applications, vol. 2011, Article ID 852789, 21 pages, 2011. View at Publisher · View at Google Scholar
  20. T. Shimizu and W. Takahashi, “Strong convergence to common fixed points of families of nonexpansive mappings,” Journal of Mathematical Analysis and Applications, vol. 211, no. 1, pp. 71–83, 1997.
  21. C. Martinez-Yanes and H. K. Xu, “Strong convergence of the CQ method for fixed point iteration processes,” Nonlinear Analysis, Theory, Methods and Applications, vol. 64, no. 11, pp. 2400–2411, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  22. H. Zhou, “Convergence theorems of fixed points for κ-strict pseudo-contractions in Hilbert spaces,” Nonlinear Analysis, Theory, Methods and Applications, vol. 69, no. 2, pp. 456–462, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  23. K. Shimoji and W. Takahashi, “Strong convergence to common fixed points of infinite nonexpansive mappings and applications,” Taiwanese Journal of Mathematics, vol. 5, no. 2, pp. 387–404, 2001.
  24. S. S. Chang, Variational Inequalities and Related Problems, Chongqing Publishing House, 2007.
  25. Z. Opial, “Weak convergence of the sequence of successive approximations for nonexpansive mappings,” Bulletin of the American Mathematical Society, vol. 73, pp. 595–597, 1967.
  26. K. K. Tan and H. K. Xu, “The nonlinear ergodic theorem for asymptotically nonexpansive mappings in Banach spaces,” Proceedings of the American Mathematical Society, vol. 114, no. 2, pp. 399–404, 1992.