• Research
• Open Access

Proximal algorithms for a class of mixed equilibrium problems

Fixed Point Theory and Applications20122012:166

https://doi.org/10.1186/1687-1812-2012-166

• Accepted: 17 September 2012
• Published:

Abstract

We present two proximal algorithms for solving the mixed equilibrium problems. Under some simpler framework, the strong and weak convergence of the sequences defined by two general algorithms is respectively obtained. In particular, we deal with several iterative schemes in a united way and apply our algorithms for solving the classical equilibrium problem, the minimization problem, the classical variational inequality problem and the generalized variational inequality problem. Our results properly include some corresponding results in this field as a special case.

MSC:47H06, 47J05, 47J25, 47H10, 90C33, 90C25, 49M45, 65C25, 49J40, 65J15, 47H09.

Keywords

• mixed equilibrium problem
• proximal algorithm
• variational inequality

1 Introduction

Throughout the paper, H is a real Hilbert space with inner product $〈\cdot ,\cdot 〉$ and induced norm $\parallel \cdot \parallel$. Let K be a nonempty closed convex subset of H, $F:K×K\to \mathbb{R}$ be a bifunction and $\phi :K\to \mathbb{R}\cup \left\{+\mathrm{\infty }\right\}$ be a proper generalized real valued function, where $\mathbb{R}$ is the set of real numbers. Our interest is in finding a solution to the following problem which is referred to as the mixed equilibrium problem (for short, MEP) for F, φ
(1.1)
We denote the set of solutions for MEP by
$MEP\left(F,\phi \right)=\left\{x\in K;F\left(x,y\right)+\phi \left(y\right)-\phi \left(x\right)\ge 0,\mathrm{\forall }y\in K\right\}.$
Obviously, MEP (1.1) is a classical equilibrium problem (for short, EP) for F when $\phi \equiv 0$
(1.2)

The set $MEP\left(F,0\right)$ of solutions of EP (1.2) is denoted by $EP\left(F\right)$.

If $F\equiv 0$, then MEP (1.1) becomes the minimization problem (for short, MP) for a function φ
(1.3)

and $MEP\left(0,\phi \right)$ is denoted by $Argmin\left(\phi \right)$.

Given a mapping $T:K\to H$, let $F\left(x,y\right)=〈Tx,y-x〉$ for all $x,y\in K$. Then $z\in EP\left(F\right)$ if and only if $〈Tz,y-z〉\ge 0$ for all $y\in K$, i.e., EP (1.2) turns into a classical variational inequality problem (for short, VIP) for T
(1.4)
At the same time, MEP (1.1) also reduces a generalized variational inequality problem (for short, GVIP) for a mapping T and a function φ
(1.5)
and denote

and $VIP\left(T,K\right)=GVIP\left(T,0,K\right)$.

The mixed equilibrium problem (MEP) is very interesting because it covers mathematical programs and optimization problems over equilibrium constraints, hierarchical minimization problems, variational inequality, complementarity problems, monotone inclusion problems, saddle point problems, Nash equilibria in noncooperative games as well as certain fixed point problems. In other words, the mixed equilibrium problem unifies several problems arising from engineering, physics, statistics, computer science, optimization theory, operation research, economics and others. The interest of this problem is that it unites all these particular problems in a convenient way. Moreover, many methods devoted to solving one of these problems can be extended, with suitable modifications, to solving the mixed equilibrium problem (MEP).

In the last 20 years or so, many mathematical works have been devoted to studying the method for finding an approximate solution of $EP\left(F\right)$ with various types of additional conditions. Moudafi  extended the proximal method to monotone equilibrium problems and Konnov  used the proximal method to solve equilibrium problems with weakly monotone bifunctions. In 2005, Combettes and Hirstoaga  introduced an iterative scheme of finding the best approximation to the initial data when $EP\left(F\right)$ is nonempty and they also proved a strong convergence theorem under the condition ${lim}_{n\to \mathrm{\infty }}{r}_{n}=+\mathrm{\infty }$. Song and Zheng  and Song, Kang and Cho  considered the convergence of a Halpern-type iteration for $EP\left(F\right)$. The bundle methods and extragradient methods were extended to equilibrium problems in  and . In 2007, Takahashi and Takahashi  introduced the viscosity approximation method for finding a common element of the set of solutions of an equilibrium problem $EP\left(F\right)$ and the set of fixed points of a nonexpansive mapping T under the conditions ${lim inf}_{n\to \mathrm{\infty }}{r}_{n}=+\mathrm{\infty }$ and ${\sum }_{n=0}^{+\mathrm{\infty }}\parallel {r}_{n}-{r}_{n+1}\parallel <+\mathrm{\infty }$. Subsequently, the above viscosity approximation method was studied by different mathematicians using varying environmental conditions; see references  for details. Recently, Moudafi  showed weak convergence of proximal methods for a class of bilevel monotone equilibrium problems. For other solution methods regarding the equilibrium problems see [2, 1522].

In this paper, our main objective is to show the mixed equilibrium problem (1.1) can be solved by two very simple proximal methods under simpler conditions, where a bifunction F and a function φ satisfy the following standard assumptions.

Condition 1.1 The function $\phi :K\to \mathbb{R}\cup \left\{+\mathrm{\infty }\right\}$ is a proper lower semicontinuous convex function and the bifunction $F:K×K\to \mathbb{R}$ satisfies the following:

(A1) $F\left(x,x\right)=0$ for all $x\in K$;

(A2) F is monotone, i.e., $F\left(x,y\right)+F\left(y,x\right)\le 0$ for all $x,y\in K$;

(A3) for each $x,y,z\in K$, ${lim sup}_{t\to {0}^{+}}F\left(tz+\left(1-t\right)x,y\right)\le F\left(x,y\right)$;

(A4) for each $x\in K$, $y↦F\left(x,y\right)$ is convex and lower semicontinuous.

To this end, we introduce two proximal algorithms.

Algorithm 1 For any anchor $u\in K$ and initialization ${x}_{0}\in K$, if ${x}_{n}$ ($n\ge 0$) is the current iterate and ${\alpha }_{n}$, ${r}_{n}$ are the current parameters, then ${x}_{n+1}\in K$ is defined iteratively by
$\left\{\begin{array}{c}F\left({u}_{n},y\right)+\phi \left(y\right)-\phi \left({u}_{n}\right)+\frac{1}{{r}_{n}}〈y-{u}_{n},{u}_{n}-{x}_{n}〉\ge 0,\hfill \\ {x}_{n+1}={\alpha }_{n}u+\left(1-{\alpha }_{n}\right){u}_{n},\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K,n\ge 0.\hfill \end{array}$
(1.6)
We will show $\left\{{x}_{n}\right\}$ strongly converges to some element ${x}^{\ast }$ of $MEP\left(F,\phi \right)$ if only $\left\{{\alpha }_{n}\right\}\subset \left(0,1\right)$ and $\left\{{r}_{n}\right\}\subset \left(0,+\mathrm{\infty }\right)$ satisfy the following simple conditions:
$\left(\mathrm{C}\mathrm{1}\right)\phantom{\rule{0.25em}{0ex}}\underset{n\to \mathrm{\infty }}{lim}{\alpha }_{n}=0,\phantom{\rule{2em}{0ex}}\left(\mathrm{C}\mathrm{2}\right)\phantom{\rule{0.25em}{0ex}}\sum _{n=1}^{+\mathrm{\infty }}{\alpha }_{n}=+\mathrm{\infty },\phantom{\rule{2em}{0ex}}\left(\mathrm{C}\mathrm{3}\right)\phantom{\rule{0.25em}{0ex}}\underset{n\to \mathrm{\infty }}{lim inf}{r}_{n}>0.$
Algorithm 2 For any initialization ${x}_{0}\in K$, if ${x}_{n}$ ($n\ge 0$) is the current iterate and ${\alpha }_{n}$, ${r}_{n}$ are the current parameters, then ${x}_{n+1}\in K$ is given iteratively by
$\left\{\begin{array}{c}F\left({u}_{n},y\right)+\phi \left(y\right)-\phi \left({u}_{n}\right)+\frac{1}{{r}_{n}}〈y-{u}_{n},{u}_{n}-{x}_{n}〉\ge 0,\hfill \\ {x}_{n+1}={\alpha }_{n}{x}_{n}+\left(1-{\alpha }_{n}\right){u}_{n},\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K,n\ge 0.\hfill \end{array}$
(1.7)
We will prove $\left\{{x}_{n}\right\}$ weakly converges to some element ${x}^{\ast }$ of $MEP\left(F,\phi \right)$ whenever $\left\{{r}_{n}\right\}\subset \left(0,+\mathrm{\infty }\right)$ and $\left\{{\alpha }_{n}\right\}\subset \left(0,1\right)$ only satisfy the simpler conditions
$\left(\mathrm{C}\mathrm{3}\right)\phantom{\rule{0.25em}{0ex}}\underset{n\to \mathrm{\infty }}{lim inf}{r}_{n}>0\phantom{\rule{1em}{0ex}}\text{and}\phantom{\rule{1em}{0ex}}\left(\mathrm{C}\mathrm{4}\right)\phantom{\rule{0.25em}{0ex}}\underset{n\to \mathrm{\infty }}{lim sup}{\alpha }_{n}<1.$

Some other proximal methods and the related strong and weak convergence results can be derived from our main theorem by particularizing the bifunction F, the function H and the parameters ${\alpha }_{n}$, ${r}_{n}$. Our results treat several iterative schemes in a united way and properly include some results of [35, 8, 20, 21, 23, 24] as a special case.

The rest of the paper is organized as follows. In Section 2, we introduce some necessary lemmas and results, and show our algorithms are well defined. In Section 3, we study the strong convergence of a sequence iteratively given by Algorithm 1. In Section 4, we deal with the weak convergence of an iterative scheme defined by Algorithm 2. Some other proximal methods and the related results derived from our main theorems and some concluding remarks can be found in Section 5.

2 Preliminaries and basic results

Let $\left\{{x}_{n}\right\}$ be a sequence in H. We write ${x}_{n}⇀x$ to indicate that the sequence $\left\{{x}_{n}\right\}$ weakly converges to x; as usual, ${x}_{n}\to x$ will symbolize strong convergence. Let $F\left(T\right)=\left\{x\in H;Tx=x\right\}$ be the set of all fixed points for a mapping T. In a real Hilbert space H, we have
${\parallel tx+\left(1-t\right)y\parallel }^{2}=t{\parallel x\parallel }^{2}+\left(1-t\right){\parallel y\parallel }^{2}-t\left(1-t\right){\parallel x-y\parallel }^{2}$
(2.1)
for all $x,y\in H$ and $t\in \left[0,1\right]$. Let K be a nonempty closed convex subset of H. Then for any $x\in H$, there exists a unique nearest point in K, denoted by ${P}_{K}\left(x\right)$, such that
Such a ${P}_{K}$ is called the metric projection of H onto K. We know that ${P}_{K}$ is firmly nonexpansive, i.e., for any $x,y\in H$,
${\parallel {P}_{K}\left(x\right)-{P}_{K}\left(y\right)\parallel }^{2}\le 〈{P}_{K}\left(x\right)-{P}_{K}\left(y\right),x-y〉.$
Further, for $x\in H$ and $z\in K$,
(2.2)

For a bifunction $\mathrm{\Psi }:K×K\to \mathbb{R}$, we have the following lemmas which were also given in .

Lemma 2.1 (Blum-Oettli [, Corollary 1])

Let K be a nonempty closed convex subset of H and Ψ be a bifunction of $K×K$ into $\mathbb{R}$ satisfying (A1)-(A4) in Condition 1.1. Let $r>0$ and $x\in H$. Then there exists $z\in K$ such that
$\mathrm{\Psi }\left(z,y\right)+\frac{1}{r}〈y-z,z-x〉\ge 0,\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K.$

Using a similar proof technique of Combettes-Hirstoaga [, Lemma 2.12], also see Ceng and Yao [, Lemma 3.1], Peng, Liou and Yao [, Lemma 2.2] obtained the following lemma which guarantees that our algorithms are well defined.

Lemma 2.2 ([, Lemma 2.2])

Let K be a nonempty closed convex subset of H. Suppose that the bifunction $F:K×K\to \mathbb{R}$ and the function $\phi :K\to \mathbb{R}\cup \left\{+\mathrm{\infty }\right\}$ satisfy Condition  1.1. For $r>0$ and $x\in H$, define a mapping ${T}_{r}:H\to {2}^{K}$ as follows:
${T}_{r}\left(x\right)=\left\{z\in K:\phantom{\rule{0.25em}{0ex}}F\left(z,y\right)+\phi \left(y\right)-\phi \left(z\right)+\frac{1}{r}〈y-z,z-x〉\ge 0,\mathrm{\forall }y\in K\right\}.$
Then the following hold:
1. (1)

the domain of ${T}_{r}$ is H.

2. (2)
${T}_{r}$ is single-valued and firmly nonexpansive, i.e., for any $x,y\in H$,
${\parallel {T}_{r}\left(x\right)-{T}_{r}\left(y\right)\parallel }^{2}\le 〈{T}_{r}\left(x\right)-{T}_{r}\left(y\right),x-y〉$

or equivalently,
${\parallel {T}_{r}\left(x\right)-{T}_{r}\left(y\right)\parallel }^{2}\le {\parallel x-y\parallel }^{2}-{\parallel \left(x-{T}_{r}\left(x\right)\right)-\left(y-{T}_{r}\left(y\right)\right)\parallel }^{2}.$
1. (3)

$F\left({T}_{r}\right)=MEP\left(F,\phi \right)$.

2. (4)

$MEP\left(F,\phi \right)$ is closed and convex.

Lemma 2.3 was showed and used by several authors. For detailed proofs, see Liu  and Xu [26, 27]. Furthermore, a variant of Lemma 2.3 has already been used by Reich in [, Theorem 1].

Lemma 2.3 Let $\left\{{a}_{n}\right\}$ be a sequence of nonnegative real numbers satisfying the property
${a}_{n+1}\le \left(1-{t}_{n}\right){a}_{n}+{t}_{n}{c}_{n},\phantom{\rule{1em}{0ex}}\mathrm{\forall }n\ge 0,$

where $\left\{{t}_{n}\right\}$ and $\left\{{c}_{n}\right\}$ satisfy the restrictions ${\sum }_{n=0}^{\mathrm{\infty }}{t}_{n}=\mathrm{\infty }$ and ${lim sup}_{n\to \mathrm{\infty }}{c}_{n}\le 0$. Then $\left\{{a}_{n}\right\}$ converges to zero as $n\to \mathrm{\infty }$.

3 Strong convergence of Algorithm 1

In this section, we deal with an iterative scheme given by Algorithm 1 for finding an element of the set of solutions of the MEP (1.1) in a Hilbert space.

Theorem 3.1 Let K be a nonempty closed convex subset of a real Hilbert space H. Assume that a bifunction F and a function φ satisfy Condition 1.1 and $MEP\left(F,\phi \right)\ne \mathrm{\varnothing }$. For any anchor $u\in K$ and initialization ${x}_{0}\in K$, let $\left\{{x}_{n}\right\}$ and $\left\{{u}_{n}\right\}$ be two sequences generated iteratively by
$\left\{\begin{array}{c}F\left({u}_{n},y\right)+\phi \left(y\right)-\phi \left({u}_{n}\right)+\frac{1}{{r}_{n}}〈y-{u}_{n},{u}_{n}-{x}_{n}〉\ge 0,\hfill \\ {x}_{n+1}={\alpha }_{n}u+\left(1-{\alpha }_{n}\right){u}_{n},\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K,n\ge 0.\hfill \end{array}$
(3.1)
If only $\left\{{\alpha }_{n}\right\}\subset \left(0,1\right)$ and $\left\{{r}_{n}\right\}\subset \left(0,+\mathrm{\infty }\right)$ satisfy
$\left(\mathrm{C}\mathrm{1}\right)\phantom{\rule{0.25em}{0ex}}\underset{n\to \mathrm{\infty }}{lim}{\alpha }_{n}=0,\phantom{\rule{2em}{0ex}}\left(\mathrm{C}\mathrm{2}\right)\phantom{\rule{0.25em}{0ex}}\sum _{n=1}^{+\mathrm{\infty }}{\alpha }_{n}=+\mathrm{\infty }\phantom{\rule{1em}{0ex}}\mathit{\text{and}}\phantom{\rule{1em}{0ex}}\left(\mathrm{C}\mathrm{3}\right)\phantom{\rule{0.25em}{0ex}}\underset{n\to \mathrm{\infty }}{lim inf}{r}_{n}>0,$

then $\left\{{x}_{n}\right\}$ converge strongly to some element ${x}^{\ast }={P}_{MEP\left(F,\phi \right)}\left(u\right)$ of $MEP\left(F,\phi \right)$.

Proof At first, we show that $\left\{{x}_{n}\right\}$ and $\left\{{u}_{n}\right\}$ are bounded. Taking $p\in MEP\left(F,\phi \right)$, it follows from Lemma 2.2 that ${u}_{n}={T}_{{r}_{n}}\left({x}_{n}\right)$ and
$\begin{array}{rcl}\parallel {x}_{n+1}-p\parallel & \le & \left(1-{\alpha }_{n}\right)\parallel {T}_{{r}_{n}}\left({x}_{n}\right)-p\parallel +{\alpha }_{n}\parallel u-p\parallel \\ \le & \left(1-{\alpha }_{n}\right)\parallel {x}_{n}-p\parallel +{\alpha }_{n}\parallel u-p\parallel \\ \le & max\left\{\parallel {x}_{n}-p\parallel ,\parallel u-p\parallel \right\}\\ ⋮\\ \le & max\left\{\parallel {x}_{0}-p\parallel ,\parallel u-p\parallel \right\}.\end{array}$

Thus, $\left\{{x}_{n}\right\}$ is bounded, and hence so is $\left\{{u}_{n}\right\}$.

With the help of the geometric properties of a Hilbert space, from the closed convexity of $MEP\left(F,\phi \right)$, for $u\in K$, there exists a unique nearest point ${x}^{\ast }\in MEP\left(F,\phi \right)$, that is, ${x}^{\ast }={P}_{MEP\left(F,\phi \right)}u$. By equation (2.1) and Lemma 2.2(2), (3), for each fixed n, we also have
$\begin{array}{rcl}{\parallel {x}_{n+1}-{x}^{\ast }\parallel }^{2}& =& {\parallel {\alpha }_{n}\left(u-{x}^{\ast }\right)+\left(1-{\alpha }_{n}\right)\left({u}_{n}-{x}^{\ast }\right)\parallel }^{2}\\ \le & {\alpha }_{n}{\parallel u-{x}^{\ast }\parallel }^{2}+\left(1-{\alpha }_{n}\right){\parallel {T}_{{r}_{n}}\left({x}_{n}\right)-{x}^{\ast }\parallel }^{2}\\ \le & {\parallel {T}_{{r}_{n}}\left({x}_{n}\right)-{x}^{\ast }\parallel }^{2}+{\alpha }_{n}{\parallel u-{x}^{\ast }\parallel }^{2}\\ \le & {\parallel {x}_{n}-{x}^{\ast }\parallel }^{2}-{\parallel {x}_{n}-{T}_{{r}_{n}}\left({x}_{n}\right)\parallel }^{2}+{\alpha }_{n}{\parallel u-{x}^{\ast }\parallel }^{2},\end{array}$
which can be rewritten as
${\parallel {x}_{n}-{u}_{n}\parallel }^{2}\le {\alpha }_{n}M+{\parallel {x}_{n}-{x}^{\ast }\parallel }^{2}-{\parallel {x}_{n+1}-{x}^{\ast }\parallel }^{2},$
(3.2)

where $M={\parallel u-{x}^{\ast }\parallel }^{2}$. Following the proof technique in Mainge [, Lemma 3.2, Theorem 3.1], the proof may be divided into two cases.

Case 1. If there exists ${N}_{0}$ such that the sequence $\left\{{\parallel {x}_{n}-{x}^{\ast }\parallel }^{2}\right\}$ is nonincreasing for $n\ge {N}_{0}$, then the limit ${lim}_{n\to \mathrm{\infty }}{\parallel {x}_{n}-{x}^{\ast }\parallel }^{2}$ exists, and hence ${lim}_{n\to \mathrm{\infty }}\left({\parallel {x}_{n}-{x}^{\ast }\parallel }^{2}-{\parallel {x}_{n+1}-{x}^{\ast }\parallel }^{2}\right)=0$. So, by the condition (C1) and inequality (3.2), we have
$\underset{n\to \mathrm{\infty }}{lim}\parallel {x}_{n}-{u}_{n}\parallel =0.$
(3.3)
Next, we show
$\underset{n\to \mathrm{\infty }}{lim sup}〈u-{x}^{\ast },{u}_{n}-{x}^{\ast }〉\le 0.$
(3.4)
Indeed, we can take a subsequence $\left\{{u}_{{n}_{k}}\right\}$ of $\left\{{u}_{n}\right\}$ such that
$\underset{n\to \mathrm{\infty }}{lim sup}〈u-{x}^{\ast },{u}_{n}-{x}^{\ast }〉=\underset{k\to \mathrm{\infty }}{lim}〈u-{x}^{\ast },{u}_{{n}_{k}}-{x}^{\ast }〉.$
Without loss of generality, we may assume that ${u}_{{n}_{k}}⇀x$ by the boundedness of $\left\{{u}_{n}\right\}$. Let us show $x\in MEP\left(F,\phi \right)$. In fact, the first inequality of (3.1) yields
$F\left({u}_{n},y\right)+\phi \left(y\right)-\phi \left({u}_{n}\right)+\frac{1}{{r}_{n}}〈y-{u}_{n},{u}_{n}-{x}_{n}〉\ge 0,\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K,n\ge 0.$
From the property (A2) of Condition 1.1, we also have
$\frac{1}{{r}_{n}}〈y-{u}_{n},{u}_{n}-{x}_{n}〉\ge -F\left({u}_{n},y\right)-\phi \left(y\right)+\phi \left({u}_{n}\right)\ge F\left(y,{u}_{n}\right)+\phi \left({u}_{n}\right)-\phi \left(y\right)$
and hence by replacing n by ${n}_{k}$, we obtain
$〈y-{u}_{{n}_{k}},\frac{{u}_{{n}_{k}}-{x}_{{n}_{k}}}{{r}_{{n}_{k}}}〉\ge F\left(y,{u}_{{n}_{k}}\right)+\phi \left({u}_{{n}_{k}}\right)-\phi \left(y\right),\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K.$
By passing to the limit in this inequality and by taking into account the condition (C3) and the fact that ${lim}_{k\to \mathrm{\infty }}\frac{{u}_{{n}_{k}}-{x}_{{n}_{k}}}{{r}_{{n}_{k}}}=0$, ${u}_{{n}_{k}}⇀x$ and that the bifunction $F\left(y,\cdot \right)$ and the function $\phi \left(\cdot \right)$ are weak lower-semicontinuous, we deduce that
$0\ge F\left(y,x\right)+\phi \left(x\right)-\phi \left(y\right),\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K.$
Now, for t with $0 and $y\in K$, let ${y}_{t}=ty+\left(1-t\right)x$. Since $y\in K$ and $x\in K$, we have ${y}_{t}\in K$, and hence $0\ge F\left({y}_{t},x\right)+\phi \left(x\right)-\phi \left({y}_{t}\right)$. So, by virtue of (A1), (A4) of the bifunction F and convexity of the function φ, we get
$\begin{array}{rcl}0& =& F\left({y}_{t},{y}_{t}\right)+\phi \left({y}_{t}\right)-\phi \left({y}_{t}\right)\\ \le & tF\left({y}_{t},y\right)+\left(1-t\right)F\left({y}_{t},x\right)+t\phi \left(y\right)+\left(1-t\right)\phi \left(x\right)-\phi \left({y}_{t}\right)\\ =& tF\left({y}_{t},y\right)+t\left(\phi \left(y\right)-\phi \left({y}_{t}\right)\right)+\left(1-t\right)\left(F\left({y}_{t},x\right)+\phi \left(x\right)-\phi \left({y}_{t}\right)\right)\\ \le & t\left(F\left({y}_{t},y\right)+\phi \left(y\right)-\phi \left({y}_{t}\right)\right).\end{array}$
Consequently, we deduce
$F\left({y}_{t},y\right)+\phi \left(y\right)-\phi \left({y}_{t}\right)\ge 0,\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K.$
In the light of (A3) of the bifunction F and lower-semicontinuity of the function φ, we have
$F\left(x,y\right)+\phi \left(y\right)-\phi \left(x\right)\ge 0,\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K,$
thus $x\in MEP\left(F,\phi \right)$. Since ${x}^{\ast }={P}_{MEP\left(F,\phi \right)}u$, then by (2.2), we have
$\underset{n\to \mathrm{\infty }}{lim sup}〈u-{x}^{\ast },{u}_{n}-{x}^{\ast }〉=\underset{k\to \mathrm{\infty }}{lim}〈u-{x}^{\ast },{u}_{{n}_{k}}-{x}^{\ast }〉=〈u-{x}^{\ast },x-{x}^{\ast }〉\le 0.$
Now, we show that ${x}_{n}\to {x}^{\ast }$ ($n\to \mathrm{\infty }$). In fact, from the second equality of (3.1) and ${x}^{\ast }\in F\left({T}_{r}\right)=MEP\left(F,\phi \right)$ for each $r>0$ together with Lemma 2.2(2), it follows
$\begin{array}{rcl}{\parallel {x}_{n+1}-{x}^{\ast }\parallel }^{2}& =& {\parallel {\alpha }_{n}\left(u-{x}^{\ast }\right)+\left(1-{\alpha }_{n}\right)\left({u}_{n}-{x}^{\ast }\right)\parallel }^{2}\\ =& {\alpha }_{n}^{2}{\parallel u-{x}^{\ast }\parallel }^{2}+{\left(1-{\alpha }_{n}\right)}^{2}{\parallel {u}_{n}-{x}^{\ast }\parallel }^{2}\\ +2{\alpha }_{n}\left(1-{\alpha }_{n}\right)〈u-{x}^{\ast },{u}_{n}-{x}^{\ast }〉\\ \le & \left(1-{\alpha }_{n}\right){\parallel {T}_{{r}_{n}}\left({x}_{n}\right)-{T}_{{r}_{n}}\left({x}^{\ast }\right)\parallel }^{2}+{\alpha }_{n}{\beta }_{n}\\ \le & \left(1-{\alpha }_{n}\right){\parallel {x}_{n}-{x}^{\ast }\parallel }^{2}+{\alpha }_{n}{\beta }_{n},\end{array}$
which can be rewritten as
${\parallel {x}_{n+1}-{x}^{\ast }\parallel }^{2}\le \left(1-{\alpha }_{n}\right){\parallel {x}_{n}-{x}^{\ast }\parallel }^{2}+{\alpha }_{n}{\beta }_{n},$
(3.5)
where ${\beta }_{n}={\alpha }_{n}{\parallel u-{x}^{\ast }\parallel }^{2}+2\left(1-{\alpha }_{n}\right)〈u-{x}^{\ast },{u}_{n}-{x}^{\ast }〉$. From the condition (C1) and (3.4), we obtain
$\underset{n\to \mathrm{\infty }}{lim sup}{\beta }_{n}=\underset{n\to \mathrm{\infty }}{lim sup}\left({\alpha }_{n}{\parallel u-{x}^{\ast }\parallel }^{2}+2\left(1-{\alpha }_{n}\right)〈u-{x}^{\ast },{u}_{n}-{x}^{\ast }〉\right)\le 0.$

So, an application of Lemma 2.3 onto (3.5) yields ${x}_{n}\to {x}^{\ast }$.

Case 2. Assume that there exists a subsequence $\left\{{\parallel {x}_{{n}_{k}}-{x}^{\ast }\parallel }^{2}\right\}$ of $\left\{{\parallel {x}_{n}-{x}^{\ast }\parallel }^{2}\right\}$ such that ${\parallel {x}_{{n}_{k}}-{x}^{\ast }\parallel }^{2}<{\parallel {x}_{{n}_{k}+1}-{x}^{\ast }\parallel }^{2}$ for all $k\ge 0$. Let
${\mathrm{\Gamma }}_{n}={\parallel {x}_{n}-{x}^{\ast }\parallel }^{2}\phantom{\rule{1em}{0ex}}\text{and}\phantom{\rule{1em}{0ex}}\tau \left(n\right)=max\left\{k\le n;{\mathrm{\Gamma }}_{k}<{\mathrm{\Gamma }}_{k+1}\right\}.$
It follows from Mainge [, Lemma 3.1] that $\tau \left(n\right)$ is a nondecreasing sequence verifying ${lim}_{n\to \mathrm{\infty }}\tau \left(n\right)=+\mathrm{\infty }$, and for n large enough,
${\mathrm{\Gamma }}_{\tau \left(n\right)}\le {\mathrm{\Gamma }}_{\tau \left(n\right)+1},\phantom{\rule{2em}{0ex}}{\mathrm{\Gamma }}_{n}={\parallel {x}_{n}-{x}^{\ast }\parallel }^{2}\le {\mathrm{\Gamma }}_{\tau \left(n\right)+1}.$
(3.6)
In light of equation (3.2), we have ${\parallel {x}_{\tau \left(n\right)}-{u}_{\tau \left(n\right)}\parallel }^{2}\le {\alpha }_{\tau \left(n\right)}M$, and so by the condition (C1), we have
$\underset{n\to \mathrm{\infty }}{lim}\parallel {x}_{\tau \left(n\right)}-{u}_{\tau \left(n\right)}\parallel =0.$
(3.7)
Using the similar proof techniques as in Case 1, the only modification being that n (${n}_{k}$) is replaced by $\tau \left(n\right)$ ($\tau \left({n}_{k}\right)$, respectively), we have
$\underset{n\to \mathrm{\infty }}{lim sup}〈u-{x}^{\ast },{u}_{\tau \left(n\right)}-{x}^{\ast }〉\le 0$
(3.8)
and
${\parallel {x}_{\tau \left(n\right)+1}-{x}^{\ast }\parallel }^{2}\le \left(1-{\alpha }_{\tau \left(n\right)}\right){\parallel {x}_{\tau \left(n\right)}-{x}^{\ast }\parallel }^{2}+{\alpha }_{\tau \left(n\right)}{\beta }_{\tau \left(n\right)},$
(3.9)
where ${\beta }_{\tau \left(n\right)}={\alpha }_{\tau \left(n\right)}{\parallel u-{x}^{\ast }\parallel }^{2}+2\left(1-{\alpha }_{\tau \left(n\right)}\right)〈u-{x}^{\ast },{u}_{\tau \left(n\right)}-{x}^{\ast }〉$, and so
$\underset{n\to \mathrm{\infty }}{lim sup}{\beta }_{\tau \left(n\right)}\le 0.$
By (3.6), we have
${\mathrm{\Gamma }}_{\tau \left(n\right)}\le {\mathrm{\Gamma }}_{\tau \left(n\right)+1}\le \left(1-{\alpha }_{\tau \left(n\right)}\right){\mathrm{\Gamma }}_{\tau \left(n\right)}+{\alpha }_{\tau \left(n\right)}{\beta }_{\tau \left(n\right)},$
and hence
${\mathrm{\Gamma }}_{\tau \left(n\right)}\le {\beta }_{\tau \left(n\right)}.$
So, we obtain
$\underset{n\to \mathrm{\infty }}{lim}{\mathrm{\Gamma }}_{\tau \left(n\right)}=\underset{n\to \mathrm{\infty }}{lim}\parallel {x}_{\tau \left(n\right)}-{x}^{\ast }\parallel =0.$
Together with (3.9), we have
$\underset{n\to \mathrm{\infty }}{lim}\parallel {x}_{\tau \left(n\right)+1}-{x}^{\ast }\parallel =\underset{n\to \mathrm{\infty }}{lim}\parallel {x}_{\tau \left(n\right)}-{x}^{\ast }\parallel =0.$

Now, it follows from (3.6) that ${\mathrm{\Gamma }}_{n}=\parallel {x}_{n}-{x}^{\ast }\parallel \to 0$. The proof is completed. □

4 Weak convergence of Algorithm 2

In this section, we show a weak convergence theorem which solves the MEP (1.1) in a Hilbert space.

Theorem 4.1 Let K be a nonempty closed convex subset of a real Hilbert space H. Assume that a bifunction F and a function φ satisfy Condition 1.1 and $MEP\left(F,\phi \right)\ne \mathrm{\varnothing }$. For any initialization ${x}_{0}\in K$, if ${x}_{n}$ ($n\ge 0$) is the current iterate and positive real numbers ${\alpha }_{n}$, ${r}_{n}$ are the current parameters, then ${x}_{n+1}\in K$ is given iteratively by
$\left\{\begin{array}{c}F\left({u}_{n},y\right)+\phi \left(y\right)-\phi \left({u}_{n}\right)+\frac{1}{{r}_{n}}〈y-{u}_{n},{u}_{n}-{x}_{n}〉\ge 0,\hfill \\ {x}_{n+1}={\alpha }_{n}{x}_{n}+\left(1-{\alpha }_{n}\right){u}_{n},\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K,n\ge 0.\hfill \end{array}$
(4.1)
Assume that $\left\{{\alpha }_{n}\right\}\subset \left(0,1\right)$ satisfies (C4) ${lim sup}_{n\to \mathrm{\infty }}{\alpha }_{n}<1$. Then
$\sum _{n=0}^{+\mathrm{\infty }}{\parallel {u}_{n}-{x}_{n}\parallel }^{2}<+\mathrm{\infty }.$

If, in addition, $\left\{{r}_{n}\right\}\subset \left(0,+\mathrm{\infty }\right)$ satisfies (C3) ${lim inf}_{n\to \mathrm{\infty }}{r}_{n}>0$, then $\left\{{x}_{n}\right\}$ and $\left\{{u}_{n}\right\}$ converge weakly to some element x of $MEP\left(F,\phi \right)$.

Proof Take $p\in MEP\left(F,\phi \right)$. It follows from Lemma 2.2 that ${u}_{n}={T}_{{r}_{n}}\left({x}_{n}\right)$ and
$\begin{array}{rcl}\parallel {x}_{n+1}-p\parallel & \le & \left(1-{\alpha }_{n}\right)\parallel {T}_{{r}_{n}}\left({x}_{n}\right)-p\parallel +{\alpha }_{n}\parallel {x}_{n}-p\parallel \\ \le & \left(1-{\alpha }_{n}\right)\parallel {x}_{n}-p\parallel +{\alpha }_{n}\parallel {x}_{n}-p\parallel \\ \le & \parallel {x}_{n}-p\parallel \\ ⋮\\ \le & \parallel {x}_{0}-p\parallel .\end{array}$

So, $\left\{{x}_{n}\right\}$ and $\left\{{u}_{n}\right\}$ are bounded. Moreover, the limit ${lim}_{n\to \mathrm{\infty }}\parallel {x}_{n}-p\parallel$ exists for each $p\in MEP\left(F,\phi \right)$.

It follows from equation (2.1) and Lemma 2.2(2), (3) that for each fixed n,
$\begin{array}{rcl}{\parallel {x}_{n+1}-p\parallel }^{2}& =& {\parallel {\alpha }_{n}\left({x}_{n}-p\right)+\left(1-{\alpha }_{n}\right)\left({u}_{n}-p\right)\parallel }^{2}\\ \le & {\alpha }_{n}{\parallel {x}_{n}-p\parallel }^{2}+\left(1-{\alpha }_{n}\right){\parallel {T}_{{r}_{n}}\left({x}_{n}\right)-p\parallel }^{2}\\ \le & {\alpha }_{n}{\parallel {x}_{n}-p\parallel }^{2}+\left(1-{\alpha }_{n}\right)\left({\parallel {x}_{n}-p\parallel }^{2}-{\parallel {x}_{n}-{T}_{{r}_{n}}\left({x}_{n}\right)\parallel }^{2}\right)\\ \le & {\parallel {x}_{n}-p\parallel }^{2}-\left(1-{\alpha }_{n}\right){\parallel {x}_{n}-{T}_{{r}_{n}}\left({x}_{n}\right)\parallel }^{2},\end{array}$
which can be rewritten as
$\left(1-{\alpha }_{n}\right){\parallel {x}_{n}-{u}_{n}\parallel }^{2}\le {\parallel {x}_{n}-p\parallel }^{2}-{\parallel {x}_{n+1}-p\parallel }^{2}.$
(4.2)
Therefore, we obtain
$\sum _{n=0}^{m}\left(1-{\alpha }_{n}\right){\parallel {x}_{n}-{u}_{n}\parallel }^{2}\le {\parallel {x}_{0}-p\parallel }^{2}-{\parallel {x}_{m}-p\parallel }^{2}\le {\parallel {x}_{0}-p\parallel }^{2},$
and hence
$\sum _{n=0}^{+\mathrm{\infty }}\left(1-{\alpha }_{n}\right){\parallel {x}_{n}-{u}_{n}\parallel }^{2}<+\mathrm{\infty }.$
Since $\left\{{\alpha }_{n}\right\}\subset \left(0,1\right)$ satisfies (C4) ${lim sup}_{n\to \mathrm{\infty }}{\alpha }_{n}<1$, then there exists $a\in \left(0,1\right)$ and N sufficiently large such that $0<{\alpha }_{n}\le a<1$ for all $n>N$, which implies $\left(1-a\right){\parallel {x}_{n}-{u}_{n}\parallel }^{2}\le \left(1-{\alpha }_{n}\right){\parallel {x}_{n}-{u}_{n}\parallel }^{2}$. Consequently,
$\sum _{n=0}^{+\mathrm{\infty }}{\parallel {x}_{n}-{u}_{n}\parallel }^{2}<+\mathrm{\infty },$
and so
$\underset{n\to \mathrm{\infty }}{lim}\parallel {x}_{n}-{u}_{n}\parallel =0.$
(4.3)

Therefore, the limit ${lim}_{n\to \mathrm{\infty }}\parallel {u}_{n}-p\parallel$ exists for each $p\in MEP\left(F,\phi \right)$ since $\parallel {x}_{n}-p\parallel -\parallel {x}_{n}-{u}_{n}\parallel \le \parallel {u}_{n}-p\parallel \le \parallel {x}_{n}-p\parallel$.

By properties of Hilbert spaces, the boundedness of $\left\{{u}_{n}\right\}$ means that the sequence $\left\{{u}_{n}\right\}$ is weak compact in H, and hence there exists a subsequence $\left\{{u}_{{n}_{k}}\right\}$ of $\left\{{u}_{n}\right\}$ such that ${u}_{{n}_{k}}⇀x$. Then using the same argument as in the proof of Theorem 3.1 by means of (4.3) and the condition (C3) together with the properties of the bifunction F and the function φ, we must have $x\in MEP\left(F,\phi \right)$.

Next, we show that there is a unique weak cluster point x of the sequence $\left\{{u}_{n}\right\}$, that is, ${u}_{n}⇀x$. This fact can be reached from the Opial property of H and the existence of ${lim}_{n\to \mathrm{\infty }}\parallel {u}_{n}-p\parallel$ for each $p\in MEP\left(F,\phi \right)$. The proof is presented here for completeness. Indeed, let z be another weak cluster point of $\left\{{u}_{n}\right\}$, write as ${u}_{{n}_{i}}⇀z$. Then we also have $z\in MEP\left(F,\phi \right)$. Let us show that $x=z$. For x, z, we have
${\parallel {u}_{{n}_{i}}-x\parallel }^{2}={\parallel {u}_{{n}_{i}}-z\parallel }^{2}+{\parallel z-x\parallel }^{2}+2〈{u}_{{n}_{i}}-z,z-x〉$
and
${\parallel {u}_{{n}_{k}}-z\parallel }^{2}={\parallel {u}_{{n}_{k}}-x\parallel }^{2}+{\parallel x-z\parallel }^{2}+2〈{u}_{{n}_{k}}-x,x-z〉.$
Since both ${lim}_{n\to \mathrm{\infty }}\parallel {u}_{n}-x\parallel$ and ${lim}_{n\to \mathrm{\infty }}\parallel {u}_{n}-z\parallel$ exist, ${lim}_{i\to \mathrm{\infty }}〈{u}_{{n}_{i}}-z,z-x〉=0$ and ${lim}_{k\to \mathrm{\infty }}〈{u}_{{n}_{k}}-x,x-z〉=0$, then
$\underset{n\to \mathrm{\infty }}{lim}{\parallel {u}_{n}-x\parallel }^{2}=\underset{n\to \mathrm{\infty }}{lim}{\parallel {u}_{n}-z\parallel }^{2}+{\parallel z-x\parallel }^{2}$
and
$\underset{n\to \mathrm{\infty }}{lim}{\parallel {u}_{n}-z\parallel }^{2}=\underset{n\to \mathrm{\infty }}{lim}{\parallel {u}_{n}-x\parallel }^{2}+{\parallel x-z\parallel }^{2}.$

Adding the above equations, we must have $2{\parallel x-z\parallel }^{2}=0$, and so $x=z$. This implies ${u}_{n}⇀x\in MEP\left(F,\phi \right)$. By (4.3), it is obvious that $\left\{{x}_{n}\right\}$ also converges weakly to x. The desired results are reached. □

5 Deduced results and some remarks

Let K be a nonempty closed convex subset of a real Hilbert space H. We recall that a mapping $T:K\to H$ is said to be monotone if

A continuous monotone mapping has the following properties which were given in Nilsrakoo and Saejung  and Combettes and Hirstoaga  independently.

Lemma 5.1 (Combettes and Hirstoaga [, Lemma 2.15], Nilsrakoo and Saejung [, Lemmas 19, 20])

Let K be a nonempty closed convex subset of a real Hilbert space H. Let T be a continuous monotone mapping of K into H. Define a bifunction $F:K×K\to \mathbb{R}$ as follows:
$F\left(x,y\right):=〈Tx,y-x〉\phantom{\rule{1em}{0ex}}\mathit{\text{for all}}x,y\in K.$
Then the following hold:
1. (i)

F satisfies (A1)-(A4) in Condition 1.1 and $VIP\left(K,T\right)=EP\left(F\right)$;

2. (ii)
for $x\in H$, $z\in K$ and $r>0$,
$F\left(z,y\right)+\frac{1}{r}〈y-z,z-x〉\ge 0,\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K\phantom{\rule{1em}{0ex}}⇔\phantom{\rule{1em}{0ex}}z={P}_{K}\left(x-rTz\right).$

Using Theorems 3.1 and 4.1 along with Lemma 5.1, we have the following theorems which solve GVIP (1.5) and VIP (1.4) under the simpler framework.

Theorem 5.2 Let K be a nonempty closed convex subset of H and T be a continuous monotone mapping of K such that $VIP\left(K,T\right)\ne \mathrm{\varnothing }$. For any anchor $u\in K$ and initialization ${x}_{0}\in K$,
1. (1)
let $\left\{{x}_{n}\right\}$ and $\left\{{u}_{n}\right\}$ be sequences generated iteratively by
$\left\{\begin{array}{c}{u}_{n}={P}_{K}\left({x}_{n}-{r}_{n}T{u}_{n}\right),\hfill \\ {x}_{n+1}={\alpha }_{n}u+\left(1-{\alpha }_{n}\right){u}_{n}.\hfill \end{array}$
(5.1)

Assume that ${\alpha }_{n}\in \left(0,1\right)$ and ${r}_{n}\in \left(0,+\mathrm{\infty }\right)$ satisfy
$\left(\mathrm{C}\mathrm{1}\right)\phantom{\rule{0.25em}{0ex}}\underset{n\to \mathrm{\infty }}{lim}{\alpha }_{n}=0,\phantom{\rule{2em}{0ex}}\left(\mathrm{C}\mathrm{2}\right)\phantom{\rule{0.25em}{0ex}}\sum _{n=1}^{+\mathrm{\infty }}{\alpha }_{n}=+\mathrm{\infty }\phantom{\rule{1em}{0ex}}\mathit{\text{and}}\phantom{\rule{1em}{0ex}}\left(\mathrm{C}\mathrm{3}\right)\phantom{\rule{0.25em}{0ex}}\underset{n\to \mathrm{\infty }}{lim inf}{r}_{n}>0.$
Then $\left\{{x}_{n}\right\}$ converges strongly to ${x}^{\ast }\in VIP\left(K,T\right)$, which is the nearest point from K to $VIP\left(K,T\right)$;
1. (2)
let $\left\{{x}_{n}\right\}$ and $\left\{{u}_{n}\right\}$ be sequences generated iteratively by
$\left\{\begin{array}{c}{u}_{n}={P}_{K}\left({x}_{n}-{r}_{n}T{u}_{n}\right),\hfill \\ {x}_{n+1}={\alpha }_{n}{x}_{n}+\left(1-{\alpha }_{n}\right){u}_{n},\hfill \end{array}$
(5.2)

where ${r}_{n}\in \left(0,+\mathrm{\infty }\right)$ and ${\alpha }_{n}\in \left(0,1\right)$ satisfy (C3) and (C4) ${lim sup}_{n\to \mathrm{\infty }}{\alpha }_{n}<1$. Then $\left\{{x}_{n}\right\}$ converges weakly to some ${x}^{\ast }\in VIP\left(K,T\right)$.

Proof Let $F\left(x,y\right)=〈Tx,y-x〉$ for all $x,y\in K$. It follows from Lemma 5.1 that two iteration schemes (5.1) and (5.2) respectively turn into
$\left\{\begin{array}{c}F\left({u}_{n},y\right)+\frac{1}{{r}_{n}}〈y-{u}_{n},{u}_{n}-{x}_{n}〉\ge 0,\hfill \\ {x}_{n+1}={\alpha }_{n}u+\left(1-{\alpha }_{n}\right){u}_{n},\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K,n\ge 0,\hfill \end{array}$
and
$\left\{\begin{array}{c}F\left({u}_{n},y\right)+\frac{1}{{r}_{n}}〈y-{u}_{n},{u}_{n}-{x}_{n}〉\ge 0,\hfill \\ {x}_{n+1}={\alpha }_{n}{x}_{n}+\left(1-{\alpha }_{n}\right){u}_{n},\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K,n\ge 0.\hfill \end{array}$

Following Theorems 3.1 and 4.1 ($\phi \equiv 0$), the desired results are proved. □

Theorem 5.3 Let K be a nonempty closed convex subset of H, φ be a convex and lower semicontinuous function from K to $\mathbb{R}$, and T be a continuous monotone mapping of K such that $GVIP\left(K,\phi ,T\right)\ne \mathrm{\varnothing }$. For any anchor $u\in K$ and initialization ${x}_{0}\in K$,
1. (1)
let $\left\{{x}_{n}\right\}$ and $\left\{{u}_{n}\right\}$ be sequences generated iteratively by
$\left\{\begin{array}{c}〈T{u}_{n},y-{u}_{n}〉+\phi \left(y\right)-\phi \left({u}_{n}\right)+\frac{1}{{r}_{n}}〈y-{u}_{n},{u}_{n}-{x}_{n}〉\ge 0,\hfill \\ {x}_{n+1}={\alpha }_{n}u+\left(1-{\alpha }_{n}\right){u}_{n},\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K,n\ge 0,\hfill \end{array}$
(5.3)

where ${\alpha }_{n}\in \left(0,1\right)$ and ${r}_{n}\in \left(0,+\mathrm{\infty }\right)$ satisfy (C1), (C2) and (C3). Then $\left\{{x}_{n}\right\}$ converges strongly to ${x}^{\ast }\in GVIP\left(K,\phi ,T\right)$, which is the nearest point from K to $GVIP\left(K,\phi ,T\right)$;
1. (2)
let $\left\{{x}_{n}\right\}$ and $\left\{{u}_{n}\right\}$ be sequences generated iteratively by
$\left\{\begin{array}{c}〈T{u}_{n},y-{u}_{n}〉+\phi \left(y\right)-\phi \left({u}_{n}\right)+\frac{1}{{r}_{n}}〈y-{u}_{n},{u}_{n}-{x}_{n}〉\ge 0,\hfill \\ {x}_{n+1}={\alpha }_{n}{x}_{n}+\left(1-{\alpha }_{n}\right){u}_{n},\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K,n\ge 0,\hfill \end{array}$
(5.4)

where ${r}_{n}\in \left(0,+\mathrm{\infty }\right)$ and ${\alpha }_{n}\in \left(0,1\right)$ satisfy (C3) and (C4). Then $\left\{{x}_{n}\right\}$ converges weakly to some ${x}^{\ast }\in GVIP\left(K,\phi ,T\right)$.

Proof Let $F\left(x,y\right)=〈Tx,y-x〉$ for all $x,y\in K$. It follows from Lemma 5.1, Theorems 3.1 and 4.1, the desired results are obtained. □

For the classical equilibrium problem (1.2), the following is obvious ($\phi \equiv 0$ in Theorems 3.1 and 4.1).

Theorem 5.4 Let K be a nonempty closed convex subset of H and F be a bifunction from $K×K$ to $\mathbb{R}$ such that (A1)-(A4) of Condition 1.1 and $EP\left(F\right)\ne \mathrm{\varnothing }$. For any anchor $u\in K$ and initialization ${x}_{0}\in K$,
1. (1)
let $\left\{{x}_{n}\right\}$ and $\left\{{u}_{n}\right\}$ be sequences generated iteratively by
$\left\{\begin{array}{c}F\left({u}_{n},y\right)+\frac{1}{{r}_{n}}〈y-{u}_{n},{u}_{n}-{x}_{n}〉\ge 0,\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K,\hfill \\ {x}_{n+1}={\alpha }_{n}u+\left(1-{\alpha }_{n}\right){u}_{n},\phantom{\rule{1em}{0ex}}n\ge 0,\hfill \end{array}$
(5.5)

where ${\alpha }_{n}\in \left(0,1\right)$ and ${r}_{n}\in \left(0,+\mathrm{\infty }\right)$ satisfy (C1), (C2) and (C3). Then $\left\{{x}_{n}\right\}$ converges strongly to ${x}^{\ast }\in EP\left(F\right)$, which is the nearest point from K to $EP\left(F\right)$;
1. (2)
let $\left\{{x}_{n}\right\}$ and $\left\{{u}_{n}\right\}$ be sequences generated iteratively by
$\left\{\begin{array}{c}F\left({u}_{n},y\right)+\frac{1}{{r}_{n}}〈y-{u}_{n},{u}_{n}-{x}_{n}〉\ge 0,\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K,\hfill \\ {x}_{n+1}={\alpha }_{n}{x}_{n}+\left(1-{\alpha }_{n}\right){u}_{n},\phantom{\rule{1em}{0ex}}n\ge 0,\hfill \end{array}$
(5.6)

where ${r}_{n}\in \left(0,+\mathrm{\infty }\right)$ and ${\alpha }_{n}\in \left(0,1\right)$ satisfy (C3) and (C4). Then $\left\{{x}_{n}\right\}$ converges weakly to some ${x}^{\ast }\in EP\left(F\right)$.

When $F\equiv 0$ in Theorems 3.1 and 4.1, we also have better approximated algorithm about solving the minimization problem (1.3) of a function φ.

Theorem 5.5 Let K be a nonempty closed convex subset of H and φ be a convex and lower-continuous function from K to $\mathbb{R}$ such that $Argmin\left(\phi \right)\ne \mathrm{\varnothing }$. For any anchor $u\in K$ and initialization ${x}_{0}\in K$,
1. (1)
let $\left\{{x}_{n}\right\}$ and $\left\{{u}_{n}\right\}$ be sequences generated iteratively by
$\left\{\begin{array}{c}\phi \left(y\right)-\phi \left({u}_{n}\right)+\frac{1}{{r}_{n}}〈y-{u}_{n},{u}_{n}-{x}_{n}〉\ge 0,\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K,\hfill \\ {x}_{n+1}={\alpha }_{n}u+\left(1-{\alpha }_{n}\right){u}_{n},\phantom{\rule{1em}{0ex}}n\ge 0,\hfill \end{array}$
(5.7)

where ${\alpha }_{n}\in \left(0,1\right)$ and ${r}_{n}\in \left(0,+\mathrm{\infty }\right)$ satisfy (C1), (C2) and (C3). Then $\left\{{x}_{n}\right\}$ converges strongly to ${x}^{\ast }\in Argmin\left(\phi \right)$, which is the nearest point from K to $Argmin\left(\phi \right)$;
1. (2)
let $\left\{{x}_{n}\right\}$ and $\left\{{u}_{n}\right\}$ be sequences generated iteratively by
$\left\{\begin{array}{c}\phi \left(y\right)-\phi \left({u}_{n}\right)+\frac{1}{{r}_{n}}〈y-{u}_{n},{u}_{n}-{x}_{n}〉\ge 0,\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K,\hfill \\ {x}_{n+1}={\alpha }_{n}{x}_{n}+\left(1-{\alpha }_{n}\right){u}_{n},\phantom{\rule{1em}{0ex}}n\ge 0,\hfill \end{array}$
(5.8)

where ${r}_{n}\in \left(0,+\mathrm{\infty }\right)$ and ${\alpha }_{n}\in \left(0,1\right)$ satisfy (C3) and (C4). Then $\left\{{x}_{n}\right\}$ converges weakly to some ${x}^{\ast }\in Argmin\left(\phi \right)$.

We also observe the condition (C4) that ${lim sup}_{n\to \mathrm{\infty }}{\alpha }_{n}<1$ includes the case that ${\alpha }_{n}=0$ as a special case. Therefore, our iteration scheme contains several proximal point algorithms that compute the solution ${x}_{n+1}\in K$ of some regularized problem.

Theorem 5.6 Let K be a nonempty closed convex subset of a real Hilbert space H. Assume that a bifunction F and a function φ satisfy Condition 1.1 and $MEP\left(F,\phi \right)\ne \mathrm{\varnothing }$. Let T be a continuous monotone mapping of K such that $GVIP\left(K,\phi ,T\right)\ne \mathrm{\varnothing }$. For any initialization ${x}_{0}\in K$, if ${x}_{n}$ ($n\ge 0$) is the current iterate and a positive real number ${r}_{n}$ is the current parameter, then ${x}_{n+1}$ is defined by computing the solution of the regularized problem
$F\left({x}_{n+1},y\right)+\phi \left(y\right)-\phi \left({x}_{n+1}\right)+\frac{1}{{r}_{n}}〈y-{x}_{n+1},{x}_{n+1}-{x}_{n}〉\ge 0,\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K$
(5.9)
or
$〈T{x}_{n+1},y-{x}_{n+1}〉+\phi \left(y\right)-\phi \left({x}_{n+1}\right)+\frac{1}{{r}_{n}}〈y-{x}_{n+1},{x}_{n+1}-{x}_{n}〉\ge 0,\phantom{\rule{1em}{0ex}}\mathrm{\forall }y\in K.$
(5.10)
Then
$\sum _{n=0}^{+\mathrm{\infty }}{\parallel {x}_{n+1}-{x}_{n}\parallel }^{2}<+\mathrm{\infty }.$
If, in addition, $\left\{{r}_{n}\right\}\subset \left(0,+\mathrm{\infty }\right)$ satisfies (C3) ${lim inf}_{n\to \mathrm{\infty }}{r}_{n}>0$, then
1. (i)

$\left\{{x}_{n}\right\}$, given by (5.9) converge weakly to some element x of $MEP\left(F,\phi \right)$;

2. (ii)

$\left\{{x}_{n}\right\}$, given by (5.10) converge weakly to some element x of $GVIP\left(K,\phi ,T\right)$.

Proof It follows from Lemma 2.2 or Lemma 5.1 together with (5.9) or (5.10) that ${x}_{n+1}={T}_{{r}_{n}}\left({x}_{n}\right)$. Then by Theorem 4.1, the desired results are obtained. □

Remark 5.7 (1) By particularizing the bifunction F, the function φ and the parameters ${\alpha }_{n}$, ${r}_{n}$, some other methods and related results can be derived from our main theorems. For example, taking $\phi \equiv 0$ in (5.9) and ${lim}_{n\to \mathrm{\infty }}{r}_{n}=+\mathrm{\infty }$ in (5.5), we obtain several main results in Combettes and Hirstoaga , and in the case where (C3), ${\sum }_{n=0}^{+\mathrm{\infty }}\parallel {r}_{n}-{r}_{n+1}\parallel <+\mathrm{\infty }$ and ${\sum }_{n=0}^{+\mathrm{\infty }}{\alpha }_{n}\left(1-{\alpha }_{n}\right)=+\mathrm{\infty }$ in (5.6), we have the main result in Nilsrakoo and Saejung , and when taking ${\alpha }_{n}\in \left[a,b\right]\subset \left(0,1\right)$ in (5.6), a result is proved by Tada and Takahashi , and if ${\alpha }_{n}\equiv 0$ in (5.2), then we obtain Algorithm 2 and Theorem 5 in Solodov and Svaiter ; also see [4, 5, 8, 20] and others for varying versions.
1. (2)

All strong convergence theorems of this paper remain true if one replaces the anchor point u by a contraction f (that is, so-called viscosity approximation methods with a contraction f) since Song  has showed their equivalency. So our main results could recover or develop some viscosity approximation results such as ones in references [8, 10, 11, 13] as well as others not referenced here.

2. (3)

The framework of holding our conclusions is more general and our results treat several iterative schemes and corresponding results in a united way. Consequently, our main results could be considered as recovering, developing and improving some known related convergence results in this field.

Declarations

Acknowledgements

The authors would like to thank the editor and the anonymous referee for useful comments and valuable suggestions on the language and structure of our manuscript. This work is supported by the National Natural Science Foundation of P.R. China (11071279, 11171094, 11271112).

Authors’ Affiliations

(1)
College of Mathematics and Information Science, Henan Normal University, Xinxiang, Henan, 453007, P.R. China
(2)
Department of Applied Mathematics, The Hong Kong Polytechnic University, Hung Hom, Kowloon, Hong Kong, P.R. China
(3)
College of Mathematics and Information Science, North China University of Water Resources and Electric Power, Zhengzhou, 450011, P.R. China

References 