Hybrid methods for a class of monotone variational inequalities

https://doi.org/10.1016/j.na.2008.11.067Get rights and content

Abstract

We use contractions to regularize a class of monotone variational inequalities, where the monotone operators are complements of nonexpansive mappings and the solutions are sought in the set of fixed points of another nonexpansive mapping. Such variational inequalities include monotone inclusions and convex optimization problems to be solved over the fixed point sets of nonexpansive mappings. Both implicit and explicit schemes are shown to be strongly convergent. An application in hierarchical minimization is included.

Introduction

Let H be a Hilbert space, C a nonempty closed convex subset of H, and F:CH a nonlinear mapping. A variational inequality problem, denoted VI(F,C), is to find a point x with the property xCsuch thatFx,xx0,xC. We say that VI(F,C) is monotone if the mapping F is a monotone operator. In this paper we are concerned with a special class of variational inequalities in which the mapping F is the complement of a nonexpansive mapping and the constraint set is the set of fixed points of another nonexpansive mapping. Namely, we consider the following type of monotone variational inequality problem Find xFix(T) such that (IV)x,xx0,xFix(T), where T,V:CC are nonexpansive mappings. It is always assumed that the set of fixed points of T, Fix(T)={xC:Tx=x}, is not empty.

It is well-known that the VIP (1.1) is equivalent to the fixed point equation x=PC(IγF)x where γ>0 and PC is the metric projection of H onto C.

It is also well-known that if F is Lipschitzian and strongly monotone, then for small enough γ>0, the mapping PC(IγF) is a contraction on C and so the sequence {xn} of Picard iterates, given by xn=PC(IγF)xn1 (n1), converges strongly to the unique solution of the VIP (1.1).

Hybrid methods for solving the variational inequality (1.1) were studied by Yamada [1] where he assumed that F is Lipschitzian and strongly monotone. However, his methods do not apply to the variational inequality (1.2) since the mapping IV fails, in general, to be strongly monotone, though it is Lipschitzian. Therefore, other hybrid methods have to be sought.

Recently, Mainge and Moudafi [2] introduced a hybrid iterative method for solving the variational inequality (1.2), which generates a sequence (xn) as follows: xn+1=λnf(xn)+(1λn)[αnVxn+(1λn)Txn], where the initial guess x0C, f:CC is a contraction, and (λn) and (αn) are sequences in [0,1] satisfying certain conditions.

It is the purpose of this paper to further investigate other hybrid iterative methods for solving the variational inequality (1.2). More precisely, assuming (1.2) is consistent and noticing the fact that if, for each t(0,1), xtC is a fixed point of the nonexpansive mapping tV+(1t)T, then every weak accumulation point of (xt) as t0 is a solution of (1.2), we are able, upon the idea of regularization, to introduce a new hybrid iterative method as follows: zn+1=λn[αnf(zn)+(1αn)Vzn]+(1λn)Tzn, where {λn} and {αn} are sequences in (0, 1), and f:CC is a contraction. Our idea is to regularize the nonexpansive mapping V, instead of the nonexpansive mapping WttV+(1t)T as done by Moudafi and Mainge [3]. Since Moudafi and Mainge’s regularization depends upon t whereas ours not, we obtain our convergence result for the regularization under dramatically less restrictive conditions; as a matter of fact, the conditions (A1) and (A3) of Moudafi and Mainge [3] are completely removed.

We also apply both of our implicit and explicit schemes to solve a hierarchical minimization problem in a Hilbert space.

Section snippets

Preliminaries

Let C be a nonempty closed convex subset of a real Hilbert space H. Recall the following concepts of mappings.

  • (i)

    A mapping f:CC is a ρ-contraction if ρ[0,1) and if the following property is satisfied: f(x)f(x)ρxx,x,xC.

  • (ii)

    A mapping T:CC is nonexpansive provided TxTxxx,x,xC.

  • (iii)

    A mapping F:CH is

    • (a)

      monotone if FxFy,xy0,x,yC;

    • (b)

      strictly monotone if FxFy,xy>0,x,yC,xy;

    • (c)

      η-strongly monotone if there exists a constant η>0 such that FxFy,xyηxy2,x,yC.

The metric (or nearest

Implicit hybrid method

Suppose F:CH is an L-Lipschitzian and η-strongly monotone operator with L>0,η>0. Suppose T:CC is nonexpansive with Fix(T). Consider the variational inequality xFix(T),Fx,xx0,xFix(T).

Yamada [1] introduced the following hybrid iterative method for solving the variational inequality (3.1), which generates a sequence (xn) via the iterative algorithm: xn+1=TxnλnF(Txn),n0, where the initial guess x0C is arbitrary and where the sequence {λn} in (0, 1) satisfies the conditions: λn0,n=

Explicit hybrid method

Our variational inequality (3.3) involves two nonexpansive mappings T and V. Our explicit hybrid method is motivated by our implicit hybrid method investigated in the last section and the recent investigation on iterative methods for nonexpansive mappings (see more details in [9], [10], [11], [12], [7], [13], [14], [15], [16], [6], [17], [18], [19], [4]).

Our explicit iterative scheme generates a sequence (zn) from an arbitrary initial guess z0C and via the recursive formula: zn+1=λnVnzn+(1λn)T

Application in hierarchical minimization

Let H be a Hilbert space H and let φ0,φ1:HR(,] be proper lower semicontinuous convex functions. Consider the following hierarchical minimization minxHφ0(x),minxS0φ1(x), where S0argminxHφ0(x). (Here we always assume that S0 is nonempty.) Let S=argminxS0φ1(x) and assume S. Assume φ0 and φ1 are differentiable and their gradients are Lipschitz continuous: φ0(x)φ0(y)L0xy,φ1(x)φ1(y)L1xy. Let T=Iγ0φ0,V=Iγ1φ1. where γ0>0 and γ1>0.

It is easily seen that S0=Fix(T). It

Acknowledgement

The second author was supported in part by NSC 97-2628-M-110-003-MY3 (Taiwan).

References (22)

  • F.E. Browder

    Convergence of approximation to fixed points of nonexpansive nonlinear mappings in Hilbert spaces

    Arch. Ration. Mech. Anal.

    (1967)
  • Cited by (57)

    View all citing articles on Scopus
    View full text