 Research
 Open Access
 Published:
Convergence results for a common solution of a finite family of variational inequality problems for monotone mappings with Bregman distance function
Fixed Point Theory and Applications volume 2013, Article number: 343 (2013)
Abstract
In this paper, we introduce an iterative process which converges strongly to a common solution of a finite family of variational inequality problems for monotone mappings with Bregman distance function. Our convergence theorem is applied to the convex minimization problem. Our theorems extend and unify most of the results that have been proved for the class of monotone mappings.
MSC:47H05, 47J05, 47J25.
1 Introduction
Throughout this paper, E is a real reflexive Banach space with {E}^{\ast} as its dual and f:E\to (\mathrm{\infty},+\mathrm{\infty}] is a proper, lower semicontinuous and convex function. We denote by domf the domain of f, defined by domf:=\{x\in E:f(x)<+\mathrm{\infty}\}. For any x\in int(domf) and y\in E, the righthand derivative of f at x in the direction of y is defined by
The function f is said to be Gâteaux differentiable at x if {lim}_{t\to {0}^{+}}(f(x+ty)f(x))/t exists for any y\in E. In this case, {f}^{0}(x,y) coincides with \mathrm{\nabla}f(x), the value of the gradient ∇f of f at x. The function f is said to be Gâteaux differentiable if it is Gâteaux differentiable for any x\in int(domf). The function f is said to be Fréchet differentiable at x if this limit is attained uniformly in \parallel y\parallel =1. We say that f is uniformly Fréchet differentiable on a subset C of E if the limit is attained uniformly for x\in C and \parallel y\parallel =1.
Let f:E\to (\mathrm{\infty},+\mathrm{\infty}] be a Gâteaux differentiable function. The function {D}_{f}:domf\times int(domf)\to [0,+\mathrm{\infty}) defined by
is called the Bregman distance with respect to f [1].
A Bregman projection with respect to f [1] of x\in int(domf) onto the nonempty, closed and convex set C\subset int(domf) is the unique vector {P}_{C}^{f}(x)\in C satisfying
Remark 1.1 If E is a smooth and strictly convex Banach space and f(x)={\parallel x\parallel}^{2} for all x\in E, then we have that \mathrm{\nabla}f(x)=2J(x) for all x\in E, where J the normalized duality mapping from E into {E}^{\ast}, and hence {D}_{f}(x,y) becomes {D}_{f}(x,y)={\parallel x\parallel}^{2}2\u3008x,Jy\u3009+{\parallel y\parallel}^{2} for all x,y\in E, which is the Lyapunov function introduced by Alber [2] and studied by many authors (see, e.g., [3–9] and the references therein). In addition, under the same condition, the Bregman projection {P}_{C}^{f}(x) reduces to the generalized projection {\mathrm{\Pi}}_{C}(x) (see, e.g., [2]) which is defined by
If E=H, a Hilbert space, J is the identity mapping, and hence the Bregman projection {P}_{C}^{f}(x) reduces to the metric projection of H on to C, {P}_{C}(x).
A mapping A:D(A)\subset E\to {E}^{\ast} is said to be γinverse strongly monotone if there exists a positive real number γ such that
A is said to be monotone if, for each x,y\in D(A), the following inequality holds:
Clearly, the class of monotone mappings includes the class of γinverse strongly monotone mappings.
Let C be a nonempty, closed and convex subset of E and A:C\to {E}^{\ast} be a monotone mapping. The problem of finding
is called the variational inequality problem. The set of solutions of the variational inequality is denoted by \mathit{VI}(C,A).
Variational inequality problems are related with the convex minimization problem, the zero of monotone mappings and the complementarity problem. Consequently, many researchers (see, e.g., [3, 5, 10–15]) have made efforts to obtain iterative methods for approximating solutions of variational inequality problems.
If E=H, a Hilbert space, Iiduka et al. [16] introduced the following projection algorithm:
where {P}_{C} is the metric projection from H onto C and \{{\alpha}_{n}\} is a sequence of positive real numbers. They proved that the sequence \{{x}_{n}\} generated by (1.6) converges weakly to some element of \mathit{VI}(C,A) provided that A is a γinverse strongly monotone mapping.
If E is a 2uniformly convex and uniformly smooth Banach space, and A is γinverse strongly monotone, Iiduka and Takahashi [17] introduced the following iteration scheme for finding a solution of the variational inequality problem:
where {\mathrm{\Pi}}_{C} is the generalized projection from E onto C, J is the normalized duality mapping from E into {E}^{\ast} and \{{\alpha}_{n}\} is a sequence of positive real numbers. They proved that the sequence \{{x}_{n}\} generated by (1.7) converges weakly to some element of \mathit{VI}(C,A).
It is worth mentioning that the convergence obtained above is weak convergence. Our concern now is to look for an iteration scheme which converges strongly to a solution of the variational inequality problem for a monotone mapping A.
In this regard, when E is a 2uniformly convex and uniformly smooth Banach space and A is a γinverse strongly monotone mapping satisfying \parallel Au\parallel \le \parallel AyAu\parallel for all y\in C and u\in \mathit{VI}(C,A) for \mathit{VI}(C,A)\ne \mathrm{\varnothing}, Iiduka and Takahashi [10] studied the following iterative scheme for a solution of the variational inequality problem:
where \{{\alpha}_{n}\} is a positive real sequence satisfying certain mild conditions and {\mathrm{\Pi}}_{{C}_{n}\cap {Q}_{n}} is the generalized projection from E onto {C}_{n}\cap {Q}_{n}, J is the duality mapping from E into {E}^{\ast}. Then they proved that the sequence \{{x}_{n}\} converges strongly to an element of \mathit{VI}(C,A).
Recently, Zegeye and Shahzad [18] studied the following iterative scheme for a common point of a solution of two variational inequality problems for continuous monotone mappings in a uniformly smooth and strictly convex real Banach space E which also enjoys the KadecKlee property:
where {T}_{i,\gamma}x:=\{z\in C:\u3008{A}_{i}z,yz\u3009+\frac{1}{\gamma}\u3008yz,JzJx\u3009\ge 0,\mathrm{\forall}y\in C\} for all x\in E, i=1,2, and \beta ,{\gamma}_{n}\in (0,1) satisfy certain mild conditions. Then they proved that the sequence \{{x}_{n}\} converges strongly to {\mathrm{\Pi}}_{F}({x}_{0}), where {\mathrm{\Pi}}_{F} is the generalized projection from E onto F:={\bigcap}_{i=1}^{2}\mathit{VI}(C,{A}_{i})\ne \mathrm{\varnothing}.
In 1967, Bregman [1] discovered an elegant and effective technique for using the socalled Bregman distance function {D}_{f}(\cdot ,\cdot ) in the process of designing and analyzing feasibility and optimization algorithms. Using Bregman’s distance function and its properties, authors have opened a growing area of research not only for iterative algorithms of solving feasibility and optimization problems but also for algorithms of solving nonlinear, equilibrium, variational inequality, fixed point problems and others (see, e.g., [19–25] and the references therein).
In 2010, Reich and Sabach [25] proposed an algorithm for finding a common zero point of a finite family of maximal monotone mappings {A}_{i}:E\to {2}^{{E}^{\ast}} (i=1,2,\dots ,N) in a general reflexive Banach space E as follows:
where {\{{\lambda}_{n}^{i}\}}_{i=1}^{N}\subset (0,\mathrm{\infty}), {\{{e}_{n}^{i}\}}_{i=1}^{N} are error sequences in E with {e}_{n}^{i}\to 0 and {P}_{C}^{f} is the Bregman projection with respect to f from E onto a closed and convex subset C of E. Those authors showed that the sequence \{{x}_{n}\} defined by (1.10) converges strongly to a common element in {\bigcap}_{i=1}^{N}{A}^{1}({0}^{\ast})={\bigcap}_{i=1}^{N}VI(E,{A}_{i}) under some mild conditions. Similar results are also available in [26, 27].
Remark 1.2 But it is worth mentioning that the iteration processes (1.8)(1.10) seem difficult in the sense that at each stage of iteration, the set(s) {C}_{n} and (or) {Q}_{n} is (are) computed and the next iterate is taken as the Bregman projection of {x}_{0} onto the intersection of {C}_{n} and {Q}_{n} (or {Q}_{n}). This seems difficult to do in applications.
It is our purpose in this paper to introduce an iterative scheme \{{x}_{n}\} which converges strongly to a common solution of a finite family of variational inequality problems for monotone mappings in real reflexive Banach spaces. Our scheme does not involve computations of {C}_{n} or {Q}_{n} for each n\ge 1. Furthermore, we apply our convergence theorem to a convex minimization problem. Our theorems extend and unify most of the results that have been proved for this important class of nonlinear operators.
2 Preliminaries
Let x\in int(domf). The subdifferential of f at x is the convex set defined by \partial f(x)=\{{x}^{\ast}\in {E}^{\ast}:f(x)+\u3008{x}^{\ast},yx\u3009\le f(y),\mathrm{\forall}y\in E\}, where the Fenchel conjugate of f is the function {f}^{\ast}:{E}^{\ast}\to (\mathrm{\infty},+\mathrm{\infty}] defined by {f}^{\ast}({x}^{\ast})=sup\{\u3008{x}^{\ast},x\u3009f(x):x\in E\}.
The function f is said to be:

(i)
Essentially smooth if ∂f is both locally bounded and singlevalued on its domain.

(ii)
Essentially strictly convex if {(\partial f)}^{1} is locally bounded on its domain and f is strictly convex on every convex subset of domf.

(iii)
Legendre if it is both essentially smooth and essentially strictly convex.
We remark that we have the following:

(i)
f is essentially smooth if and only if {f}^{\ast} is essentially strictly convex (see [19], Theorem 5.4).

(ii)
{(\partial f)}^{1}=\partial {f}^{\ast} (see [28]).

(iii)
f is Legendre if and only if {f}^{\ast} is Legendre (see [19], Corollary 5.5).

(iv)
If f is Legendre, then ∇f is a bijection satisfying \mathrm{\nabla}f={(\mathrm{\nabla}{f}^{\ast})}^{1}, ran\mathrm{\nabla}f=dom\mathrm{\nabla}{f}^{\ast}=int(dom{f}^{\ast}) and ran\mathrm{\nabla}{f}^{\ast}=dom\mathrm{\nabla}f=int(domf) (see [19], Theorem 5.10).
When the subdifferential of f is singlevalued, then \partial f=\mathrm{\nabla}f (see [29]).
A function f on E is coercive [30] if the sublevel set of f is bounded; equivalently, {lim}_{\parallel x\parallel \to \mathrm{\infty}}f(x)=\mathrm{\infty}.
Let f:E\to (\mathrm{\infty},+\mathrm{\infty}] be a convex and Gâteaux differentiable function. The modulus of total convexity of f at x∈ domf is the function {\nu}_{f}(x,\cdot ):[0,+\mathrm{\infty})\to [0,+\mathrm{\infty}] defined by
The function f is called totally convex at x if {\nu}_{f}(x,t)>0, whenever t>0. The function f is called totally convex if it is totally convex at any point x\in int(domf) and it is said to be totally convex on bounded sets if {\nu}_{f}(B,t)>0 for any nonempty bounded subset B of E and t>0, where the modulus of total convexity of the function f on the set B is the function {\nu}_{f}:int(domf)\times [0,+\mathrm{\infty})\to [0,+\mathrm{\infty}] defined by
We know that f is totally convex on bounded sets if and only if f is uniformly convex on bounded sets (see [22], Theorem 2.10). The following lemmas will be useful in the proof of our main result.
Lemma 2.1 [31]
The function f:E\to (\mathrm{\infty},+\mathrm{\infty}] is totally convex on bounded subsets of E if and only if for any two sequences \{{x}_{n}\} and \{{y}_{n}\} in int(domf) and domf, respectively, such that the first one is bounded,
Lemma 2.2 [22]
Let C be a nonempty, closed and convex subset of E. Let f:E\to (\mathrm{\infty},+\mathrm{\infty}] be a Gâteaux differentiable and totally convex function, and let x\in E. Then:

(i)
z={P}_{C}^{f}(x) if and only if \u3008\mathrm{\nabla}f(x)\mathrm{\nabla}f(z),yz\u3009\le 0, \mathrm{\forall}y\in C.

(ii)
{D}_{f}(y,{P}_{C}^{f}(x))+{D}_{f}({P}_{C}^{f}(x),x)\le {D}_{f}(y,x), \mathrm{\forall}y\in C.
Lemma 2.3 [29]
Let f:E\to (\mathrm{\infty},+\mathrm{\infty}] be a proper, lower semicontinuous and convex function, then {f}^{\ast}:{E}^{\ast}\to (\mathrm{\infty},+\mathrm{\infty}] is a proper, weak^{∗} lower semicontinuous and convex function. Thus, for all z\in E, we have
Lemma 2.4 [32]
Let f:E\to \mathbb{R} be Gâteaux differentiable on int(domf) such that \mathrm{\nabla}{f}^{\ast} is bounded on bounded subsets of dom{f}^{\ast}. Let {x}^{\ast}\in X and \{{x}_{n}\}\subset E. If \{{D}_{f}(x,{x}_{n})\} is bounded, so is the sequence \{{x}_{n}\}.
Let f:E\to \mathbb{R} be a Legendre and Gâteaux differentiable function. Following [2] and [33], we make use of the function {V}_{f}:E\times {E}^{\ast}\to [0,+\mathrm{\infty}) associated with f, which is defined by
Then {V}_{f} is nonnegative and
Moreover, by the subdifferential inequality,
\mathrm{\forall}x\in E and {x}^{\ast},{y}^{\ast}\in {E}^{\ast} (see [34]).
Lemma 2.5 [35]
Let \{{a}_{n}\} be a sequence of nonnegative real numbers satisfying the following relation:
where \{{\alpha}_{n}\}\subset (0,1) and \{{\delta}_{n}\}\subset \mathbb{R} satisfy the following conditions: {lim}_{n\to \mathrm{\infty}}{\alpha}_{n}=0, {\sum}_{n=1}^{\mathrm{\infty}}{\alpha}_{n}=\mathrm{\infty}, and {lim\hspace{0.17em}sup}_{n\to \mathrm{\infty}}{\delta}_{n}\le 0. Then {lim}_{n\to \mathrm{\infty}}{a}_{n}=0.
Lemma 2.6 [4]
Let \{{a}_{n}\} be a sequence of real numbers such that there exists a subsequence \{{n}_{i}\} of \{n\} such that {a}_{{n}_{i}}<{a}_{{n}_{i}+1} for all i\in \mathbb{N}. Then there exists an increasing sequence \{{m}_{k}\}\subset \mathbb{N} such that {m}_{k}\to \mathrm{\infty} and the following properties are satisfied by all (sufficiently large) numbers k\in \mathbb{N}:
In fact, {m}_{k} is the largest number n in the set \{1,2,\dots ,k\} such that the condition {a}_{n}\le {a}_{n+1} holds.
Following the agreement in [26], we have the following lemma.
Lemma 2.7 Let f:E\to (\mathrm{\infty},+\mathrm{\infty}] be a coercive Legendre function and C be a nonempty, closed and convex subset of E. Let A:C\to {E}^{\ast} be a continuous monotone mapping. For r>0 and x\in E, define the mapping {F}_{r}:E\to C as follows:
for all x\in E. Then the following hold:

(1)
{F}_{r} is singlevalued;

(2)
F({F}_{r})=\mathit{VI}(C,A);

(3)
\varphi (p,{F}_{r}x)+\varphi ({F}_{r}x,x)\le \varphi (p,x) for p\in F({F}_{r});

(4)
\mathit{VI}(C,A) is closed and convex.
3 Main result
Let C be a nonempty, closed and convex subset of E. Let {A}_{i}:C\to {E}^{\ast}, for i=1,2,\dots ,N, be continuous monotone mappings. For r>0, define {T}_{i,r}x:=\{z\in C:\u3008{A}_{i}z,yz\u3009+\frac{1}{r}\u3008\mathrm{\nabla}f(z)\mathrm{\nabla}f(x),yz\u3009\ge 0,\mathrm{\forall}y\in C\} for all x\in E and i\in \{1,2,\dots ,N\}, where f is a Legendre and convex function from E into (\mathrm{\infty},+\mathrm{\infty}). Then, in what follows, we shall study the following iteration process:
where \{{\alpha}_{n}\}\subset (0,1) satisfies {lim}_{n\to \mathrm{\infty}}{\alpha}_{n}=0 and {\sum}_{n=1}^{\mathrm{\infty}}=\mathrm{\infty}, and \{{r}_{n}\}\subset [{c}_{1},\mathrm{\infty}) for some {c}_{1}>0.
Theorem 3.1 Let f:E\to \mathbb{R} be a strongly coercive Legendre function which is bounded, uniformly Fréchet differentiable and totally convex on bounded subsets of E. Let C be a nonempty, closed and convex subset of int(domf) and {A}_{i}:C\to {E}^{\ast}, for i=1,2,\dots ,N, be a finite family of continuous monotone mappings with \mathcal{F}:={\bigcap}_{i=1}^{N}\mathit{VI}(C,{A}_{i})\ne \mathrm{\varnothing}. Let {\{{x}_{n}\}}_{n\ge 0} be a sequence defined by (3.1). Then \{{x}_{n}\} converges strongly to {x}^{\ast}={P}_{\mathcal{F}}^{f}(u).
Proof By Lemma 2.7 we have that each \mathit{VI}(C,{A}_{i}) for each i\in \{1,2,\dots ,N\} and hence ℱ are closed and convex. Thus, we can take {x}^{\ast}:={P}_{\mathcal{F}}^{f}u. Let {u}_{n,1}={T}_{1,{r}_{n}}{x}_{n},{u}_{n,2}={T}_{2,{r}_{n}}{u}_{n,1},\dots ,{u}_{n,N1}={T}_{N1,{r}_{n}}{u}_{n,N2} and {u}_{n,N}={T}_{N,{r}_{n}}{u}_{n,N1}={w}_{n}. Then, from (3.1), Lemmas 2.2, 2.3 and the property of ϕ, we get that
Thus, by induction,
which implies by Lemma 2.4 that \{{x}_{n}\} and hence \{{w}_{n}\} are bounded. Now let {z}_{n}=\mathrm{\nabla}{f}^{\ast}({\alpha}_{n}\mathrm{\nabla}f(u)+(1{\alpha}_{n})\mathrm{\nabla}f({w}_{n})). Then we have from (3.1) that {x}_{n+1}={P}_{C}^{f}{z}_{n}. Using Lemmas 2.2, 2.3, 2.7(3), (2.3) and (2.4), we obtain that
which implies that
Now, we consider two possible cases.
Case 1. Suppose that there exists {n}_{0}\in N such that \{{D}_{f}({x}^{\ast},{x}_{n})\} is decreasing. Then we obtain that \{{D}_{f}({x}^{\ast},{x}_{n})\} is convergent. Thus, from (3.3) we have that {D}_{f}({u}_{n,1},{x}_{n}),{D}_{f}({u}_{n,2},{u}_{n,1}),\dots ,{D}_{f}({w}_{n},{u}_{n,N1})\to 0 as n\to \mathrm{\infty}, and hence by Lemma 2.1 we get that
Furthermore, from the property of {D}_{f}(\cdot ,\cdot ) and the fact that {\alpha}_{n}\to 0 as n\to \mathrm{\infty}, we have that
and hence from Lemma 2.1 we have that {w}_{n}{z}_{n}\to 0 and this with (3.4) implies that
Since \{{z}_{n}\} is bounded and E is reflexive, we choose a subsequence \{{z}_{{n}_{k}}\} of \{{z}_{n}\} such that {z}_{{n}_{k}}\rightharpoonup z and {lim\hspace{0.17em}sup}_{n\to \mathrm{\infty}}\u3008\mathrm{\nabla}f(u)\mathrm{\nabla}f({x}^{\ast}),{z}_{n}{x}^{\ast}\u3009={lim}_{k\to \mathrm{\infty}}\u3008\mathrm{\nabla}f(u)\mathrm{\nabla}f({x}^{\ast}),{z}_{{n}_{k}}{x}^{\ast}\u3009. Then, from (3.5) and (3.4), we get that {u}_{{n}_{k},i}\rightharpoonup z for each i\in \{1,2,\dots ,N\}.
Now, we show that z\in \mathit{VI}(C,{A}_{i}) for each i\in \{1,2,\dots ,N\}. But from the definition of {u}_{n,i}, we have that
and hence
for each i\in \{1,2,\dots ,N\}. Set {v}_{t}=ty+(1t)z for all t\in (0,1] and y\in C. Consequently, we get that {v}_{t}\in C. Now, from (3.6) it follows that
In addition, since f is uniformly Fréchet differentiable and bounded, we have that ∇f is uniformly continuous (see [36]). Thus, from (3.4) and the uniform continuity of ∇f, we obtain that
and since A is monotone, we also have that \u3008{A}_{i}{v}_{t}{A}_{i}{u}_{{n}_{k},i},{v}_{t}{u}_{{n}_{k},i}\u3009\ge 0. Thus, it follows that
and hence
If t\to 0, the continuity of {A}_{i} implies that
This implies that z\in \mathit{VI}(C,{A}_{i}) for all i\in \{1,2,\dots ,N\}.
Therefore, we obtain that z\in {\bigcap}_{i=1}^{N}\mathit{VI}(C,{A}_{i}). Thus, by Lemma 2.2, we immediately obtain that {lim\hspace{0.17em}sup}_{n\to \mathrm{\infty}}\u3008\mathrm{\nabla}f(u)\mathrm{\nabla}f({x}^{\ast}),{z}_{n}{x}^{\ast}\u3009=\u3008\mathrm{\nabla}f(u)\mathrm{\nabla}f({x}^{\ast}),z{x}^{\ast}\u3009\le 0. It follows from Lemma 2.5 and (3.3) that {D}_{f}({x}^{\ast},{x}_{n})\to 0 as n\to \mathrm{\infty}. Consequently, {x}_{n}\to {x}^{\ast}.
Case 2. Suppose that there exists a subsequence \{{n}_{j}\} of \{n\} such that
for all j\in \mathbb{N}. Then, by Lemma 2.6, there exists a nondecreasing sequence \{{m}_{k}\}\subset \mathbb{N} such that {m}_{k}\to \mathrm{\infty}, {D}_{f}({x}^{\ast},{x}_{{m}_{k}})\le {D}_{f}({x}^{\ast},{x}_{{m}_{k}+1}) and {D}_{f}({x}^{\ast},{x}_{k})\le {D}_{f}({x}^{\ast},{x}_{{m}_{k}+1}) for all k\in \mathbb{N}. From (3.3) and {\alpha}_{n}\to 0, we have
which implies that {D}_{f}({u}_{{m}_{k},1},{x}_{{m}_{k}}),\dots ,{D}_{f}({w}_{{m}_{k}},{u}_{{m}_{k},N1})\to 0, and hence {u}_{{m}_{k},1}{x}_{{m}_{k}}\to 0,\dots ,{w}_{{m}_{k}}{u}_{{m}_{k},N1}\to 0 as k\to \mathrm{\infty}. Thus, as in Case 1, we obtain that
Furthermore, from (3.3) we have that
Thus, since {D}_{f}({x}^{\ast},{x}_{{m}_{k}})\le {D}_{f}({x}^{\ast},{x}_{{m}_{k}+1}), we get that
Moreover, since {\alpha}_{{m}_{k}}>0, we obtain that
It follows from (3.7) that {D}_{f}({x}^{\ast},{x}_{{m}_{k}})\to 0 as k\to \mathrm{\infty}. This together with (3.8) implies that {D}_{f}({x}^{\ast},{x}_{{m}_{k}+1})\to 0. Therefore, since {D}_{f}({x}^{\ast},{x}_{k})\le {D}_{f}({x}^{\ast},{x}_{{m}_{k}+1}) for all k\in \mathbb{N}, we conclude that {x}_{k}\to {x}^{\ast} as k\to \mathrm{\infty}. Hence, both cases imply that \{{x}_{n}\} converges strongly to {x}^{\ast}={P}_{F}^{f}u and the proof is complete. □
If in Theorem 3.1 N=1, then we get the following corollary.
Corollary 3.2 Let f:E\to \mathbb{R} be a strongly coercive Legendre function which is bounded, uniformly Fréchet differentiable and totally convex on bounded subsets of E. Let C be a nonempty, closed and convex subset of int(domf), and let A:C\to {E}^{\ast} be a continuous monotone mapping with \mathit{VI}(C,A)\ne \mathrm{\varnothing}. Let {\{{x}_{n}\}}_{n\ge 0} be a sequence defined by (3.1),
where {T}_{\gamma}x:=\{z\in C:\u3008Az,yz\u3009+\frac{1}{\gamma}\u3008\mathrm{\nabla}f(z)\mathrm{\nabla}f(x),yz\u3009\ge 0,\mathrm{\forall}y\in C\} for all x\in E; {\alpha}_{n}\in (0,1) satisfies {lim}_{n\to \mathrm{\infty}}{\alpha}_{n}=0 and {\sum}_{n=1}^{\mathrm{\infty}}{\alpha}_{n}=\mathrm{\infty} and \{{r}_{n}\}\subset [{c}_{1},\mathrm{\infty}) for some {c}_{1}>0. Then the sequence {\{{x}_{n}\}}_{n\ge 0} converges strongly to a point {x}^{\ast}={P}_{\mathit{VI}(C,A)}(u).
If C=E, then \mathit{VI}(C,A)={A}^{1}(0) and hence the following corollary holds.
Corollary 3.3 Let f:E\to \mathbb{R} be a strongly coercive Legendre function which is bounded, uniformly Fréchet differentiable and totally convex on bounded subsets of E. Let {A}_{i}:E\to {E}^{\ast}, for i=1,2,\dots ,N, be a finite family of continuous monotone mappings. Let \mathcal{F}:={\bigcap}_{i=1}^{N}\mathit{VI}(C,{A}_{i})={\bigcap}_{i=1}^{N}{A}^{1}(0)\ne \mathrm{\varnothing}. Let {\{{x}_{n}\}}_{n\ge 0} be a sequence defined by (3.1). Then \{{x}_{n}\} converges strongly to {x}^{\ast}={P}_{\mathcal{F}}^{f}(u).
If in Theorem 3.1 we assume u=0, then the scheme converges strongly to the common minimumnorm zero of a finite family of continuous monotone mappings. In fact, we have the following corollary.
Corollary 3.4 Let f:E\to \mathbb{R} be a strongly coercive Legendre function which is bounded, uniformly Fréchet differentiable and totally convex on bounded subsets of E. Let C be a nonempty, closed and convex subset of int(domf), and let {A}_{i}:C\to {E}^{\ast}, for i=1,2,\dots ,N, be a finite family of continuous monotone mappings with \mathcal{F}:={\bigcap}_{i=1}^{N}\mathit{VI}(C,{A}_{i})\ne \mathrm{\varnothing}. Let {\{{x}_{n}\}}_{n\ge 0} be a sequence defined by (3.1) with u=0. Then \{{x}_{n}\} converges strongly to {x}^{\ast}={P}_{\mathcal{F}}^{f}(0), which is the common minimumnorm (with respect to the Bregman distance) solution of the variational inequalities.
4 Application
In this section, we study the problem of finding a minimizer of a continuously Fréchet differentiable convex functional in Banach spaces.
Let {g}_{i}, for i=1,2,\dots ,N, be continuously Fréchet differentiable convex functionals such that the gradients of {g}_{i}, (\mathrm{\nabla}{g}_{i}){}_{C} are continuous and monotone. For r>0, let {K}_{i,r}x:=\{z\in C:\u3008\mathrm{\nabla}{g}_{i}(z),yz\u3009+\frac{1}{r}\u3008\mathrm{\nabla}f(z)\mathrm{\nabla}f(x),yz\u3009\ge 0,\mathrm{\forall}y\in C\} for all x\in E and for each i\in \{1,2,\dots ,N\}. Then the following theorem holds.
Theorem 4.1 Let f:E\to \mathbb{R} be a strongly coercive Legendre function which is bounded, uniformly Fréchet differentiable and totally convex on bounded subsets of E. Let {g}_{i}, i=1,2,\dots ,N, be continuously Fréchet differentiable convex functionals such that the gradients of {g}_{i}, (\mathrm{\nabla}{g}_{i}){}_{C} are continuous, monotone and \mathcal{F}:={\bigcap}_{i=1}^{N}arg{min}_{y\in C}{g}_{i}(y)\ne \mathrm{\varnothing}, where arg{min}_{y\in C}{g}_{i}(y):=\{z\in C:{g}_{i}(z)={min}_{y\in C}{g}_{i}(y)\}. Let {\{{x}_{n}\}}_{n\ge 0} be a sequence defined by
where {\alpha}_{n}\in (0,1) satisfies {lim}_{n\to \mathrm{\infty}}{\alpha}_{n}=0 and {\sum}_{n=1}^{\mathrm{\infty}}{\alpha}_{n}=\mathrm{\infty} and \{{r}_{n}\}\subset [{c}_{1},\mathrm{\infty}) for some {c}_{1}>0. Then the sequence \{{x}_{n}\} converges strongly to p={P}_{\mathcal{F}}^{f}(u).
Proof We note that from the convexity and Fréchet differentiability of f, we have \mathit{VI}(C,(\mathrm{\nabla}{g}_{i}){}_{C})=arg{min}_{y\in C}{g}_{i}(y) for each i\in \{1,2,\dots ,N\}. Thus, by Theorem 3.1, \{{x}_{n}\} converges strongly to p={P}_{\mathcal{F}}^{f}(u). □
Remark 4.2 Our results are new even if the convex function f is chosen to be f(x)=\frac{1}{p}{\parallel x\parallel}^{p} (1<p<\mathrm{\infty}) in uniformly smooth and uniformly convex spaces.
Remark 4.3 Our theorems extend and unify most of the results that have been proved for this important class of nonlinear operators. In particular, Theorem 3.1 extends Theorem 3.3 of [16], Theorem 3.1 of [17], Theorem 3.1 of [17] and Theorem 3.3 of [10] and Theorem 4.2 of [25] either to a more general class of continuous monotone operators or to a more general Banach space E. Moreover, in all our theorems and corollaries, the computation of {C}_{n} or {Q}_{n} for each n\ge 1 is not required.
References
Bregman LM: The relaxation method for finding the common point of convex sets and its application to the solution of problems in convex programming. USSR Comput. Math. Math. Phys. 1967, 7: 200–217.
Alber YI: Metric and generalized projection operators in Banach spaces: properties and applications. Lect. Notes Pure Appl. Math. Theory and Applications of Nonlinear Operators of Accretive and Monotone Type 1996, 15–50.
Kamimura S, Takahashi W: Strong convergence of proximaltype algorithm in a Banach space. SIAM J. Optim. 2002, 13: 938–945. 10.1137/S105262340139611X
Maingé PE: Strong convergence of projected subgradient methods for nonsmooth and nonstrictly convex minimization. SetValued Anal. 2008, 16: 899–912. 10.1007/s112280080102z
Zegeye H, Ofoedu EU, Shahzad N: Convergence theorems for equilibrium problem, variational inequality problem and countably infinite relatively quasinonexpansive mappings. Appl. Math. Comput. 2010, 216: 3439–3449. 10.1016/j.amc.2010.02.054
Zegeye H, Shahzad N: Strong convergence theorems for a finite family of nonexpansive mappings and semigroups via the hybrid method. Nonlinear Anal. 2010, 72: 325–329. 10.1016/j.na.2009.06.056
Zegeye H, Shahzad N: A hybrid approximation method for equilibrium, variational inequality and fixed point problems. Nonlinear Anal. Hybrid Syst. 2010, 4: 619–630. 10.1016/j.nahs.2010.03.005
Zegeye H, Shahzad N: A hybrid scheme for finite families of equilibrium, variational inequality and fixed point problems. Nonlinear Anal. 2011, 74: 263–272. 10.1016/j.na.2010.08.040
Zegeye H, Shahzad N: Convergence theorems for a common point of solutions of equilibrium and fixed point of relatively nonexpansive multivalued mapping problems. Abstr. Appl. Anal. 2012., 2012: Article ID 859598
Iiduka H, Takahashi W: Strong convergence studied by a hybrid type method for monotone operators in a Banach space. Nonlinear Anal. 2008, 68: 3679–3688. 10.1016/j.na.2007.04.010
Kinderlehrer D, Stampaccia G: An Iteration to Variational Inequalities and Their Applications. Academic Press, New York; 1990.
Lions JL, Stampacchia G: Variational inequalities. Commun. Pure Appl. Math. 1967, 20: 493–517. 10.1002/cpa.3160200302
Zegeye H, Shahzad N: Strong convergence for monotone mappings and relatively weak nonexpansive mappings. Nonlinear Anal. 2009, 70: 2707–2716. 10.1016/j.na.2008.03.058
Zegeye H, Shahzad N, Alghamdi MA: Strong convergence theorems for a common point of solution of variational inequality, solutions of equilibrium and fixed point problems. Fixed Point Theory Appl. 2012., 2012: Article ID 119
Zegeye H, Shahzad N: An iteration to a common point of solution of variational inequality and fixed pointproblems in Banach spaces. J. Appl. Math. 2012., 2012: Article ID 504503
Iiduka H, Takahashi W, Toyoda M: Approximation of solutions of variational inequalities for monotone mappings. Panam. Math. J. 2004, 14: 49–61.
Iiduka H, Takahashi W: Weak convergence of projection algorithm for variational inequalities in Banach spaces. J. Math. Anal. Appl. 2008, 339: 668–679. 10.1016/j.jmaa.2007.07.019
Zegeye H, Shahzad N: Approximating common solution of variational inequality problems for two monotone mappings in Banach spaces. Optim. Lett. 2011, 5: 691–704. 10.1007/s1159001002355
Bauschke HH, Borwein JM, Combettes PL: Essential smoothness, essential strict convexity, and Legendre functions in Banach spaces. Commun. Contemp. Math. 2001, 3: 615–647. 10.1142/S0219199701000524
Bauschke HH, Borwein JM, Combettes PL: Bregman monotone optimization algorithms. SIAM J. Control Optim. 2003, 42: 596–636. 10.1137/S0363012902407120
Butnariu D, Iusem AN, Zalinescu C: On uniform convexity, total convexity and convergence of the proximal point and outer Bregman projection algorithms in Banach spaces. J. Convex Anal. 2003, 10: 35–61.
Butnariu D, Resmerita E: Bregman distances, totally convex functions and a method for solving operator equations in Banach spaces. Abstr. Appl. Anal. 2006., 2006: Article ID 84919
Reich S: A weak convergence theorem for the alternating method with Bregman distances. In Theory and Applications of Nonlinear Operators of Accretive and Monotone Type. Dekker, New York; 1996:313–318.
Reich S, Sabach S: A projection method for solving nonlinear problems in reflexive Banach spaces. J. Fixed Point Theory Appl. 2011, 9: 101–116. 10.1007/s1178401000375
Reich S, Sabach S: Two strong convergence theorems for a proximal method in reflexive Banach spaces. Numer. Funct. Anal. Optim. 2010, 31: 22–44. 10.1080/01630560903499852
Reich S, Sabach S: Two strong convergence theorems for Bregman strongly nonexpansive operators in reflexive Banach spaces. Nonlinear Anal. TMA 2010, 73: 122–135. 10.1016/j.na.2010.03.005
Reich S, Sabach S: Existence and approximation of fixed points of Bregman firmly nonexpansive mappings in reflexive Banach spaces. In FixedPoint Algorithms for Inverse Problems in Science and Engineering. Springer, New York; 2011:301–316.
Bonnans JF, Shapiro A: Perturbation Analysis of Optimization Problems. Springer, New York; 2000.
Phelps RP Lecture Notes in Mathematics 1364. In Convex Functions, Monotone Operators, and Differentiability. 2nd edition. Springer, Berlin; 1993.
HiriartUrruty JB, Lemarchal C Grundlehren der Mathematischen Wissenschaften 306. In Convex Analysis and Minimization Algorithms II. Springer, Berlin; 1993.
Butnariu D, Iusem AN: Totally Convex Functions for Fixed Points Computation and Infinite Dimensional Optimization. Kluwer Academic, Dordrecht; 2000.
MartinMarquez V, Reich S, Sabach S: Bregman strongly nonexpansive operators in reflexive Banach spaces. J. Math. Anal. Appl. 2013, 400: 597–614. 10.1016/j.jmaa.2012.11.059
Censor Y, Lent A: An iterative rowaction method for interval convex programming. J. Optim. Theory Appl. 1981, 34: 321–353. 10.1007/BF00934676
Kohsaka F, Takahashi W: Proximal point algorithms with Bregman functions in Banach spaces. J. Nonlinear Convex Anal. 2005, 6: 505–523.
Xu HK: Another control condition in an iterative method for nonexpansive mappings. Bull. Aust. Math. Soc. 2002, 65: 109–113. 10.1017/S0004972700020116
Reich S, Sabach S: A strong convergence theorem for a proximaltype algorithm in reflexive Banach spaces. J. Nonlinear Convex Anal. 2009, 10: 471–485.
Acknowledgements
This article was funded by the Deanship of Scientific Research (DSR), King Abdulaziz University, Jeddah. The first and third authors acknowledge with thanks DSR for financial support. The second author undertook this work when he was visiting the Abdus Salam International Center for Theoretical Physics (ICTP), Trieste, Italy, as a regular associate.
Author information
Affiliations
Corresponding author
Additional information
Competing interests
The authors declare that they have no competing interests.
Authors’ contributions
All authors contributed equally to this work. All authors read and approved final manuscript.
Rights and permissions
Open Access This article is distributed under the terms of the Creative Commons Attribution 2.0 International License (https://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
About this article
Cite this article
Shahzad, N., Zegeye, H. & Alotaibi, A. Convergence results for a common solution of a finite family of variational inequality problems for monotone mappings with Bregman distance function. Fixed Point Theory Appl 2013, 343 (2013). https://doi.org/10.1186/168718122013343
Received:
Accepted:
Published:
DOI: https://doi.org/10.1186/168718122013343
Keywords
 Bregman projection
 monotone mappings
 strong convergence
 variational inequality problems