• 検索結果がありません。

Well-Posedness of Generalized Vector Quasivariational Inequality Problems

N/A
N/A
Protected

Academic year: 2022

シェア "Well-Posedness of Generalized Vector Quasivariational Inequality Problems"

Copied!
18
0
0

読み込み中.... (全文を見る)

全文

(1)

Volume 2012, Article ID 582792,17pages doi:10.1155/2012/582792

Research Article

Well-Posedness of Generalized Vector Quasivariational Inequality Problems

Jian-Wen Peng and Fang Liu

School of Mathematics, Chongqing Normal University, Chongqing 400047, China

Correspondence should be addressed to Jian-Wen Peng,[email protected] Received 28 October 2011; Accepted 14 December 2011

Academic Editor: Yeong-Cheng Liou

Copyrightq2012 J.-W. Peng and F. Liu. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

We introduce several types of the Levitin-Polyak well-posedness for a generalized vector quasivariational inequality problem with both abstract set constraints and functional constraints.

Criteria and characterizations of these types of the Levitin-Polyak well-posednesses with or without gap functions of generalized vector quasivariational inequality problem are given. The results in this paper unify, generalize, and extend some known results in the literature.

1. Introduction

The vector variational inequality in a finite-dimensional Euclidean space has been introduced in1and applications have been given. Chen and Cheng2studied the vector variational inequality in infinite-dimensional space and applied it to vector optimization problem. Since then, many authors 3–11 have intensively studied the vector variational inequality on different assumptions in infinite-dimensional spaces. Lee et al.12,13, Lin et al.14, Konnov and Yao15, Daniilidis and Hadjisavvas16, Yang and Yao17, and Oettli and Schl¨ager18 studied the generalized vector variational inequality and obtained some existence results.

Chen and Li 19 and Lee et al.20introduced and studied the generalized vector quasi- variational inequality and established some existence theorems.

On the other hand, it is well known that the well-posedness is very important for both optimization theory and numerical methods of optimization problems, which guarantees that, for approximating solution sequences, there is a subsequence which converges to a solution. The study of well-posedness originates from Tykhonov 21 in dealing with unconstrained optimization problems. Its extension to the constrained case was developed by Levitin and Polyak22. The study of generalized Levitin-Polyak well-posedness for convex scalar optimization problems with functional constraints originates from Konsulova and

(2)

Revalski23. Recently, this research was extended to nonconvex optimization problems with abstract set constraints and functional constraintssee24, nonconvex vector optimization problem with abstract set constraints and functional constraints see 25, variational inequality problems with abstract set constraints and functional constraints see 26, generalized inequality problems with abstract set constraints and functional constraints 27, generalized quasi-inequality problems with abstract set constraints and functional constraints 28, generalized vector inequality problems with abstract set constraints and functional constraints 29, and vector quasivariational inequality problems with abstract set constraints and functional constraints 30. For more details on well-posedness on optimizations and related problems, please also see31–37and the references therein. It is worthy noting that there is no study on the Levitin-Polyak well-posedness for a generalized vector quasi-variational inequality problem.

In this paper, we will introduce four types of Levitin-Polyak well-posedness for a generalized vector quasivariational inequality problem with an abstract set constraint and a functional constraint. InSection 2, by virtue of a nonlinear scalarization function and a gap function for generalized vector quasi-varitional inequality problems, we show equivalent relations between the Levitin-Polyak well-posedness of the optimization problem and the Levitin-Polyak well-posedness of generalized vector quasi-varitional inequality problems. In Section 3, we derive some various criteria and characterizations for thegeneralizedLevitin- Polyak well-posedness of the generalized vector quasi-variational inequality problems. The results in this paper unify, generalize, and extend some known results in26–30.

2. Preliminaries

Throughout this paper, unless otherwise specified, we use the following notations and assumptions.

LetX, · be a normed space equipped with norm topology, and letZ, d1be a metric space. LetX1X,KZ be nonempty and closed sets. Let Y be a locally convex space ordered by a nontrivial closed and convex coneCwith nonempty interior intC, that is, y1y2if and only ify2y1Cfor anyy1, y2Y. LetLX, Ybe the space of all the linear continuous operators fromXtoY. LetT:X1 → 2LX,YandS:X1 → 2X1be strict set-valued mappingsi.e.,Tx/∅ andSx/∅, for allxX1, and letg : X1Zbe a continuous vector-valued mapping. We denote byz,x the valuezx, where zLX, Y,xX1. LetX0 {x ∈ X1 : gxK}be nonempty. We consider the following generalized vector quasi-variational inequality problem with functional constraints and abstract set constraints.

FindxX0such thatxSxand there existszTxsatisfying

z, x−x ∈ −/ intC, ∀x∈Sx. GVQVI

Denote byXthe solution set ofGVQVI.

LetZ1, Z2be two normed spaces. A set-valued mapFfromZ1to 2Z2is

iclosed, onZ3Z1, if for any sequence{xn} ⊆Z3withxnxandynFxnwith yny, one hasyFx;

iilower semicontinuousl.s.c. in shortatxZ1, if{xn} ⊆Z1, xnx, andyFx imply that there exists a sequence{yn} ⊆ Z2 satisfyingynysuch thatynFxnforn sufficiently large. IfFis l.s.c. at each point ofZ1, we say thatFis l.s.c. onZ1;

(3)

iiiupper semicontinuousu.s.c. in shortatxZ1, if for any neighborhoodV of Fx, there exists a neighborhoodUofxsuch thatFxV, for allxU. IfFis u.s.c. at each point ofZ1, we say thatFis u.s.c. onZ1.

It is obvious that any u.s.c. nonempty closed-valued mapFis closed.

LetP, dbe a metric space,P1P, andxP. We denote bydP1x inf{dx, p:pP1}the distance from the pointxto the setP1. For a topological vector spaceV, we denote by Vits dual space. For any setΦ⊂V, we denote the positive polar cone ofΦby

Φ{λ∈V:λx≥0, ∀x∈Φ}. 2.1

Lete∈intCbe fixed. Denote

C∗0{λ∈C:λe 1}. 2.2

Definition 2.1. i A sequence {xn} ⊆ X1 is called a type I Levitin-Polyak LP in short approximating solution sequence if there exist{n} ⊆ R1 {r ≥0|r is a real number}with n → 0 andznTxnsuch that

dX0xnn, 2.3

xnSxn, 2.4

zn, xxn ne /∈ −intC, ∀x∈Sxn. 2.5 ii{xn} ⊆ X1 is called a type II LP approximating solution sequence if there exist {n} ⊆ R1with n → 0 andznTxnsuch that2.3–2.5hold, and, for anyzTxn, there existswn, zSxnsatisfying

z, wn, z−xnne∈ −C. 2.6 iii{xn} ⊆ X1 is called a generalized type I LP approximating solution sequence if there exist{n} ⊆R1withn → 0 andznTxnsuch that

dK

gxn

n 2.7

and2.4,2.5hold.

iv{xn} ⊆ X1 is called a generalized type II LP approximating solution sequence if there exist{n} ⊆R1 withn → 0,znTxnsuch that2.4,2.5, and2.7hold, and, for anyzTxn, there existswn, zSxnsuch that2.6holds.

Definition 2.2. GVQVIis said to be type Iresp., type II, generalized type I, generalized type IILP well-posed if the solution setX ofGVQVIis nonempty, and, for any type Iresp., type II, generalized type I, generalized type II LP approximating solution sequence{xn}, there exists a subsequence{xnj}of{xn}andxXsuch thatxnjx.

(4)

Remark 2.3. iIt is clear that anygeneralizedtype II LP approximating solution sequence is ageneralizedtype I LP approximating solution sequence. Thus,generalizedtype I LP well-posedness impliesgeneralizedtype II LP well-posedness.

ii Each type of LP well-posedness ofGVQVI implies that the solution set X is compact.

iiiSuppose thatgis uniformly continuous functions on a set

X1δ0 {x∈X1:dX0x≤δ0}, 2.8 for someδ0 > 0. Then generalized type Iresp., generalized type IILP well-posedness of GVQVIimplies its type Iresp., type IILP well-posedness.

ivIf Y R1,C R1, then type I resp., type II, generalized type I, generalized type II LP well-posedness of GVQVIreduces to type I resp., type II, generalized type I, generalized type II LP well-posedness of the generalized quasi-variational inequality problem defined by Jiang et al.28. If Y R1,C R1,Sx X0 for all xX1, then type Iresp., type II, generalized type I, generalized type IILP well-posedness ofGVQVI reduces to type Iresp., type II, generalized type I, generalized type IILP well-posedness of the generalized variational inequality problem defined by Huang, and Yang27which contains as special cases for the type Iresp., type II, generalized type I, generalized type II LP well-posedness of the variational inequality problem in26.

vIfSx X0for allxX1, then type Iresp., type II, generalized type I, generalized type II LP well-posedness of GVQVIreduces to type I resp., type II, generalized type I, generalized type II LP well-posedness of the generalized vector variational inequality problem defined by Xu et al.29.

viIf the set-valued mapT is replaced by a single-valued mapF, then type Iresp., type II, generalized type I, generalized type IILP well-posedness ofGVQVIreduces to type Iresp., type II, generalized type I, generalized type IILP well-posedness of the vector quasivariational inequality problems defined by Zhang et al.30.

Consider the following statement:

X /∅and for any type I

resp., type II,generalized type I, generalized type II

LP approximating solution sequence{xn}, we have dXxn−→0

.

2.9

Proposition 2.4. If GVQVIis type I (resp., type II, generalized type I, generalized type II) LP well- posed, then2.9holds. Conversely if 2.9holds andX is compact, then (1) is type I (resp., type II, generalized type I, generalized type II) LP well-posed.

The proof ofProposition 2.4is elementary and thus omitted.

To see the various LP well-posednesses of1are adaptations of the corresponding LP well-posednesses in minimizing problems by using the Auslender gap function, we consider the following general constrained optimization problem:

min fx

s.t. x∈X1 gxK,

P

(5)

whereX1X1is nonempty and f :X1R1∪ {∞}is proper. The feasible set ofP isX0, whereX0 {x∈X1:gxK}. The optimal set and optimal value ofPare denoted byXandv, respectively. Note that if DomfX0/∅, where

Dom f

xX1 :fx<, 2.10

thenv <∞. In this paper, we always assume thatv >−∞.

Definition 2.5. iA sequence{xn} ⊆X1 is called a type I LP minimizing sequence forPif lim sup

n→ ∞ fxnv, 2.11

dX0xn−→0. 2.12

ii{xn} ⊆X1 is called a type II LP minimizing sequence forPif

nlim→ ∞fxn v 2.13

and2.12hold.

iii{xn} ⊆X1 is called a generalized type I LP minimizing sequence forPif dK

gxn

−→0 2.14

and2.11hold.

iv{xn} ⊆X1is called a generalized type II LP minimizing sequence forPif2.13 and2.14hold.

Definition 2.6. P is said to be type I resp., type II, generalized type I, generalized type IILP well-posed if the solution set Xof Pis nonempty, and for any type I resp., type II, generalized type I, generalized type II LP minimizing sequence {xn}, there exists a subsequence{xnj}of{xn}andxXsuch thatxnjx.

The Auslender gap function forGVQVIis defined as follows:

fx inf

z∈Tx sup

x∈Sxinf

λ∈C∗0λ

z, xx

, ∀x∈X1. 2.15

LetX2Xbe defined by

X2{x∈X|xSx}. 2.16

In the rest of this paper, we setX1 inPequal toX1X2. Note that ifSis closed on X1, thenX1is closed.

Recall the following widely used functionsee, e.g.,38 ξ:Y −→R1: min

tR1:yte∈ −C

. 2.17

(6)

It is known that ξ is a continuous, strictly monotone i.e., for any y1, y2Y, y1y2C implies that ξy1ξy2 and y1y2 ∈ intC implies that ξy1 > ξy2, subadditive and convex function. Moreover, it holds that ξte t,for alltR1 and ξy supλ∈C∗0λy,for allyY.

Now we given some properties for the functionfdefined by2.15.

Lemma 2.7. Let the functionfbe defined by2.15, and let the set-valued mapT be compact-valued onX1. Then

ifx≥0, for allxX1;

iifor anyxX0,fx 0 if and only ifxX.

Proof. iLetxX1. Suppose to the contrary thatfx < 0. Then, there exists aδ > 0 such thatfx<−δ. By definition, forδ/2>0, there exists azTx, such that

sup

x∈Sxinf

λ∈C∗0λ

z, xx

fx δ 2 <δ

2 <0. 2.18

Thus, we have

λ∈Cinf∗0λ

z, xx

<0, ∀xSx, 2.19

which is impossible whenxx. This provesi.

iiSuppose thatxX0such thatfx 0.

Then, it follows from the definition ofX0 thatxSx. And from the definition of fxwe know that there existznTxand 0< n → 0 such that

λ∈Cinf∗0λ

zn, xx

fx nn, ∀xSx, 2.20

that is,

ξ

zn, xx

≥ −n, ∀xSx. 2.21

By the compactness ofTx, there exists a sequence{znj}of{zn}and somezTxsuch that

znj −→z. 2.22

This fact, together with the continuity ofξand2.21, implies that ξ

z, xx

≥0, ∀xSx. 2.23

It follows thatxX.

(7)

Conversely, assume that xX. It follows from the definition of X thatxSx.

Suppose to the contrary thatfx>0. Then, for anyzTx, sup

x∈Sx λ∈Cinf∗0λ

z, xx

>0. 2.24

Thus, there existδ >0 andx0Sxsuch that

λ∈Cinf∗0λz, xx0δ. 2.25 It follows that

ξz, x0x ≤ −δ <0. 2.26

As a result, we have

z, x0x ∈ −intC. 2.27

This contradicts the fact thatxX. So,fx 0. This completes the proof.

Lemma 2.8. Letf be defined by2.15. Assume that the set-valued mapT is compact-valued and u.s.c. onX1and the set-valued mapSis l.s.c. onX1. Thenfis l.s.c. function fromX1toR1∪ {∞}.

Further assume that the solution setXofGVQVIis nonempty, then Domf/∅.

Proof. First we show thatfx>−∞, for allxX1. Suppose to the contrary that there exists x0X1 such thatfx0 −∞. Then, there existznTx0and{Mn} ⊂R1withMn → ∞ such that

sup

x∈Sx0 λ∈Cinf∗0λ

zn, x0x

≤ −Mn. 2.28

Thus,

ξ

zn, xx0

Mn, ∀xSx0. 2.29

By the compactness ofTx0, there exist a sequence{znj} ⊂ {zn}and somez0Tx0such thatznjz0. This fact, together with2.29and the continuity ofξonY, implies that

ξ

z0, xx0

≥∞, ∀xSx0 2.30

which is impossible, sinceξis a finite function onY.

Second, we show thatf is l.s.c. onX1. LetaR1. Suppose that{xn} ⊂ X1 satisfies fxna,for alln, andxnx0X1. It follows that, for eachn, there existznTxnand 0< δn → 0 such that

−ξ

zn, yxn

n, ∀y∈Sxn. 2.31

(8)

For any xSx0, by the l.s.c. of S, we have a sequence{yn} with {yn} ∈ Sxn converging toxsuch that

−ξ

zn, ynxn

n. 2.32

By the u.s.c. ofTatx0and the compactness ofTx0, we obtain a subsequence{znj}of {zn}and somez0Tx0such thatznjz0. Taking the limit in2.32 withnreplaced by nj, by the continuity ofξ, we have

−ξ

z0, xx0

a, ∀xSx0. 2.33

It follows thatfx0 infz∈Tx0supx∈Sx0ξz, xx0a. Hence,f is l.s.c. onX1. Furthermore, ifX /∅, byLemma 2.7, we see that Domf/∅.

Lemma 2.9. Let the functionfbe defined by2.15, and let the set-valued mapT be compact-valued onX1. Then,

i{xn} ⊆ X1is a sequence such that there exist{n} ⊆ R1 withn0 andznTxn satisfying2.4and2.5if and only if{xn} ⊆X1 and2.11hold withv0,

ii{xn} ⊆ X1 is a sequence such that there exist{n} ⊆ R1with n0 andznTxn satisfying2.4and2.5, and for anyzTxn, there existswn, zSxnsatisfying 2.6if and only if{xn} ⊆X1 and2.13hold withv0.

Proof. iLet{xn} ⊆X1be any sequence if there exist{n} ⊆R1withn → 0 andznTxn satisfying2.4and2.5, then we can easily verify that

{xn} ⊆X1, fxnn. 2.34 It follows that2.11holds withv0.

For the converse, let{xn} ⊆X1 and2.11hold withv0. We can see that{xn} ⊆X1 and2.4hold. Furthermore, by2.11, we have that there exists{n} ⊆R1 with n → 0 such thatfxnn. By the compactness ofTxn, we see that for everynthere existsznTxn such that

ξ

zn, xxn

≥ −n, ∀xSxn. 2.35

It follows that for everynthere existsznTxnsuch that2.5holds.

iiLet{xn} ⊆X1be any sequence we can verify that lim inf

n→ ∞ fxn≥0 2.36

holds if and only if there exists{αn} ⊆R1 withαn → 0 and, for anyzTxn, there exists wn, zSxnsuch that

z, wn, z−xnαne∈ −C. 2.37

(9)

From the proof ofi, we know that lim supn→ ∞fxn≤0 and{xn} ⊆X1hold if and only if{xn} ⊆X1such that there exist{βn} ⊆R1withβn → 0znTxnsatisfying2.4and 2.5 withnreplaced byβn. Finally, we letnmax{αn, βn}and the conclusion follows.

Proposition 2.10. Assume thatX /andT is compact-valued onX1. Then

i GVQVIis generalized type I (resp., generalized type II) LP well-posed if and only if P is generalized type I (resp., generalized type II) LP well-posed withfxdefined by2.15.

iiIf GVQVIis type I (resp., type II) LP well-posed, thenPis type I (resp., type II) LP well-posed withfxdefined by2.15.

Proof. Letfxbe defined by2.15. SinceX /Ø, it follows fromLemma 2.7thatxXis a solution ofGVQVIif and only ifxis an optimal solution of5withvfx 0.

iSimilar to the proof ofLemma 2.9, it is also routine to check that a sequence{xn}is a generalized type Iresp., generalized type IILP approximating solution sequence if and only if it is a generalized type Iresp., generalized type IILP minimizing sequence ofP. SoGVQVIis generalized type I resp., generalized type IILP well-posed if and only if Pis generalized type Iresp., generalized type II LP well-posed withfxdefined by2.15.

iiSince X0X0, dX0x ≤ dX0x for any x. This fact together with Lemma 2.9 implies that a type Iresp., type IILP minimizing sequence ofPis a type Iresp., type IILP approximating solution sequence. So the type Iresp., type IILP well- posedness ofGVQVIimplies the type Iresp., type IILP well-posedness ofP withfxdefined by2.15.

3. Criteria and Characterizations for Generalized LP Well-Posedness of (GVQVI)

In this section, we shall present some necessary and/or sufficient conditions for the various types ofgeneralizedLP well-posedness ofGVQVIdefined inSection 2.

Now consider a real-valued function c ct, s, rdefined for t, s, r ≥ 0 sufficiently small, such that

ct, s, r≥0, ∀t, s, r, c0,0,0 0,

sn−→0, tn≥0, rn0, ctn, sn, rn−→0 imply thattn−→0,

3.1

Theorem 3.1. Let the set-valued mapT be compact-valued onX1. If GVQVIis type II LP well- posed, the set-valued mapSis closed-valued, then there exist a functioncsatisfying3.1such that

fxc

dXx, dX0x, dSxx

, ∀x∈X1, 3.2

wherefxis defined by2.15. Conversely, suppose thatXis nonempty and compact and3.2holds for somecsatisfying3.1. ThenGVQVIis type II LP well-posed.

(10)

Proof. Define

ct, s, r inffx:xX1, dXx t, dX0x s, dSxx r . 3.3 Since X /Ø, it is obvious that c0,0,0 0. Moreover, if sn → 0, tn ≥ 0, rn 0, and ctn, sn, rn → 0, then there exists a sequence{xn} ⊆X1withdXxn tn,dSxnxn rn0,

dX0xn sn−→0, 3.4

such that

fxn−→0. 3.5 SinceS is closed-valued, xnSxnfor any n. This fact, combined with3.4and 3.5andLemma 2.9iiimplies that{xn}is a type II LP approximating solution sequence of GVQVI. ByProposition 2.4, we have thattn → 0.

Conversely, let {xn} be a type II LP approximating solution sequence ofGVQVI.

Then, by3.2, we have

fxnc

dXxn, dX0xn, dSxnxn

. 3.6

Let

tndXxn, sndX0xn, rn dSxnxn. 3.7 Then sn → 0 and rn 0, for all nN. Moreover, by Lemma 2.9, we have that

|fx| → 0. Then,ctn, sn, rn → 0. These facts together with the properties of the functionc imply thattn → 0. ByProposition 2.4, we see thatGVQVIis type II LP well-posed.

Theorem 3.2. Let the set-valued mapT be compact-valued onX1. If GVQVIis generalized type II LP well-posed, the set-valued mapSis closed, then there exist a functioncsatisfying3.1such that

fxc

dXx, dK

gx

, dSxx

, ∀x∈X1, 3.8

wherefxis defined by2.15. Conversely, suppose thatXis nonempty and compact and3.8holds for somecsatisfying3.4and3.5. Then,GVQVIis generalized type II LP well-posed.

Proof. The proof is almost the same as that ofTheorem 3.1. The only difference lies in the proof of the first part ofTheorem 3.1. Here we define

ct, s, r inffx:xX1, dXx t, dK

gx

s, dSxx r . 3.9 Next we give the Furi-Vignoli-type characterizations39for thegeneralizedtype I LP well-posedness ofGVQVI.

(11)

LetX,·be a Banach space. Recall that the Kuratowski measure of noncompactness for a subsetHofXis defined as

μH inf

>0 :H

Hi,diamHi< , i1, . . . , n

, 3.10

where diamHiis the diameter ofHidefined by

diamHi sup{x1x2:x1, x2Hi}. 3.11

Given two nonempty subsets A and B of a Banach space X, · , the Hausdorff distance between A and B is defined by

hA, B max

sup{dBa:aA},sup{dAb:bB} . 3.12 For any ≥ 0, two types of approximating solution sets for GVQVI are defined, respectively, by

Ω1

xX1:xSx, dX0x≤,∃z∈Tx,s.t.

z, xx

e /∈ −intC, ∀xSx , Ω2

xX1:xSx, dK

gx

,∃z∈Tx,s.t.

z, xx

e /∈ −intC, ∀xSx . 3.13

Theorem 3.3. Assume thatT is u.s.c. and compact-valued onX1andS is l.s.c. and closed on X1. Then

a GVQVIis type I LP well-posed if and only if

lim0μΩ1 0, 3.14

b GVQVIis generalized type I LP well-posed if and only if

lim0μΩ2 0. 3.15

Proof. aFirst we show that, for every > 0, Ω1 is closed. In fact, letxn ∈ Ω1and xnx0. Then2.4and the following formula hold:

dX0xn,

∃znTxn, s.t.

zn, xxn

e /∈ −intC, ∀xSxn. 3.16

Sincexnx0, by the closedness ofSand2.4, we havex0Sx0. From3.16, we get

dX0x0, 3.17

∃znTxn, s.t. ξ

zn, xxn

≥ −, ∀xSxn. 3.18

(12)

For anyvSx0, by the lower semi-continuity ofSand3.18, we can findvnSxnwith vnvsuch that

ξzn, vnxn ≥ −. 3.19

By the u.s.c. ofTatx0and the compactness ofTx0, there exist a subsequence{znj} ⊂ {zn}and somez0Tx0such that

znj −→z0. 3.20

This fact, together with the continuity ofξand3.19, implies that

ξz0, vx0 ≥ − ∀v∈Sx0. 3.21

It follows that

z0, vx0 e /∈ −intC ∀v∈Sx0. 3.22 Hence,x0∈Ω1.

Second, we show thatX

>0Ω1. It is obvious thatX

>0Ω1. Now suppose thatn>0 withn → 0 andx

>0Ω1n. Then

dX0xn, ∀n, 3.23

xSx, 3.24

∃z∈Tx, s.t.z, xx ne /∈ −intC, ∀xSx. 3.25

From3.23, we have

xX0. 3.26

From3.25, we have

z, xx

∈ −/ intC, ∀xSx, 3.27 that isxX. Hence,X

>0Ω1.

Now we assume thatGVQVIis type I LP well-posed. ByRemark 2.3, we know that the solutionXis nonempty and compact. For every positive real number, sinceX∈Ω1, one gets

Ω1/∅, h

Ω1, X max

sup

u∈Ω1dXu,sup

v∈X

dΩ1v

sup

u∈Ω1dXu. 3.28

(13)

For everynN, the following relations hold:

μΩ1≤2h

Ω1, X μ

X 2h

Ω1, X

, 3.29

whereμX 0 sinceX is compact. Hence, in order to prove that lim0μΩ1 0, we only need to prove that

lim0h

Ω1, X lim

0 sup

u∈Ω1

dXu 0. 3.30

Suppose that this is not true, then there exist β > 0, n → 0, and sequence {un}, un∈Ω1n, such that

dXun> β, 3.31

fornsufficiently large.

Since{un}is type I LP approximating sequence forGVQVI, it contains a subsequence {unk}conversing to a point ofX, which contradicts3.31.

For the converse, we know that, for every >0, the setΩ1is closed,X

>0Ω1, and lim

→0μΩ1 0. The theorem on Page. 412 in40,41can be applied, and one concludes that the setXis nonempty, compact, and

lim→0h

Ω1, X

0. 3.32

If{xn}is type I LP approximating sequence forGVQVI, then there exists a sequence {n}of positive real numbers decreasing to 0 such thatxn∈Ω1n, for everynN. SinceX is compact and

nlimdXxn≤ lim

n→∞h

Ω1n, X

0, 3.33

byProposition 2.4,GVQVIis type I LP well-posed.

bThe proof is Similar to that ofa, and it is omitted here. This completes the proof.

Definition 3.4. i LetZbe a topological space, and let Z1Zbe nonempty. Suppose that h:ZR1∪ {∞}is an extended real-valued function.his said to be level-compact onZ1

if, for anysR1, the subset{z∈Z1:hzs}is compact.

ii Let X be a finite-dimensional normed space, and let Z1Z be nonempty. A functionh:ZR1∪ {∞}is said to be level-bounded onZ1ifZ1is bounded or

z∈Z1,z →∞lim hz ∞. 3.34

Now we establish some sufficient conditions for type Iresp., generalized I typeLP well-posedness ofGVQVI.

(14)

Proposition 3.5. Suppose that the solution setXof GVQVIis nonempty and set-valued mapSis l.s.c. and closed onX1, the set-valued map T is u.s.c. and compact-valued onX1. Suppose that one of the following conditions holds:

(i) there exists 0< δ1δ0such thatX1δ1is compact, where

X1δ1 {x∈X1X2 :dX0x≤δ1}; 3.35 (ii) the functionfdefined by2.15is level-compact onX1X2;

(iii)Xis finite-dimensional and

x∈X1∩Xlim2,x →∞max

fx, dX0x ∞, 3.36

wherefis defined by2.15;

(iv) there exists 0< δ1δ0such thatf is level-compact onX1δ1defined by3.35. Then GVQVIis type I LP well-posed.

Proof. First, we show that each ofi,ii, andiiiimpliesiv. Clearly, either ofiandii impliesiv. Now we show thatiiiimpliesiv. Indeed, we need only to show that, for any tR1, the set

A

xX1δ1:fxt 3.37

is bounded sinceXis finite-dimensional space and the functionfdefined by2.15is l.s.c. on X1 and thusAis closed. Suppose to the contrary that there existstR1and{xn} ⊆X1δ1 such thatxn → ∞andfxnt. From{xn} ⊆X1δ1, we havedX0xnδ1.

Thus,

max f

xn , dX0

xn ≤max{t, δ1}, 3.38

which contradicts3.36.

Therefore, we only need to we show that ifivholds, thenGVQVIis type I LP well- posed. Let{xn}be a type I LP approximating solution sequence forGVQVI. Then, there exist{n} ⊆R1withn → 0 andznTxnsuch that2.3,2.4, and2.5hold. From2.3 and2.4, we can assume without loss of generality that{xn} ⊆ X1δ1. ByLemma 2.9, we can assume without loss of generality that{xn} ⊆ {x ∈ X1δ1 : fx ≤ 1}. By the level- compactness off onX1δ1, we can find a subsequence {xnj}of{xn}andxX1δ1such thatxnjx. Taking the limit in2.3 withxnreplaced byxnj, we havexX0. SinceSis closed and2.4holds, we also havexSx.

Furthermore, from the u.s.c. ofT at xand the compactness ofTx, we deduce that there exist a subsequence{znj}of{zn}and somezTxsuch thatznjz. From this fact, together with2.5, we have

z, xx

∈ −/ intC, ∀xSx. 3.39 Thus,xX.

The next proposition can be proved similarly.

(15)

Proposition 3.6. Suppose that the solution setXof GVQVIis nonempty and set-valued mapSis l.s.c. and closed onX1, the set-valued map T is u.s.c. and compact-valued onX1. Suppose that one of the following conditions holds:

(i) there exists 0< δ1δ0such thatX2δ1is compact, where X2δ1

xX1X2 :dK

gx

δ1 ; 3.40

(ii) the functionfdefined by2.15is level-compact onX1X2; (iii)Xis finite-dimension and

x∈X1∩Xlim2,x →∞ max

fx, dKgx ∞, 3.41

wherefis defined by2.15,

(iv) there exists 0< δ1δ0such thatf is level-compact onX2δ1defined by3.40. Then GVQVIis generalized type II LP well-posed.

Remark 3.7. IfXis finite-dimensional, then the “level-compactness” condition in Propositions 3.1 and3.6can be replaced by “level boundedness” condition.

Remark 3.8. It is easy to see that the results in this paper unify, generalize and extend the main results in26–30and the references therein.

Acknowledgments

This research was supported by the National Natural Science Foundation of ChinaGrant no. 11171363 and Grant no. 10831009, the Natural Science Foundation of Chongqing Grant No. CSTC, 2009BB8240and the special fund of Chongqing Key LaboratoryCSTC 2011KLORSE01.

References

1 F. Giannessi, “Theorems of alternative, quadratic programs and complementarity problems,” in Variational Inequalities and Complementarity Problems, R. W. Cottle, F. Giannessi, and J. L. Lions, Eds., pp. 151–186, John Wiley & Sons, New York, NY, USA, 1980.

2 G. Y. Chen and G. M. Cheng, “Vector variational inequalities and vector optimization,” in Lecture Notes in Economics and Mathematical Systems, vol. 285, pp. 408–456, 1987.

3 G. Y. Chen, “Existence of solutions for a vector variational inequality: an extension of the Hartmann- Stampacchia theorem,” Journal of Optimization Theory and Applications, vol. 74, no. 3, pp. 445–456, 1992.

4 G. Y. Chen and X. Q. Yang, “The vector complementary problem and its equivalences with the weak minimal element in ordered spaces,” Journal of Mathematical Analysis and Applications, vol. 153, no. 1, pp. 136–158, 1990.

5 G.-Y. Chen and B. D. Craven, “Approximate dual and approximate vector variational inequality for multiobjective optimization,” Journal of the Australian Mathematical Society A, vol. 47, no. 3, pp. 418–

423, 1989.

6 G.-Y. Chen and B. D. Craven, “A vector variational inequality and optimization over an efficient set,”

Zeitschrift f ¨ur Operations Research. Mathematical Methods of Operations Research, vol. 34, no. 1, pp. 1–12, 1990.

7 A. H. Siddiqi, Q. H. Ansari, and A. Khaliq, “On vector variational inequalities,” Journal of Optimization Theory and Applications, vol. 84, no. 1, pp. 171–180, 1995.

(16)

8 X. Q. Yang, “Vector complementarity and minimal element problems,” Journal of Optimization Theory and Applications, vol. 77, no. 3, pp. 483–495, 1993.

9 X. Q. Yang, “Vector variational inequality and its duality,” Nonlinear Analysis: Theory, Methods &

Applications A, vol. 21, no. 11, pp. 869–877, 1993.

10 X. Q. Yang, “Generalized convex functions and vector variational inequalities,” Journal of Optimization Theory and Applications, vol. 79, no. 3, pp. 563–580, 1993.

11 S. J. Yu and J. C. Yao, “On vector variational inequalities,” Journal of Optimization Theory and Applications, vol. 89, no. 3, pp. 749–769, 1996.

12 G. M. Lee, D. S. Kim, B. S. Lee, and S. J. Cho, “Generalized vector variational inequality and fuzzy extension,” Applied Mathematics Letters, vol. 6, no. 6, pp. 47–51, 1993.

13 G. M. Lee, D. S. Kim, and B. S. Lee, “Generalized vector variational inequality,” Applied Mathematics Letters, vol. 9, no. 1, pp. 39–42, 1996.

14 K. L. Lin, D.-P. Yang, and J. C. Yao, “Generalized vector variational inequalities,” Journal of Optimization Theory and Applications, vol. 92, no. 1, pp. 117–125, 1997.

15 I. V. Konnov and J. C. Yao, “On the generalized vector variational inequality problem,” Journal of Mathematical Analysis and Applications, vol. 206, no. 1, pp. 42–58, 1997.

16 A. Daniilidis and N. Hadjisavvas, “Existence theorems for vector variational inequalities,” Bulletin of the Australian Mathematical Society, vol. 54, no. 3, pp. 473–481, 1996.

17 X. Q. Yang and J. C. Yao, “Gap functions and existence of solutions to set-valued vector variational inequalities,” Journal of Optimization Theory and Applications, vol. 115, no. 2, pp. 407–417, 2002.

18 W. Oettli and D. Schl¨ager, “Existence of equilibria for monotone multivalued mappings,” Mathematical Methods of Operations Research, vol. 48, no. 2, pp. 219–228, 1998.

19 G. Y. Chen and S. J. Li, “Existence of solutions for a generalized vector quasivariational inequality,”

Journal of Optimization Theory and Applications, vol. 90, no. 2, pp. 321–334, 1996.

20 G. M. Lee, B. S. Lee, and S.-S. Chang, “On vector quasivariational inequalities,” Journal of Mathematical Analysis and Applications, vol. 203, no. 3, pp. 626–638, 1996.

21 A. N. Tykhonov, “On the stability of the functional optimization problem,” Computational Mathematics and Mathematical Physics, vol. 6, pp. 28–33, 1966.

22 E. S. Levitin and B. T. Polyak, “Convergence of minimizing sequences in conditional extremum problem,” Soviet Mathematics Doklady, vol. 7, pp. 764–767, 1966.

23 A. S. Konsulova and J. P. Revalski, “Constrained convex optimization problems—well-posedness and stability,” Numerical Functional Analysis and Optimization, vol. 15, no. 7-8, pp. 889–907, 1994.

24 X. X. Huang and X. Q. Yang, “Generalized Levitin-Polyak well-posedness in constrained optimiza- tion,” SIAM Journal on Optimization, vol. 17, no. 1, pp. 243–258, 2006.

25 X. X. Huang and X. Q. Yang, “Levitin-Polyak well-posedness of constrained vector optimization problems,” Journal of Global Optimization, vol. 37, no. 2, pp. 287–304, 2007.

26 X. X. Huang, X. Q. Yang, and D. L. Zhu, “Levitin-Polyak well-posedness of variational inequality problems with functional constraints,” Journal of Global Optimization, vol. 44, no. 2, pp. 159–174, 2009.

27 X. X. Huang and X. Q. Yang, “Levitin-Polyak well-posedness in generalized variational inequality problems with functional constraints,” Journal of Industrial and Management Optimization, vol. 3, no. 4, pp. 671–684, 2007.

28 B. Jiang, J. Zhang, and X. X. Huang, “Levitin-Polyak well-posedness of generalized quasivariational inequalities with functional constraints,” Nonlinear Analysis: Theory, Methods & Applications A, vol. 70, no. 4, pp. 1492–1503, 2009.

29 Z. Xu, D. L. Zhu, and X. X. Huang, “Levitin-Polyak well-posedness in generalized vector variational inequality problem with functional constraints,” Mathematical Methods of Operations Research, vol. 67, no. 3, pp. 505–524, 2008.

30 J. Zhang, B. Jiang, and X. X. Huang, “Levitin-Polyak well-posedness in vector quasivariational inequality problems with functional constraints,” Fixed Point Theory and Applications, vol. 2010, Article ID 984074, 16 pages, 2010.

31 Y.-P. Fang, N.-J. Huang, and J.-C. Yao, “Well-posedness by perturbations of mixed variational inequalities in Banach spaces,” European Journal of Operational Research, vol. 201, no. 3, pp. 682–692, 2010.

32 L. Q. Anh, P. Q. Khanh, D. T. M. Van, and J.-C. Yao, “Well-posedness for vector quasiequilibria,”

Taiwanese Journal of Mathematics, vol. 13, no. 2, pp. 713–737, 2009.

33 L. C. Ceng, N. Hadjisavvas, S. Schaible, and J. C. Yao, “Well-posedness for mixed quasivariational-like inequalities,” Journal of Optimization Theory and Applications, vol. 139, no. 1, pp. 109–125, 2008.

(17)

34 L.-H. Peng, C. Li, and J.-C. Yao, “Well-posedness of a class of perturbed optimization problems in Banach spaces,” Journal of Mathematical Analysis and Applications, vol. 346, no. 2, pp. 384–394, 2008.

35 L. C. Ceng and J. C. Yao, “Well-posedness of generalized mixed variational inequalities, inclusion problems and fixed-point problems,” Nonlinear Analysis: Theory, Methods & Applications A, vol. 69, no.

12, pp. 4585–4603, 2008.

36 Y.-P. Fang, N.-J. Huang, and J.-C. Yao, “Well-posedness of mixed variational inequalities, inclusion problems and fixed point problems,” Journal of Global Optimization, vol. 41, no. 1, pp. 117–133, 2008.

37 A. Petrus¸el, I. A. Rus, and J.-C. Yao, “Well-posedness in the generalized sense of the fixed point problems for multivalued operators,” Taiwanese Journal of Mathematics, vol. 11, no. 3, pp. 903–914, 2007.

38 D. T. Luc, Theory of Vector Optimization, vol. 319 of Lecture Notes in Economics and Mathematical Systems, Springer, Berlin, Germany, 1989.

39 M. Furi and A. Vignoli, “About well-posed minimization problems for functionals in metric space,”

Journal of Optimization Theory and Applications, vol. 5, pp. 225–229, 1970.

40 K. Kuratowski, Topology, vol. 1, Academic Press, New York, NY, USA, 1966.

41 K. Kuratowski, Topology, vol. 2, Academic Press, New York, NY, USA, 1968.

(18)

Submit your manuscripts at http://www.hindawi.com

Hindawi Publishing Corporation

http://www.hindawi.com Volume 2014

Mathematics

Journal of

Hindawi Publishing Corporation

http://www.hindawi.com Volume 2014

in Engineering

Hindawi Publishing Corporation http://www.hindawi.com

Differential Equations

International Journal of

Volume 2014

Applied MathematicsJournal of

Hindawi Publishing Corporation

http://www.hindawi.com Volume 2014

Probability and Statistics

Hindawi Publishing Corporation

http://www.hindawi.com Volume 2014

Journal of

Hindawi Publishing Corporation

http://www.hindawi.com Volume 2014

Mathematical PhysicsAdvances in

Complex Analysis

Journal of

Hindawi Publishing Corporation

http://www.hindawi.com Volume 2014

Optimization

Journal of

Hindawi Publishing Corporation

http://www.hindawi.com Volume 2014

Combinatorics

Hindawi Publishing Corporation

http://www.hindawi.com Volume 2014

International Journal of

Hindawi Publishing Corporation

http://www.hindawi.com Volume 2014

Operations Research

Journal of

Hindawi Publishing Corporation

http://www.hindawi.com Volume 2014

Function Spaces

Abstract and Applied Analysis

Hindawi Publishing Corporation

http://www.hindawi.com Volume 2014

International Journal of Mathematics and Mathematical Sciences

Hindawi Publishing Corporation

http://www.hindawi.com Volume 2014

The Scientific World Journal

Hindawi Publishing Corporation

http://www.hindawi.com Volume 2014

Hindawi Publishing Corporation

http://www.hindawi.com Volume 2014

Algebra

Discrete Dynamics in Nature and Society

Hindawi Publishing Corporation

http://www.hindawi.com Volume 2014

Hindawi Publishing Corporation

http://www.hindawi.com Volume 2014

Decision Sciences

Discrete Mathematics

Journal of

Hindawi Publishing Corporation

http://www.hindawi.com Volume 2014

Hindawi Publishing Corporation

http://www.hindawi.com Volume 2014

Stochastic Analysis

International Journal of

参照

関連したドキュメント

In addition, the corresponding concepts of extended well-posedness in the generalized sense are introduced and investigated for quasivariational inequalities having more than

Hiriart-Urruty, From Convex Optimization to Nonconvex Optimization, Nec- essary and Sufficient Conditions for Global Optimization, Nonsmooth Optimization and Related Topics, Plenum

In this paper, we analyze gradient methods for minimization problems arising in the regularization of nonlinear inverse problems with sparsity constraints.. In particular, we study

M AASS , A generalized conditional gradient method for nonlinear operator equations with sparsity constraints, Inverse Problems, 23 (2007), pp.. M AASS , A generalized

Qi, “Global convergence of the Polak-Ribi`ere-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems,” Mathematics

Qi, “Global convergence of the Polak-Ribi`ere-Polyak conjugate gradient method with an Armijo-type inexact line search for nonconvex unconstrained optimization problems,” Mathematics

It seems that in our scalar case the attainment is closely related through the Bauer extremal principle [4] with the structure of extreme points of the set of admissible pairs (u,

Since we relate the existence of a solution for Problem (FB) to the existence of a minimum of some shape optimiza- tion problem, it is natural to solve this one in a class of