variational-like inequality problems involving set-valued maps and generalized monotonicity

21
J Optim Theory Appl (2012) 155:79–99 DOI 10.1007/s10957-012-0047-0 Variational-Like Inequality Problems Involving Set-Valued Maps and Generalized Monotonicity Nicu¸ sor Costea · Daniel Alexandru Ion · Cezar Lupu Received: 23 September 2011 / Accepted: 17 March 2012 / Published online: 13 April 2012 © Springer Science+Business Media, LLC 2012 Abstract The aim of this paper is to establish existence results for some variational- like inequality problems involving set-valued maps, in reflexive and nonreflexive Ba- nach spaces. When the set K, in which we seek solutions, is compact and convex, we no dot impose any monotonicity assumptions on the set-valued map A, which appears in the formulation of the inequality problems. In the case when K is only bounded, closed, and convex, certain monotonicity assumptions are needed: We ask A to be relaxed η-α monotone for generalized variational-like inequalities and relaxed η-α quasimonotone for variational-like inequalities. We also provide sufficient conditions for the existence of solutions in the case when K is unbounded, closed, and convex. Keywords Variational-like inequalities · Generalized variational-like inequalities · Set-valued maps · Generalized monotonicity · Lower and upper semicontinuity Communicated by Qamrul Hasan Ansari. N. Costea ( ) Institute of Mathematics “Simion Stoilow” of the Romanian Academy, 014700 Bucharest, Romania e-mail: [email protected] N. Costea Department of Mathematics and Its Applications, Central European University, Nador u. 9, 1051 Budapest, Hungary D.A. Ion · C. Lupu Department of Mathematics, University of Craiova, Al. I. Cuza Str. 13, 200585 Craiova, Romania D.A. Ion e-mail: [email protected] C. Lupu Department of Mathematics, Politehnica University of Bucharest, Str. Splaiul Independen¸ tei 313, 060042 Bucharest, Romania e-mail: [email protected]

Upload: independent

Post on 01-May-2023

1 views

Category:

Documents


0 download

TRANSCRIPT

J Optim Theory Appl (2012) 155:79–99DOI 10.1007/s10957-012-0047-0

Variational-Like Inequality Problems InvolvingSet-Valued Maps and Generalized Monotonicity

Nicusor Costea · Daniel Alexandru Ion ·Cezar Lupu

Received: 23 September 2011 / Accepted: 17 March 2012 / Published online: 13 April 2012© Springer Science+Business Media, LLC 2012

Abstract The aim of this paper is to establish existence results for some variational-like inequality problems involving set-valued maps, in reflexive and nonreflexive Ba-nach spaces. When the set K , in which we seek solutions, is compact and convex, weno dot impose any monotonicity assumptions on the set-valued map A, which appearsin the formulation of the inequality problems. In the case when K is only bounded,closed, and convex, certain monotonicity assumptions are needed: We ask A to berelaxed η-α monotone for generalized variational-like inequalities and relaxed η-αquasimonotone for variational-like inequalities. We also provide sufficient conditionsfor the existence of solutions in the case when K is unbounded, closed, and convex.

Keywords Variational-like inequalities · Generalized variational-like inequalities ·Set-valued maps · Generalized monotonicity · Lower and upper semicontinuity

Communicated by Qamrul Hasan Ansari.

N. Costea (�)Institute of Mathematics “Simion Stoilow” of the Romanian Academy, 014700 Bucharest, Romaniae-mail: [email protected]

N. CosteaDepartment of Mathematics and Its Applications, Central European University, Nador u. 9,1051 Budapest, Hungary

D.A. Ion · C. LupuDepartment of Mathematics, University of Craiova, Al. I. Cuza Str. 13, 200585 Craiova, Romania

D.A. Ione-mail: [email protected]

C. LupuDepartment of Mathematics, Politehnica University of Bucharest, Str. Splaiul Independentei 313,060042 Bucharest, Romaniae-mail: [email protected]

80 J Optim Theory Appl (2012) 155:79–99

1 Introduction

In 1989, J. Parida, M. Sahoo, and S. Kumar [1] introduced a new type of inequalityproblem of variational type, called variational-like inequality problem and showedthat this kind of inequalities can be related to some mathematical programming prob-lems. In the recent years, various extensions of the original variational-like inequalityproblem have been proposed and analyzed by many authors (see, e.g., R. Ahmad andS.S. Irfan [2], M.-R. Bai et al. [3], N. Costea and V. Radulescu [4], N.H. Dien [5],Y.P. Fang and N.J. Huang [6], A.H. Siddiqi, A. Khaiq, and Q.H. Ansari [7]), whoshowed that variational-like inequality problems can be successfully applied in op-erations research, optimization, mathematical programming, and contact mechanics.For various iterative schemes and algorithms for finding approximate solutions forvariational-like inequalities, as well as convergence results, we refer to Q.H. Ansariand J.-C. Yao [8] and C.-H. Lee, Q.H. Ansari, and J.-C. Yao [9].

In this paper, we study two variational-like inequality problems involving set-valued maps, which are either lower semicontinuous, or upper semicontinuous. Usinga fixed-point theorem for set valued maps due to Q.H. Ansari and J.-C. Yao, Mosco’salternative and the KKM principle, we establish several existence results concern-ing the solutions of these inequality problems, in reflexive and nonreflexive Banachspaces.

The rest of the paper is structured as follows. Section 2 describes the studied prob-lems and some preliminary results. In Sect. 3 we establish some existence results forour inequality problems; Sect. 3.1 provides existence results for the case of nonreflex-ive Banach spaces, while in Sect. 3.2 the case of reflexive Banach spaces is analyzed.Section 4 provides some concluding remarks.

2 The Studied Problems and Preliminary Results

The inequality studied by J. Parida, M. Sahoo, and S. Kumar [1] had the form:

• Find u ∈ K such that⟨A(u), η(v,u)

⟩ ≥ 0, for all v ∈ K,

where K ⊆ Rn is a nonempty, closed, and convex set and A : K → R

n,η : K × K → R

n are two continuous maps.The goal of this paper is to extend the results obtained in [1] to the following

setting: X is a Banach space (not necessarily reflexive) with X∗ and X∗∗ = (X∗)∗ itsdual and bidual, respectively; K is a nonempty closed and convex subset of X∗∗ andA : K ⇒ X∗ is a set-valued map. We denote by 〈·, ·〉 the duality pairing between aBanach space and its dual; if u ∈ X, f ∈ X∗ and ξ ∈ X∗∗, by 〈f,u〉 we understandf (u), while by 〈f, ξ 〉 we understand ξ(f ). More exactly, we are interested in findingsolutions for the following inequality problems:

• Find u ∈ K ∩ D(φ) such that

∃u∗ ∈ A(u): ⟨u∗, η(v,u)

⟩ + φ(v) − φ(u) ≥ 0, for all v ∈ K, (1)

and

J Optim Theory Appl (2012) 155:79–99 81

• Find u ∈ K such that

∃u∗ ∈ A(u): ⟨u∗, η(v,u)

⟩ ≥ 0, for all v ∈ K, (2)

where K ⊆ X∗∗ is nonempty, closed, and convex, η : K × K → X∗∗, A : K ⇒ X∗ isa set-valued map and φ : X∗∗ → R∪{+∞} is a proper convex and lower semicontin-uous functional such that Kφ := K ∩ D(φ) = ∅. Here, D(φ) stands for the effectivedomain of the functional φ, i.e., D(φ) = {u ∈ X∗∗ : φ(u) < +∞}. If φ is the indicatorfunction of the set K , i.e.,

φ(u) ={

0, u ∈ K,

+∞, u ∈ K,

then problem (1) reduces to inequality problem (2). Moreover, if A is a single-valuedoperator, then (1) becomes a generalized variational-like inequality which was intro-duced by N.H. Dien [5]. If A is a single-valued operator and η(v,u) = v − u, theninequality problem (2) becomes a variational inequality whose study began in the1960s (see G. Fichera [10], F.E. Browder [11], P. Hartman and G. Stampacchia [12],and J.L. Lions and G. Stampacchia [13]). For more information and connections re-garding such types of inequality problems, we refer to F. Giannessi, A. Maugeri, andP.M. Pardalos [14].

Definition 2.1 A solution u0 ∈ K ∩ D(φ) of inequality problem (1) is called strongiff

⟨u∗, η(v,u0)

⟩ + φ(v) − φ(u0) ≥ 0

holds for all v ∈ K and all u∗ ∈ A(u0).

Clearly, from the above definition, if A is a single-valued operator, then the con-cepts of solution and strong solution are one and the same.

The need for introducing multivalued maps was recognized in the beginning of thetwentieth century, but a systematic study of such maps started in the mid 1960s. Sincenonsmooth analysis was born, these two relatively new branches of mathematics haveundergone a remarkable development and have provided each other with new toolsand concepts, as maybe the most important multivalued maps are the subdifferentialof a convex functional and Clarke’s generalized gradient of a locally Lipschitz func-tional. We present next some preliminary notions of multivalued analysis that will beuseful in the sequel.

Definition 2.2 Let E,F be two Hausdorff topological spaces. A set-valued map T :E ⇒ F is said to be

(i) lower semicontinuous at a point x0 ∈ E (l.s.c. at x0 for short), iff, for any openset V ⊆ F such that T (x0) ∩ V = ∅, we can find a neighborhood U of x0 suchthat T (x) ∩ V = ∅ for all x ∈ U . If this is true for every x0 ∈ E, we say that T

is lower semicontinuous (l.s.c. for short);(ii) upper semicontinuous at a point x0 ∈ E (u.s.c. at x0 for short), iff, for any open

set V ⊆ F such that T (x0) ⊆ V , we can find a neighborhood U of x0 such thatT (x) ⊆ V for all x ∈ U . If this is true for every x0 ∈ E, we say that T is uppersemicontinuous (u.s.c. for short);

82 J Optim Theory Appl (2012) 155:79–99

(iii) closed, iff, for every net {xλ}λ∈I ⊂ E converging to x and {yλ}λ∈I ⊂ F converg-ing to y such that yλ ∈ T (xλ) for all λ ∈ I , we have y ∈ T (x).

We denote by G(T ) = {(x, y) : x ∈ E and y ∈ T (x)} the graph of T .The following proposition gives a useful characterization of lower semicontinuous

(upper semicontinuous, closed) set-valued maps in terms of generalized sequences.For the proof, one can consult N.S. Papageorgiou and S.Th. Kyritsi-Yiallourou[15, Proposition 6.1.4] and K. Deimling [16, Proposition 24.1].

Proposition 2.1 Let E,F be two Hausdorff topological spaces and T : E ⇒ F a set-valued map. Then

(i) T is l.s.c. if and only if, for any pair (x, y) ∈ G(T ) and any net {xλ}λ∈I ⊂ E

converging to x, we can determine, for each λ ∈ I , an element yλ ∈ T (xλ) suchthat yλ → y;

(ii) Let T (x) be closed for all x ∈ D ⊆ E. If T is u.s.c. and D is closed, then G(T )

is closed. If T (D) is compact and D is closed, then T is u.s.c. if and only ifG(T ) is closed;

(iii) If D ⊆ E is compact, T is u.s.c. and T (x) is compact for all x ∈ D, then T (D)

is compact.

Remark 2.1 Clearly, from above, when T is single-valued, i.e., T (x) = {y} ⊂ F , thenotions of lower and upper semicontinuity coincide with the usual notion of continu-ity of a map between two Hausdorff topological spaces.

We close this section with some results that will play a key role in the proof ofour main results. The following result is a fixed point theorem for set-valued mapsdue to Q.H. Ansari and J.-C. Yao [17] and will be used to prove the existence ofsolutions of inequality problem (1) in the case of compact convex subsets in reflexiveand nonreflexive Banach spaces.

Theorem 2.1 Let K be a nonempty, closed, and convex subset of a Hausdorff topo-logical vector space E and let S,T : K ⇒ K be two set-valued maps. Assume that:

• for each x ∈ K , S(x) be nonempty and conv{S(x)} ⊆ T (x);• K = ⋃

y∈K intK S−1(y);• if K is not compact, there exists a nonempty, compact, and convex subset C0 of K

and a nonempty, compact, subset C1 of K such that, for each x ∈ K \ C1, thereexists y ∈ C0 with the property that x ∈ intK S−1(y).

Then there exists x0 ∈ K such that x0 ∈ T (x0).

The next result is known in the literature as Mosco’s Alternative (see U. Mos-co [18]) and will be useful in proving the existence of at least one solution of in-equality problem (1) in the case of bounded, closed, and convex subsets in reflexiveBanach spaces.

J Optim Theory Appl (2012) 155:79–99 83

Theorem 2.2 Let K be a nonempty, compact, and convex subset of a topologicalvector space E and assume φ : E → R ∪ {+∞} is a proper, convex, lower semicon-tinuous functional such that D(φ) ∩ K = ∅. Let ξ, ζ : E ×E → R be two functionalssuch that:

• ξ(x, y) ≤ ζ(x, y) for all x, y ∈ E;• for each x ∈ E, the map y �→ ξ(x, y) is lower semicontinuous;• for each y ∈ E, the map x �→ ζ(x, y) is concave.

Then, for each μ ∈ R, the following alternative holds true: either there exists y0 ∈K ∩ D(φ) such that

ξ(x, y0) + φ(y0) − φ(x) ≤ μ, for all x ∈ E,

or there exists x0 ∈ E such that ζ(x0, x0) > μ.

Finally, we present below Ky Fan’s version of the KKM Principle (see K. Fan [19]),which we will use to establish the existence of at least one solution for inequalityproblem (2) in the case of relaxed η-α quasimonotone set-valued maps.

Theorem 2.3 Let K be a nonempty subset of a Hausdorff topological vector spaceE and let T : K ⇒ E be a set-valued map satisfying the following properties:

• T is a KKM map;• T (x) is closed in E for every x ∈ K ;• there exists x0 ∈ K such that T (x0) is compact in E.

Then⋂

x∈K T (x) = ∅.

We recall that a set-valued map T : K ⇒ E is said to be a KKM map iff for any{x1, . . . , xn} ⊂ K , conv{x1, . . . , xn} ⊆ ⋃n

j=1 T (xj ), where conv{x1, . . . , xn} denotesthe convex hull of {x1, . . . , xn}.

3 Existence Results

3.1 The Case of Nonreflexive Banach Spaces

Throughout this subsection, X will denote a nonreflexive Banach space, and K willstand for a nonempty, closed, and convex subset of X∗∗. Before stating the resultsconcerning the existence of solutions for problem (1), we indicate below some hy-potheses that will be needed in the sequel.

(H1A) A : K ⇒ X∗ is a set-valued map which is l.s.c. from K endowed with the

strong topology into X∗ with the w∗-topology, and has nonempty values;(H2

A) A : K ⇒ X∗ is a set valued map which is u.s.c. from K with the strong topol-ogy into X∗ with the w∗-topology, and has nonempty w∗-compact values;

(Hφ) φ : X∗∗ → R ∪ {+∞} is a proper convex lower semicontinuous functionalsuch that Kφ := K ∩ D(φ) is nonempty;

84 J Optim Theory Appl (2012) 155:79–99

(Hη) η : K × K → X∗∗ is such that

• for all v ∈ K , the map u �→ η(v,u) is continuous;• for all u,v,w ∈ K and all w∗ ∈ A(w), the map v �→ 〈w∗, η(v,u)〉 is convex

and 〈w∗, η(u,u)〉 ≥ 0.

Theorem 3.1 Let X be a nonreflexive Banach space and K ⊆ X∗∗ nonempty, closed,and convex. Assume that (Hφ), (Hη) and either (H1

A) or (H2A) hold. If the set Kφ

is not compact, we assume, in addition, that there exists a nonempty, compact andconvex subset C of Kφ such that, for each u ∈ Kφ \ C, we can find u∗

0 ∈ A(u) andv ∈ C with the property that

⟨u∗

0, η(v, u)⟩ + φ(v) − φ(u) < 0.

Then inequality problem (1) has at least one strong solution.

Proof Arguing by contradiction, let us assume that (1) has no strong solution. Then,for each u ∈ Kφ , there exist u∗ ∈ A(u) and v = v(u, u∗) ∈ K such that

⟨u∗, η(v,u)

⟩ + φ(v) − φ(u) < 0. (3)

Clearly, the element v for which (3) takes place satisfies v ∈ D(φ), therefore v ∈ Kφ .We consider next the set-valued map F : Kφ ⇒ Kφ defined by

F(u) = {v ∈ Kφ : ⟨u∗, η(v,u)

⟩ + φ(v) − φ(u) < 0},

where u∗ ∈ A(u) is given in (3).

Claim 1. For each u ∈ Kφ , the set F(u) is nonempty and convex.

Let u ∈ Kφ be arbitrarily fixed. Then (3) implies that F(u) is nonempty. Letv1, v2 ∈ F(u), λ ∈ ]0,1[ and define w = λv1 + (1 − λ)v2. We have

⟨u∗, η(w,u)

⟩ + φ(w) − φ(u) ≤ λ[⟨u∗, η(v1, u)

⟩ + φ(v1)]

+ (1 − λ)[⟨u∗, η(v2, u)

⟩ + φ(v2)] − φ(u) < 0,

which shows that w ∈ F(u), therefore F(u) in a convex subset of Kφ .

Claim 2. For each v ∈ Kφ the set F−1(v) = {u ∈ Kφ : v ∈ F(u)} is open.

Let us fix v ∈ Kφ . Taking into account that F−1(v) = {u ∈ Kφ : ∃u∗ ∈ A(u) s.t.〈u∗, η(v,u)〉 + φ(v) − φ(u) < 0}, we shall prove that

[F−1(v)

]c = {u ∈ Kφ : ⟨u∗, η(v,u)

⟩ + φ(v) − φ(u) ≥ 0, for all u∗ ∈ A(u)}

is a closed subset of Kφ . Let {uλ}λ∈I ⊂ [F−1(v)] be a net converging to some u ∈ Kφ .Then, for each λ ∈ I , we have

⟨u∗

λ, η(v,uλ)⟩ + φ(v) − φ(uλ) ≥ 0, for all u∗

λ ∈ A(uλ). (4)

Taking into account that η(·, ·) is continuous with respect to the second variable, weobtain that

η(v,uλ) → η(v,u). (5)

J Optim Theory Appl (2012) 155:79–99 85

Case 1. (H1A) holds.

We fix u∗ ∈ A(u) and, for each λ ∈ I , we can determine u∗λ ∈ A(uλ) such that

u∗λ ⇁ u∗ in X∗,

since A is l.s.c. from K with the strong topology into X∗ with the w∗-topology, whichcombined with (5), shows that

⟨u∗

λ, η(v,uλ)⟩ → ⟨

u∗, η(v,u)⟩.

Case 2. (H2A) holds.

We define the compact set D = {uλ : λ ∈ I } ∪ {u} and apply Proposition 2.1to conclude that A(D) is a w∗-compact set, which means that {u∗

λ}λ∈I admits asubnet {u∗

λ}λ∈J such that u∗λ ⇁ u∗ for some u∗ ∈ X∗. But A is u.s.c., and thus

u∗ ∈ A(u). Since u∗λ ⇁ u∗ and η(v,uλ) → η(v,u), we deduce that 〈u∗

λ, η(v,uλ)〉 →〈u∗, η(v,u)〉.

Using (4) we get

0 ≤ lim sup[⟨u∗

λ, η(v,uλ)⟩ + φ(v) − φ(uλ)

]

≤ lim sup⟨u∗

λ, η(v,uλ)⟩ + φ(v) − lim infφ(uλ)

≤ ⟨u∗, η(v,u)

⟩ + φ(v) − φ(u),

which means that u ∈ [F−1(v)]c , therefore, [F−1(v)]c is a closed subset of Kφ .

Claim 3. Kφ = ⋃v∈Kφ

intKφ F−1(v).

We only need to prove that Kφ ⊆ ⋃v∈Kφ

intKφ F−1(v), as the converse inclusion

is satisfied since F−1(v) is a subset Kφ for all v ∈ Kφ . For each u ∈ Kφ , there existv ∈ Kφ such that v ∈ F(u) (such a v exists since F(u) is nonempty), and thus u ∈F−1(v) ⊆ ⋃

v∈KφF−1(v) = ⋃

v∈KφintKφ F−1(v). If the Kφ is not compact, then the

last condition of our theorem implies that, for each u ∈ Kφ \ C, there exists v ∈ C

such that u ∈ F−1(v) = intKφ F−1(v). This observation and the above Claims ensurethat all the conditions of Theorem 2.1 are satisfied for S = T = F , and we deducethat the set-valued map F : Kφ ⇒ Kφ admits a fixed point u0 ∈ Kφ , i.e. u0 ∈ F(u0).This can be rewritten equivalently as

0 ≤ ⟨u∗

0, η(u0, u0)⟩ + φ(u0) − φ(u0) < 0.

We have obtained thus a contradiction which completes the proof. �

3.2 The Case of Reflexive Banach Spaces

Throughout this subsection, X will denote a real reflexive Banach space and K ⊆ X

will be a nonempty, closed, and convex set. In order to prove our existence results,throughout this subsection, we shall use some of the following hypotheses:

(H1A) A : K ⇒ X∗ is a set-valued map which is l.s.c. from K with the strong topology

into X∗ with the w-topology, and has nonempty values;(H2

A) A : K ⇒ X∗ is a set valued map which is u.s.c. from K with the strong topologyinto X∗ with the w-topology, and has nonempty w-compact values;

86 J Optim Theory Appl (2012) 155:79–99

(Hφ) φ : X → R ∪ {+∞} is a proper convex lower semicontinuous functional suchthat Kφ := K ∩ D(φ) is nonempty;

(H1η) η : K × K → X is such that

• for all v ∈ K , the map u �→ η(v,u) is continuous;• for all u,v,w ∈ K and all w∗ ∈ A(w), the map v �→ 〈w∗, η(v,u)〉 is convex

and 〈w∗, η(u,u)〉 ≥ 0;

(H2η) η : K × K → X is such that

• η(u, v) + η(v,u) = 0 for all u,v ∈ K ;• for all u,v,w ∈ K and all w∗ ∈ A(w), the map v �→ 〈w∗, η(v,u)〉 is convex

and lower semicontinuous;

(H1α) α : X → R is weakly lower semicontinuous functional such that

lim supλ↓0α(λv)

λ≥ 0 for all v ∈ X;

(H2α) α : X → R is such that

• α(0) = 0;• lim supλ↓0

α(λv)λ

≥ 0, for all v ∈ X;• α(u) ≤ lim supα(uλ), whenever uλ ⇀ u in X.

The following theorem is a variant of Theorem 3.1 in the framework of reflexiveBanach spaces.

Theorem 3.2 Let X be a real reflexive Banach space and K ⊆ X nonempty, compact,and convex. Assume that (Hφ), (H1

η), and either (H1A) or (H2

A) hold. Then inequalityproblem (1) has at least one strong solution.

The proof of Theorem 3.2 follows basically the same steps as the proof of Theo-rem 3.1, therefore, we shall omit it.

Remark 3.1 If A is single-valued and φ is the indicator function of the set K , thenTheorem 3.2 extends Theorem 3.1 in [1] since X is a reflexive Banach space whichmay be infinite dimensional and the condition 〈A(v), η(u,u)〉 ≥ 0, for all u, v ∈ K ,is weaker than the the condition 〈A(u), η(u,u)〉 = 0, for all u ∈ K .

In order to see that the conclusion of Remark 3.1 holds, we provide an example ofoperators A and η such that the condition 〈A(u), η(u,u)〉 = 0, for all u ∈ K , fails andproblem (1) (actually problem (2)) still has a solution. Let us consider K = [−a, a]×[−a, a] ⊂ R

2, A : K → R2, A(u) = (u2

1, u22) for all u = (u1, u2) ∈ K and η : K ×

K → R2, η(v,u) = (u1v1, u2v2). Then

⟨A(u), η(u,u)

⟩ = u41 + u4

2 > 0, for u = (0,0),

and⟨A(v), η(u,u)

⟩ = u21v

21 + u2

2v22 ≥ 0, for all u,v ∈ K.

It is easy to see that u = (0,0) is a solution of problem (2).

J Optim Theory Appl (2012) 155:79–99 87

We point out the fact that in the above case, when K is a compact convex sub-set of X, we do not impose any monotonicity conditions on the set-valued opera-tor A. However, in applications, most problems lead to an inequality, whose solu-tion is sought in a closed and convex subset of the space X. Weakening the hy-potheses on K by assuming that K is only bounded, closed, and convex, we needto impose certain monotonicity properties on A. In the last decades, more andmore efforts were made to introduce various generalizations of the monotonicityconcept from which we remember pseudomonotonicity, quasimonotonicity, semi-monotonicity, relaxed α monotonicity, relaxed η-α monotonicity, and these con-cepts were used to prove existence results for various inequality problems; see e.g.,M.-R. Bai et al. [3], M. Bianchi, N. Hadjisavvas and S. Schaible [20], Y.Q. Chen [21],N. Costea and A. Matei [22, 23], N. Costea and V. Radulescu [24, 25], Y.P. Fang andN.J. Huang [6], S. Karamardian and S. Schaible [26], S. Karamardian, S. Schaibleand J.P. Crouzeix [27], I.V. Konov and S. Schaible [28], and the references therein.

Definition 3.1 Let η : K ×K → X and α : X → R be two single-valued maps. A set-valued map T : K ⇒ X∗ is said to be

• relaxed η-α monotone, iff for all u,v ∈ K , all v∗ ∈ T (v) and all u∗ ∈ T (u), wehave

⟨v∗ − u∗, η(v,u)

⟩ ≥ α(v − u); (6)

• relaxed η-α pseudomonotone, iff for all u,v ∈ K , all v∗ ∈ T (v) and all u∗ ∈ T (u),we have

⟨u∗, η(v,u)

⟩ ≥ 0 implies⟨v∗, η(v,u)

⟩ ≥ α(v − u); (7)

• relaxed η-α quasimonotone, iff for all u,v ∈ K , u = v, all v∗ ∈ T (v) and all u∗ ∈T (u), we have

⟨u∗, η(v,u)

⟩> 0 implies

⟨v∗, η(v,u)

⟩ ≥ α(v − u). (8)

Special cases

1. η(v − u) = v − u. Then

• (6) reduces to: for all u,v ∈ K , all v∗ ∈ T (v) and all u∗ ∈ T (u), we have⟨v∗ − u∗, v − u

⟩ ≥ α(v − u),

and T is said to be relaxed α monotone;• (7) reduces to: for all u,v ∈ K , all v∗ ∈ T (v) and all u∗ ∈ T (u), we have

⟨u∗, v − u

⟩ ≥ 0 implies⟨v∗, v − u

⟩ ≥ α(v − u),

and T is said to be relaxed α pseudomonotone;• (8) reduces to: for all u,v ∈ K , u = v, all v∗ ∈ T (v) and all u∗ ∈ T (u), we have

⟨u∗, v − u

⟩> 0 implies

⟨v∗, v − u

⟩ ≥ α(v − u),

and T is said to be relaxed α quasimonotone.

2. η(v − u) = v − u and α ≡ 0. Then

88 J Optim Theory Appl (2012) 155:79–99

• (6) reduces to: for all u,v ∈ K , all v∗ ∈ T (v) and all u∗ ∈ T (u), we have⟨v∗ − u∗, v − u

⟩ ≥ 0,

and T is said to be monotone;• (7) reduces to: for all u,v ∈ K , all v∗ ∈ T (v) and all u∗ ∈ T (u), we have

⟨u∗, v − u

⟩ ≥ 0 implies⟨v∗, v − u

⟩ ≥ 0,

and T is said to be pseudomonotone;• (8) reduces to: for all u,v ∈ K , u = v, all v∗ ∈ T (v) and all u∗ ∈ T (u), we have

⟨u∗, v − u

⟩> 0 implies

⟨v∗, v − u

⟩ ≥ 0,

and T is said to be quasimonotone.

Example 3.1 Let a > 0 be a real number, K = [0, a] × [0, a] × {0} ⊂ R3 and define

T1, T2, T3 : K ⇒ R3as follows:

T1(u) = {(0, u∗

2, u∗3

) : u∗2 = u2 and −u1 ≤ u∗

3 ≤ u1},

T2(u) = {(0, u∗

2, u∗3

) : a/2 ≤ u∗2 ≤ a and −u1 ≤ u∗

3 ≤ u1},

T3(u) = {(0, u∗

2, u∗3

) : −a ≤ u∗2 ≤ 0 and −u1 ≤ u∗

3 ≤ u1}.

Let u = (u1, u2,0) ∈ K , v = (v1, v2,0) ∈ K , u∗ = (0, u∗2, u

∗3) ∈ T1(u) and v∗ =

(0, v∗2 , v∗

3) ∈ T1(v) be arbitrarily fixed. Then⟨v∗ − u∗, v − u

⟩ = |v2 − u2|2 ≥ 0,

which shows that T1 is monotone.Let u = (u1, u2,0) ∈ K , v = (v1, v2,0) ∈ K and u∗ = (0, u∗

2, u∗3) ∈ T2(u) be such

that⟨u∗, v − u

⟩ ≥ 0.

This means that v2 − u2 ≥ 0 since 0 < a/2 ≤ u∗2. Thus, for any v∗ = (0, v∗

2 , v∗3) ∈

T2(v),⟨v∗, v − u

⟩ = v∗2(v2 − u2) ≥ 0,

which shows that T2 is pseudomonotone.On the other hand, taking u = (0,0,0) ∈ K , v = (0, a,0) ∈ K , u∗ = (0, a,0) ∈

T2(u) and v∗ = (0, a/2,0) ∈ T2(v), we have

⟨v∗ − u∗, v − u

⟩ = −a2

2< 0,

which shows that T2 is not monotone.Let u = (u1, u2,0) ∈ K , v = (v1, v2,0) ∈ K and u∗ = (0, u∗

2, u∗3) ∈ T3(u) be such

that⟨u∗, v − u

⟩> 0.

This means that u∗2 = 0 and v2 − u2 < 0. Thus, for any v∗ = (0, v∗

2 , v∗3) ∈ T3(v),

⟨v∗, v − u

⟩ = v∗2(v2 − u2) ≥ 0,

which shows that T3 is quasimonotone.

J Optim Theory Appl (2012) 155:79–99 89

On the other hand, if u = (0,0,0) ∈ K , v = (0, a,0) ∈ K , u∗ = (0,0,0) ∈ T3(u)

and v∗ = (0,−a/2,0) ∈ T3(v), then

⟨u∗, v − u

⟩ = 0 and⟨v∗, v − u

⟩ = −a2

2< 0,

which shows that T3 is not pseudomonotone.Clearly, the following assertions hold true

• T1 is monotone;• T2 is pseudomonotone and it is not monotone;• T3 is quasimonotone and it is not pseudomonotone.

Defining α : R3 → R by α(u) = 0, for all u ∈ R

3, it is easy to see that

• T1 is relaxed α monotone;• T2 is relaxed α pseudomonotone and it is not relaxed α monotone;• T3 is relaxed α quasimonotone and it is not relaxed α pseudomonotone.

Considering η : K × K → R3, defined by η(v,u) = v − u, and α : R

3 → R as abovewe conclude that

• T1 is relaxed η-α monotone;• T2 is relaxed η-α pseudomonotone and it is not relaxed η-α monotone;• T3 is relaxed η-α quasimonotone and it is not relaxed η-α pseudomonotone.

Example 3.2 Let a > 0 be a real number, K = [0, a] × [0, a] × {0} ⊂ R3 and define

T4 : K ⇒ R3 as follows:

T4(u) = {(0, u∗

2, u∗3

) : u∗2 = −u2

2 and −u1 ≤ u∗3 ≤ u1

}.

Let α : R3 → R be defined by α(u) = −2a‖u‖2 and u = (u1, u2,0) ∈ K , v =

(v1, v2,0) ∈ K , u∗ = (0, u∗2, u

∗3) ∈ T4(u), v∗ = (0, v∗

2 , v∗3) ∈ T4(v) be arbitrarily

fixed. Then⟨v∗ − u∗, v − u

⟩ = −(v2 + u2)|v2 − u2|2 ≥ −2a|v2 − u2|2≥ −2a

(|v1 − u1|2 + |v2 − u2|2) = −2a‖v − u‖2

= α(v − u),

which shows that T4 is relaxed α monotone and not monotone.

Example 3.3 Let a,p > 1 be real numbers, K = [0, a]×[0, a]×{0} ⊂ R3 and define

T5 : K ⇒ R3 as follows:

T5(u) = {(0, u∗

2, u∗3

) : u∗2 = −u

p

2 and −u1 ≤ u∗3 ≤ u1

}.

Let η : R3 ×R

3 → R3 be defined by η(v,u) = (u

p

1 −vp

1 , up

2 −vp

2 , up

3 −vp

3 ) and α :R

3 → R be defined by α(u) = − 12‖u‖. Let u = (u1, u2,0) ∈ K , v = (v1, v2,0) ∈ K ,

u∗ = (0, u∗2, u

∗3) ∈ T5(u), v∗ = (0, v∗

2 , v∗3) ∈ T5(v) be arbitrarily fixed. Then

⟨v∗ − u∗, η(v,u)

⟩ = ∣∣up

2 − vp

2

∣∣2 ≥ −1

2‖v − u‖ = α(v − u),

90 J Optim Theory Appl (2012) 155:79–99

which shows that T5 is relaxed η-α monotone.Taking u = (0,0,0) ∈ K , v = (0, a,0) ∈ K , u∗ = (0,0,0) ∈ T5(u) and v∗ =

(0,−ap,0) ∈ T5(v), we observe that⟨v∗ − u∗, v − u

⟩ = −ap+1 < −a

2= α(v − u),

which shows that T5 is not relaxed α monotone.On the other hand, if we define η : R

3 ×R3 → R

3 by η(v,u) = (up

1 −vp

1 , up

2 −vp

2 ,

up

3 − vp

3 ) and α : R3 → R by α(u) = 0, it is easy to check that T5 is relaxed η-α

pseudomonotone and not relaxed α monotone.

Example 3.4 Let a > 0 be a real number, K = [−a, a] × [−a, a] × {0} ⊂ R3 and

define T6 : K ⇒ R3 as follows:

T6(u) = {(0, u∗

2, u∗3

) : u∗2 = −u2 and −a ≤ u∗

3 ≤ a}.

Then T6 is relaxed α pseudomonotone with α : R3 → R, α(u) = −‖u‖2, and T6 is

not pseudomonotone.Let u = (u1, u2,0) ∈ K , v = (v1, v2,0) ∈ K and u∗ = (0, u∗

2, u∗3) ∈ T6(u) be such

that⟨u∗, v − u

⟩ ≥ 0.

This means that u2(v2 − u2) ≤ 0 and we distinguish the following cases:

• u2 ≤ v2 < 0For any v∗ ∈ T6(v), we have

⟨v∗, v − u

⟩ = −v2(v2 − u2) ≥ 0 ≥ −‖v − u‖2 = α(v − u).

• u2 < 0 ≤ v2For any v∗ ∈ T6(v), we have

⟨v∗, v − u

⟩ = −v2(v2 − u2) ≥ −(v2 − u2)2 ≥ −‖v − u‖2 = α(v − u).

• v2 ≤ 0 ≤ u2For any v∗ ∈ T6(v), we have

⟨v∗, v − u

⟩ = −v2(v2 − u2) ≥ −(v2 − u2)2 ≥ −‖v − u‖2 = α(v − u).

• 0 ≤ v2 ≤ u2For any v∗ ∈ T6(v), we have

⟨v∗, v − u

⟩ = −v2(v2 − u2) ≥ 0 ≥ −‖v − u‖2 = α(v − u).

Example 3.5 Let K = [0,2π] × [0,2π] × {0} ⊂ R3 and define T7 : K ⇒ R

3 as fol-lows:

T7(u) = {(0, u∗

2, u∗3

) : u∗2 = cosu2 and −u1 ≤ u∗

3 ≤ u1}.

We define α : R3 → R by α(u) = −m‖u‖, where m > 1 is a constant, and we claim

that T7 is relaxed α quasimonotone and not quasimonotone. Let u = (u1, u2,0) ∈ K ,v = (v1, v2,0) ∈ K and u∗ = (0, u∗

2, u∗3) ∈ T7(u) be such that

⟨u∗, v − u

⟩> 0.

J Optim Theory Appl (2012) 155:79–99 91

This means that cosu2(v2 − u2) > 0 and, for any v∗ = (0, v∗2 , v∗

3) ∈ T7(v), we have

⟨v∗, v − u

⟩ = cosv2(v2 − u2) ≥ −| cosv2||v2 − u2| ≥ −|v2 − u2| = −√

|v2 − u2|2

≥ −√

|v1 − u1|2 + |v2 − u2|2 ≥ −m‖v − u‖ = α(v − u),

which shows that T7 is relaxed α quasimonotone.If we take u = (0,π/4,0) ∈ K , v = (0,π,0) ∈ K , u∗ = (0, cosπ/4,0) ∈ T7(u)

and v∗ = (0, cosπ,0) ∈ T7(v), we observe that

⟨u∗, v − u

⟩ = 3√

8> 0 and

⟨v∗, v − u

⟩ = −3π

4< 0,

which shows that T7 is not quasimonotone.On the other hand, if we consider η : R

3 × R3 → R defined by η(v,u) =

(u1 cosv1, u2 cosv2, u3 cosv3) and α : R3 → R defined by α(u) = 0 we observe that

T7 is relaxed η-α quasimonotone and not relaxed α monotone.

From the above definitions and examples, we have the following implications (andthe inverse of each implication is not true, in general), which highlight the relationsbetween different kinds of generalized monotonicity for set-valued maps.

monotone → pseudomonotone → quasimonotone↓ ↓ ↓

relaxed α monotone → relaxed α pseudomonotone → relaxed α quasimonotone↓ ↓ ↓

relaxed η-α monotone → relaxed η-α pseudomonotone → relaxed η-α quasimonotone

We are now able to formulate another main result concerning the existence of solu-tions of inequality problem (1) on bounded, closed and convex subsets.

Theorem 3.3 Let K be a nonempty, bounded, closed, and convex subset of the realreflexive Banach space X. Let A : K ⇒ X∗ be a relaxed η-α monotone map andassume that (Hφ), (H2

η), and (H1α) hold. If, in addition

• (H1A) holds, then inequality problem (1) admits at least one strong solution;

• (H2A) holds, then inequality problem (1) admits at least one solution.

Proof We shall apply Mosco’s alternative for the weak topology of X. First, we notethat K is weakly compact as it is a bounded, closed, and convex subset of the realreflexive space X and φ : X → R ∪ {+∞} is weakly lower semicontinuous as it isconvex and lower semicontinuous. We define ξ, ζ : X × X → R as follows:

ξ(v,u) = − infv∗∈A(v)

⟨v∗, η(v,u)

⟩ + α(v − u),

and

ζ(v,u) = supu∗∈A(u)

⟨u∗, η(u, v)

⟩.

92 J Optim Theory Appl (2012) 155:79–99

Let us fix u,v ∈ X and choose v∗ ∈ A(v) such that 〈v∗, η(v,u)〉 = infv∗∈A(v)〈v∗,η(v,u)〉. For arbitrary fixed u∗ ∈ A(u), we have

ζ(v,u) − ξ(v,u) = supu∗∈A(u)

⟨u∗, η(u, v)

⟩ + infv∗∈A(v)

⟨v∗, η(v,u)

⟩ − α(v − u)

≥ ⟨u∗, η(u, v)

⟩ + ⟨v∗, η(v,u)

⟩ − α(v − u)

= ⟨v∗, η(v,u)

⟩ − ⟨u∗, η(v,u)

⟩ − α(v − u) ≥ 0.

Clearly, the conditions imposed on η and α ensure that the map u �→ ξ(v,u) is weaklylower semicontinuous, while the map v �→ ζ(v,u) is concave. Applying Mosco’salternative, for μ = 0, we conclude that there exists u0 ∈ K ∩ D(φ) such that

ξ(v,u0) + φ(u0) − φ(v) ≤ 0, for all v ∈ X,

since ζ(v, v) = 0, for all v ∈ X. A simple computation shows that, for each w ∈ K ,we have

⟨w∗, η(w,u0)

⟩ + φ(w) − φ(u0) ≥ α(w − u0), for all w∗ ∈ A(w). (9)

Let us fix v ∈ K and define wλ = u0 + λ(v − u0), with λ ∈ ]0,1[. Then, for a fixedw∗

λ ∈ A(wλ), from (9), we have

α(λ(v − u0)

) ≤ ⟨w∗

λ, η(wλ,u0)⟩ + φ(wλ) − φ(u0)

≤ λ⟨w∗

λ, η(v,u0)⟩ + (1 − λ)

⟨w∗

λ, η(u0, u0)⟩ + λφ(v)

+ (1 − λ)φ(u0) − φ(u0)

= λ[⟨w∗

λ, η(v,u0)⟩ + φ(v) − φ(u0)

],

which leads to

α(λ(v − u0))

λ≤ ⟨

w∗λ, η(v,u0)

⟩ + φ(v) − φ(u0). (10)

Case 1. (H1A) holds.

We shall prove next that u0 is a strong solution of inequality problem (1). Letu∗

0 ∈ A(u0) be arbitrarily fixed. Combining the fact that wλ → u0 as λ ↓ 0 with thefact that A is l.s.c. from K with the strong topology into X∗ with the w-topology, wededuce that, for each λ ∈ ]0,1[, we can find w∗

λ ∈ A(wλ) such that w∗λ ⇀ u∗

0 as λ ↓ 0.Taking the superior limit in (10) as λ ↓ 0 and keeping in mind (H1

α) we get

0 ≤ lim supλ↓0

α(λ(v − u0))

λ≤ lim sup

λ↓0

[⟨w∗

λ, η(v,u0)⟩ + φ(v) − φ(u0)

]

= ⟨u∗

0, η(v,u0)⟩ + φ(v) − φ(u0),

which shows that u0 is a strong solution of (1), since v ∈ K and u∗0 ∈ A(u0) were

arbitrarily fixed.

Case 2. (H2A) holds.

We shall prove in this case that u0 is a solution of (1). Reasoning as in the proofof Theorem 3.1-Case 2 we infer that there exists u∗

0 ∈ A(u0) and a subnet {w∗λ}λ∈J

J Optim Theory Appl (2012) 155:79–99 93

of {w∗λ}λ∈]0,1[ such that w∗

λ ⇀ u∗0 as λ ↓ 0. Combining this with relation (10) and

hypothesis (H1α) we conclude that

0 ≤ lim supλ↓0

α(λ(v − u0))

λ≤ lim sup

λ↓0

[⟨w∗

λ, η(v,u0)⟩ + φ(v) − φ(u0)

]

= ⟨u∗

0, η(v,u0)⟩ + φ(v) − φ(u0),

which shows that u0 is a solution of (1), since v ∈ K was arbitrarily fixed. �

Weakening even more the hypotheses by assuming that the set-valued mapA : K ⇒ X∗ is relaxed η-α quasimonotone instead of being relaxed η-α monotonethe existence of solutions for inequality problem (1) is an open problem in the casewhen K is nonempty, bounded, closed and convex. However, in this case we canprove the following existence result concerning inequality problem (2).

Theorem 3.4 Let K be a nonempty, bounded, closed, and convex subset of the realreflexive Banach space X. Let A : K ⇒ X∗ be a relaxed η-α quasimonotone map andassume that (H2

η) and (H2α) hold. If, in addition,

• (H1A) holds, then inequality problem (2) admits at least one strong solution;

• (H2A) holds, then inequality problem (2) admits at least one solution.

Proof Define G : K ⇒ X in the following way:

G(v) = {u ∈ K : ⟨v∗, η(v,u)

⟩ ≥ α(v − u) for all v∗ ∈ A(v)}.

First of all, let us observe that v ∈ G(v) for all v ∈ K and thus G(v) is nonemptyfor all v ∈ K . Now, we prove that G(v) is weakly closed for all v ∈ K . Let{uλ}λ∈I ⊂ G(v) be a net such that uλ converges weakly to some u ∈ K . Then wehave

α(v − u) ≤ lim supα(v − uλ) ≤ lim sup⟨v∗, η(v,uλ)

⟩ = lim sup[−⟨

v∗, η(uλ, v)⟩]

= − lim inf⟨v∗, η(uλ, v)

⟩ ≤ −⟨v∗, η(u, v)

⟩ = ⟨v∗, η(v,u)

⟩,

for all v∗ ∈ A(v). It follows that u ∈ G(v), so G(v) is weakly closed.

Case 1. G is a KKM map.

Since K is bounded, closed, and convex in X, which is reflexive, it follows thatK is weakly compact, and thus G(v) is weakly compact for all v ∈ K as it is aweakly closed subset of K . Applying the KKM principle (see Theorem 2.3), we have⋂

v∈K G(v) = ∅ and the set of solutions of problem (2) is nonempty. In order to seethat let u0 ∈ ⋂

v∈K G(v). This implies that, for each w ∈ K , we have⟨w∗, η(w,u)

⟩ ≥ α(w − u), for all w∗ ∈ A(w).

Let v be fixed in K and for λ ∈ ]0,1[ define wλ = u0 + λ(v − u0). We infer that

α(λ(v − u0)

) ≤ ⟨w∗

λ, η(wλ,u0)⟩ ≤ λ

⟨w∗

λ, η(v,u0)⟩ + (1 − λ)

⟨w∗

λ, η(u0, u0)⟩

= λ⟨w∗

λ, η(v,u0)⟩,

94 J Optim Theory Appl (2012) 155:79–99

for all w∗λ ∈ A(wλ).

Applying the same arguments as in the previous proof, we conclude that u0 is astrong solution of inequality problem (2) if (H1

A) holds, while if (H2A) holds, then u0

is a solution of inequality problem (2).

Case 2. G is not a KKM map.

Consider {v1, v2, . . . , vN } ⊆ K and u0 = ∑Nj=1 λjvj with λj ∈ [0,1] and

∑Nj=1 λj = 1 such that u0 ∈ ⋃N

j=1 G(vj ). The existence of such u0 is guaranteedby the fact that G is not a KKM map. This implies that, for all j ∈ {1, . . . ,N}, thereexists v∗

j ∈ A(vj ) such that⟨v∗j , η(vj , u0)

⟩< α(vj − u0). (11)

Now, we claim that there exists a neighborhood U of u0 such that (11) takes placefor all w ∈ U ∩ K , that is

⟨v∗j , η(vj ,w)

⟩< α(vj − w), for all w ∈ U ∩ K.

Arguing by contradiction, let us assume that for any neighborhood U of u0 thereexists an index j0 ∈ {1, . . . ,N} and an element w0 ∈ U ∩ K such that

⟨v∗j0

, η(vj0,w0)⟩ ≥ α(vj0 − w0), for all v∗

j0∈ A(vj0). (12)

Choose U = BX(u0;λ) and for each λ > 0 one can find j0 ∈ {1, . . . ,N} and wλ ∈BX(u0;λ) ∩ K such that

⟨v∗j0

, η(vj0,wλ)⟩ ≥ α(vj − wλ), for all v∗

j0∈ A(vj0).

Let us fix v∗j0

∈ A(vj0). Using the fact that wλ → u0 as λ ↓ 0 and taking the superiorlimit in the above relation, we obtain

α(vj0 − u0) ≤ lim supλ↓0

α(vj0 − wλ)

≤ lim supλ↓0

⟨v∗j0

, η(vj0,wλ)⟩ = − lim inf

λ↓0

⟨v∗j0

, η(wλ, vj0)⟩

≤ −⟨v∗j0

, η(u0, vj0)⟩ = ⟨

v∗j0

, η(vj0, u0)⟩,

which contradicts with relation (11) and this contradiction completes the proof of theclaim. Now, using the fact that A is relaxed η-α quasimonotone map, we prove that

⟨w∗, η(vj ,w)

⟩ ≤ 0, for all w ∈ K ∩ U, all w∗ ∈ A(w) and all j ∈ {1, . . . ,N}.(13)

In order to prove (13) let us assume by contradiction that there exists w0 ∈ K ∩ U ,w∗

0 ∈ A(w0) and j0 ∈ {1, . . . ,N} such that 〈w∗0, η(vj0,w0)〉 > 0. From the fact that A

is relaxed η-α quasimonotone it follows that⟨v∗j0

, η(vj0,w0)⟩ ≥ α(vj0 − w0), for all v∗

j0∈ A(vj0),

which contradicts the fact that (11) holds for all w ∈ U ∩ K and all j ∈ {1, . . . ,N}.On the other hand, for arbitrary fixed w ∈ K ∩ U and w∗ ∈ A(w), we have

J Optim Theory Appl (2012) 155:79–99 95

⟨w∗, η(u0,w)

⟩ =⟨

w∗, η(

N∑

j=1

λjvj ,w

)⟩

≤N∑

j=1

λj

⟨w∗, η(vj ,w)

⟩ ≤ 0.

Thus, we obtain

0 ≤ ⟨w∗,−η(u0,w)

⟩ = ⟨w∗, η(w,u0)

⟩.

But w∗ ∈ A(w) was chosen arbitrarily, and thus for each w ∈ U ∩ K , we have⟨w∗, η(w,u0)

⟩ ≥ 0, for all w∗ ∈ A(w). (14)

We shall prove next that u0 solves inequality problem (2). Consider v ∈ K to bearbitrary fixed.

Case 2.1. v ∈ U .

In this case, the entire line segment ]u0, v[ = {u0 + λ(v − u0) : λ ∈ ]0,1[} is con-tained in U ∩ K and, according to (14), for each wλ ∈ ]u0, v[ and each w∗

λ ∈ A(wλ),we have

0 ≤ ⟨w∗

λ, η(wλ,u0)⟩ ≤ λ

⟨w∗

λ, η(v,u0)⟩ + (1 − λ)

⟨w∗

λ, η(u0, u0)⟩ = λ

⟨w∗

λ, η(v,u0)⟩.

Let us assume that (H1A) and fix u∗ ∈ A(u). Then, for each λ ∈ ]0,1[, we can

determine w∗λ ∈ A(wλ) such that w∗

λ ⇀ u∗ as λ ↓ 0.If (H2

A) holds, then there exists u∗0 ∈ A(u0) for which we can determine a subnet

{w∗λ}λ∈J of {w∗

λ}λ∈]0,1[ such that w∗λ ⇀ u∗

0 in X∗ as λ ↓ 0.Dividing by λ > 0 the above relation and taking into account the previous obser-

vation we conclude (after passing to the limit as λ ↓ 0) that u0 is a strong solution ofproblem (2) if (H1

A) holds (u0 is a solution of problem (2) if (H2A) holds).

Case 2.2. v ∈ K \ U .

First, we observe that ]u0, v[ ⊂ K . Since v ∈ U , there exists λ0 ∈ ]0,1[ such thatv0 = u0 + λ0(v − u0) ∈ ]u0, v[ and has the property that the entire line segment]u0, v0[ is contained in U ∩ K . Thus, for each λ ∈ ]0,1[, the element wλ = u0 +λ(v0 −u0) ∈ K ∩V . But v0 = u0 +λ0(v−u0), hence wλ = u0 +λ0λ(v−u) ∈ K ∩V

and wλ → u0 as λ ↓ 0. Applying the same arguments as in Case 2.1, we infer that u0is a strong solution of problem (2) if (H1

A) holds (u0 is a solution of problem (2) if(H2

A) holds) and this completes our proof. �

Let us turn our attention toward the case when K is a unbounded, closed, and con-vex subset of X. We shall establish next some sufficient conditions for the existenceof solutions of problems (1) and (2). For every r > 0, we define

Kr = {u ∈ K : ‖u‖ ≤ r

}and K−

r = {u ∈ K : ‖u‖ < r

},

and consider the problems:

• Find ur ∈ Kr ∩ D(φ) such that

∃u∗r ∈ A(ur):

⟨u∗

r , η(v,ur)⟩ + φ(v) − φ(ur) ≥ 0, for all v ∈ Kr, (15)

and

96 J Optim Theory Appl (2012) 155:79–99

• Find ur ∈ Kr such that

∃u∗r ∈ A(ur):

⟨u∗

r , η(v,ur)⟩ ≥ 0 for all v ∈ Kr. (16)

Clearly, the solution sets of problems (15) and (16) are nonempty. We have the follow-ing characterization for the existence of solutions in the case of unbounded, closed,and convex subsets.

Theorem 3.5 Assume that the same hypotheses as in Theorem 3.3 hold without theassumption of boundedness of K . Then each of the following conditions is sufficientfor inequality problem (1) to admit at least one strong solution (solution):

(H1) there exists r0 > 0 and ur0 ∈ K−r0

such that ur0 solves (15).(H2) there exists r0 > 0 such that, for each u ∈ K \ Kr0 , we can find v ∈ Kr0 such

that⟨u∗, η(v, u)

⟩ + φ(v) − φ(u) ≤ 0, for all u∗ ∈ A(u).

(H3) there exists u ∈ K and a function c : R+ → R+, with the property thatlimr→+∞ c(r) = +∞, such that

infu∗∈A(u)

⟨u∗, η(u, u)

⟩ ≥ c(‖u‖)‖u‖, for all u ∈ K.

Proof Let v ∈ K be arbitrary fixed.• Assume (H1) holds. We define

s0 ={

12 , if v = ur0,

min{ 12 ; r0−‖ur0‖

‖v−ur0‖ }, otherwise,

and observe that ws0 = ur0 + s0(v − ur0) belongs to Kr0 as 0 < s0 < 1 and Kr0 isconvex. Assuming that (H1

A) holds and using the fact that ur0 is a strong solution ofproblem (15) we deduce that, for each u∗

r0∈ A(ur0), we have

0 ≤ ⟨u∗

r0, η(ws0, ur0)

⟩ + φ(ws0) − φ(ur0)

≤ s0⟨u∗

r0, η(v,ur0)

⟩ + (1 − s0)⟨u∗

r0, η(ur0, ur0)

⟩ + s0φ(v)

+ (1 − s0)φ(ur0) + φ(ur0)

= s0[⟨u∗

r0, η(v,ur0) + φ(v) − φ(ur0)

⟩].

Dividing by s0 > 0 we obtain that ur0 is a strong solution of inequality problem (1)as v ∈ K was chosen arbitrarily.

In a similar way, we prove that ur0 is a solution of inequality problem (1) if (H2A)

holds.• Assume (H2) holds. Let us fix r > r0. Then problem (15) admits at one solution

ur ∈ Kr . We observe that we only need to study the case when ‖ur‖ = r . Indeed, if‖ur‖ < r , then ur ∈ K−

r and by condition (H1) ur solves problem (1). The fact that‖ur‖ = r implies that ur ∈ K \ Kr0 , and thus we have

⟨u∗

r , η(v, ur)⟩ + φ(v) − φ(ur) ≤ 0, for all u∗

r ∈ A(ur). (17)

J Optim Theory Appl (2012) 155:79–99 97

We define

s1 ={

12 , if v = v,

min{ 12 ,

r−r0‖v−v‖ }, otherwise,

and observe that ws1 = v + s1(v − v) belongs to Kr and ws1 − ur = s1(v − ur) +(1 − s1)(v − ur). Let us assume that (H1

A) holds and ur is a strong solution of in-equality (15). Then, for each u∗

r ∈ A(ur), we have

0 ≤ ⟨u∗

r , η(ws1, ur)⟩ + φ(ws1) − φ(ur)

≤ s1⟨u∗

r , η(v,ur)⟩ + (1 − s1)

⟨u∗

r , η(v, ur)⟩ + s0φ(v) + (1 − s1)φ(v) − φ(ur),

which leads to

0 ≤ s1[⟨u∗

r , η(v,ur)⟩ + φ(v) − φ(ur)

]

+ (1 − s1)[⟨u∗

r , η(v, ur)⟩ + φ(v) − φ(ur)

], for all u∗

r ∈ A(ur). (18)

Combining (17) and (18), we infer that ur is a strong solution of inequality prob-lem (1).

In a similar way we prove that ur0 is a solution of inequality problem (1) if (H2A)

holds.• Assume (H3) holds. For each r > 0, problem (15) admits at least a solution

ur ∈ Kr . We shall prove that there exists r0 such that ur0 ∈ K−r0

, which according to(H1) means that ur0 solves inequality problem (1). Arguing by contradiction, let usassume that ‖ur‖ = r for all r > 0. First, we observe that the function φ is boundedfrom below by an affine and continuous function as it is convex and lower semicon-tinuous (see, e.g., H. Brezis [29, Proposition 1.10]), therefore, there exists g ∈ X∗and β ∈ R such that

φ(u) ≥ 〈g,u〉 + β, for all u ∈ X.

Taking v = u in (15), we obtain

c(r)r = c(‖ur‖

)‖ur‖ ≤ ⟨u∗

r , η(ur , u)⟩ ≤ φ(u) − φ(ur) ≤ φ(u) − β − 〈g,ur 〉

≤ r‖g‖∗ + φ(u) − β.

Dividing by r > 0 and then letting r → +∞, we obtain a contradiction since theleft-hand side term of the inequality diverges, while the right-hand side term remainsbounded. �

Using the same arguments as above, we are also able to prove the following char-acterization for the existence of solution of inequality problem (2) in the case ofunbounded, closed, and convex subsets.

Theorem 3.6 Assume that the same hypotheses as in Theorem 3.4 hold without theassumption of boundedness of K . Then each of the following conditions is sufficientfor inequality problem (2) to admit at least one strong solution (solution):

98 J Optim Theory Appl (2012) 155:79–99

• there exists r0 > 0 and u0 ∈ K−r0

such that ur0 solves (16);• there exists r0 > 0 such that, for each u ∈ K \ Kr0 , we can find v ∈ Kr0 such that

⟨u∗, η(v, u)

⟩ ≤ 0, for all u∗ ∈ A(u);• there exists u ∈ K and a function c : R+ → R+, with the property that

limr→+∞ c(r) = +∞, such that

infu∗∈A(u)

⟨u∗, η(u, u)

⟩ ≥ c(‖u‖)‖u‖, for all u ∈ K.

4 Concluding Remarks

As far as we are aware, variational-like inequalities which involve set-valued mapsthat are either lower semicontinuous or upper semicontinuous have not yet been stud-ied. That is why, to our best knowledge, the present paper is a first contribution in thisdirection. Another main feature of the present work is that we treat also the case ofnonreflexive Banach spaces, while most of the papers we are aware of deal with finitedimensional spaces, Hilbert spaces, or reflexive spaces (see, e.g., [1, 3, 5, 8, 17]).

The reader probably wonders why we have this urge to weaken the monotonicityassumption. The reason is the following: inequality problems of the variational typeare very often used to model mechanical processes which arise in industry and everyday life, and in the modeling of such processes; the monotonicity assumption has noessential physical relevance, being imposed only from mathematical reasons.

We would like to highlight below why we think the results obtained in the presentpaper improve and generalize some known results in the literature. The first general-ization is that we work with set-valued maps as we already pointed out above.

If A is single-valued and φ is the indicator function of the set K , then Theo-rem refVLI-Thm4 supplements Theorem 3.1 in [1] (see Remark 3.1).

If A is single-valued and X = Rn, then Theorem 3.3 improves Theorem 1 in [5]

since we assume that η is continuous only with respect to the second argument andnot with respect to both arguments.

If A is single-valued, then Theorem 3.4 improves Theorem 3.2 in [3] since weassume A is relaxed η-α quasimonotone which is an weaker monotonicity assump-tion than relaxed η-α pseudomonotonicity. We point out the fact that if A is relaxedη-α pseudomonotone, then the KKM principle can be applied directly to obtain theexistence of the solution, while if A is relaxed η-α quasimonotone we cannot applydirectly this tool as it can be seen from the proof of Theorem 3.4. Also, Theorem 3.6improves Theorem 3.3 in [3].

Acknowledgements This work was supported by a grant of the Romanian National Authority for Sci-entific Research, CNCS—UEFISCDI, project number PN-II-RU-PD-2011-3-0032.

We would like to thank the anonymous referees for valuable comments and suggestions which helpedus improve the presentation of the paper.

References

1. Parida, J., Sahoo, M., Kumar, A.: A variational-like inequality problem. Bull. Aust. Math. Soc. 39,225–231 (1989)

J Optim Theory Appl (2012) 155:79–99 99

2. Ahmad, R., Irfan, S.S.: On generalized nonlinear variational-like inequality problems. Appl. Math.Lett. 19, 294–297 (2006)

3. Bai, M.-R., Zhou, S.-Z., Ni, G.-Y.: Variational-like inequalities with relaxed η-α pseudomonotonemappings in Banach spaces. Appl. Math. Lett. 19, 547–554 (2006)

4. Costea, N., Radulescu, V.: Existence results for hemivariational inequalities involving relaxed η-αmonotone mappings. Commun. Appl. Anal. 13, 293–304 (2009)

5. Dien, N.H.: Some remarks on variational-like and quasivariational-like inequalities. Bull. Aust. Math.Soc. 46, 335–342 (1992)

6. Fang, Y.P., Huang, N.J.: Variational-like inequalities with generalized monotone mappings in Banachspaces. J. Optim. Theory Appl. 118, 327–338 (2003)

7. Siddiqi, A.H., Khaiq, A., Ansari, Q.H.: On variational-like inequalities. Ann. Sci. Math. Qué. 18,39–48 (1994)

8. Ansari, Q.H., Yao, J.-C.: Iterative schemes for solving mixed variational-like inequalities. J. Optim.Theory Appl. 108, 527–541 (2001)

9. Lee, C.-H., Ansari, Q.H., Yao, J.-C.: A perturbed algorithm for strongly nonlinear variational-likeinclusions. Bull. Aust. Math. Soc. 62, 417–426 (2000)

10. Fichera, G.: Problemi elettrostatici con vincoli unilaterali: il problema di Signorini con ambigue con-dizioni al contorno. Mem. Acad. Naz. Lincei 7, 91–140 (1964)

11. Browder, F.E.: Nonlinear monotone operators and convex sets in Banach spaces. Bull. Am. Math.Soc. 71(5), 780–785 (1965)

12. Hartman, P., Stampacchia, G.: On some non-linear elliptic differential-functional equations. ActaMath. 112, 271–310 (1966)

13. Lions, J.L., Stampacchia, G.: Variational inequalities. Commun. Pure Appl. Math. 20, 493–519(1967)

14. Giannessi, F., Maugeri, A., Pardalos, P.M. (eds.): Equilibrium Problems: Nonsmooth Optimizationand Variational Inequality Models. Kluwer Academic, Dordrecht (2001)

15. Papageorgiou, N.S., Kyritsi-Yiallourou, S.Th.: Handbook of Applied Analysis. Springer, Dordrecht(2009)

16. Deimling, K.: Nonlinear Functional Analysis. Springer, Berlin (1985)17. Ansari, Q.H., Yao, J.-C.: A fixed point theorem and its applications to a system of variational inequal-

ities. Bull. Aust. Math. Soc. 59, 433–442 (1999)18. Mosco, U.: Implicit variational problems and quasi-variational inequalities. In: Gossez, J.P., Lami

Dozo, E.J., Mawhin, J., Waelbroek, L. (eds.) Nonlinear Operators and the Calculus of Variations.Lecture Notes in Mathematics, vol. 543, pp. 83–156. Springer, Berlin (1976)

19. Fan, K.: Some properties of convex sets related to fixed point theorems. Math. Ann. 266, 519–537(1984)

20. Bianchi, M., Hadjisavvas, N., Schaible, S.: Minimal coercivity conditions and exceptional of elementsin quasimonotone variational inequalities. J. Optim. Theory Appl. 122, 1–17 (2004)

21. Chen, Y.Q.: On the semimonotone operator theory and applications. J. Math. Anal. Appl. 231, 177–192 (1999)

22. Costea, N., Matei, A.: Weak solutions for nonlinear antiplane problems leading to hemivariationalinequalities. Nonlinear Anal., Theory Methods Appl. 72, 3669–3680 (2010)

23. Costea, N., Matei, A.: Contact models leading to variational-hemivariational inequalities. J. Math.Anal. Appl. 386, 647–660 (2012)

24. Costea, N., Radulescu, V.: Hartman–Stampacchia results for stably pseudomonotone operators andnonlinear hemivariational inequalities. Appl. Anal. 89(2), 175–188 (2010)

25. Costea, N., Radulescu, V.: Inequality problems of quasi-hemivariational type involving set-valuedoperators and a nonlinear term. J. Glob. Optim. 52, 743–756 (2012). doi:10.1007/s10898-011-9706-1

26. Karamardian, S., Schaible, S.: Seven kinds of monotone maps. J. Optim. Theory Appl. 66, 37–46(1990)

27. Karamardian, S., Schaible, S., Crouzeix, J.P.: Characterization of generalized monotone maps. J. Op-tim. Theory Appl. 76, 399–413 (1993)

28. Konov, I.V., Schaible, S.: Duality for equilibrium problems under generalized monotonicity. J. Optim.Theory Appl. 104, 395–408 (2000)

29. Brezis, H.: Functional Analysis, Sobolev Spaces and Partial Differential Equations. Springer, NewYork (2011)