Research

# Vectorial form of Ekeland-type variational principle

Kanokwan Sitthithakerngkiet and Somyot Plubtieng*

Author Affiliations

Department of Mathematics, Faculty of Science, Naresuan University, Phitsanulok, 65000, Thailand

For all author emails, please log on.

Fixed Point Theory and Applications 2012, 2012:127 doi:10.1186/1687-1812-2012-127

 Received: 22 April 2012 Accepted: 18 July 2012 Published: 2 August 2012

This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

### Abstract

In this paper, we deal with a vectorial form of Ekeland-type variational principle for multivalued bioperator whose domain is a complete metric space and its range is a subset of a locally convex Hausdorff topological space. From this theorem, Caristi-Kirk fixed point theorem for multivalued maps is established in a more general setting and our techniques allow us to improve and to extend their results in (Ansari in J. Math. Anal. Appl. 335: 561-575, 2007; Bednarczuk and Zagrodny in Arch. Math. 93: 577-586, 2009; Bianchi, Kassay and Pini in J. Math. Anal. Appl. 305: 502-512, 2005).

MSC: 49K30, 90C29.

##### Keywords:
vector variational principle; countably orderable sets; Ekeland’s variational principle

### 1 Introduction

It is well known that Ekeland’s variational principle (for short, EVP), a very important result first presented by Ekeland [10] in 1974, is as follows:

Theorem 1.1 (Ekeland [10,11])

LetXbe a complete metric space with a metricd. Letfbe a function fromXinto ( , + ] which is proper lower semicontinuous and bounded from below. Then for u X and λ > 0 , there exists v X such that

(i) f ( v ) f ( u ) λ d ( u , v ) ,

(ii) f ( w ) > f ( v ) λ d ( v , w ) for every w v .

It is well known that the primitive EVP is a powerful tool on many applications in optimization, nonlinear analysis, mathematical economy and mathematical programming. Moreover, EVP is equivalent to the Caristis fixed point theorem [5,8] and nonconvex minimization theorem according to Takahashi [21]. The studies of several forms of Ekeland’s variational principle for vector valued functions were obtained by many authors, for instance, Nemeth [20], Tammer [22] and Isac [16,17].

To begin with, let X be a (real) linear space, E be a (real) topological vector space, K be a cone in E and e , f : X E , be two mappings. Under mild conditions of f and e, Nemeth [20] got the conclusion that for ε > 0 and y X there exists a z X such that

(i) ( f ( z ) f ( y ) + ε e ( z y ) ) K ,

(ii) ( f ( w ) f ( z ) + ε e ( w z ) ) K c ; whenever e ( w z ) 0 ,

where K c is a complement of K.

Next, let Y be a topological vector space, K X , X be a real Banach space and f : X Y . Tammer [22] showed that under mild assumptions on f and K, for ε > 0 , there exists an x K such that

(i) f ( x ) f ( x ε ) + ε c 0 D { 0 } , x K ,

(ii) x ε x 0 ε ,

(iii) f ( x ) f ( x ε ) + ε x x ε c 0 D { 0 } , x K ,

where x 0 is a weakly e-minimal solution of f on K and c 0 Y { 0 } .

On the other hand, by assuming that ( X , d ) is a complete metric space, Y is a locally convex Hausdorff space and C Y is a normal cone, Isac [16] proved that for ε > 0 and x X satisfying mild conditions, there exists λ > 0 and x X such that

(i) f ( x ) C f ( x ) ,

(ii) d ( x , x ) λ ,

(iii) f ( x ) f ( x ) + ε / λ d ( x , x ) c 0 ≰ C 0 , x X { x } ,

where c 0 C { 0 } .

Recently, there have been many new formulation cases of EVP in [1-3,6,7]. In 2007, a generalization of the Ekeland-type variational principle for vector valued functions in the setting of complete quasi-metric spaces with ω-distance was introduced by Ansari [2]. Let ( X , d ) be a complete quasi-metric space, C be a proper, closed and convex cone in a locally convex Hausdorff topological vector space Y. F : X × X Y satisfies mild conditions. For every ε > 0 and x 0 X , there exists x ¯ X such that

(i) F ( x 0 , x ¯ ) + ε ω ( x 0 , x ¯ ) e C ,

(ii) F ( x ¯ , x ) + ε ω ( x ¯ , x ) e C , for all x X , x x ¯ ,

where e int C .

By an approach similar to [2], Araya et al.[3] obtained a vectorial version of Ekeland’s variational principle related to equilibrium problem. In 2008, Al-Homidan et al.[1] established Ekeland-type variational principles in the setting of quasi-metric spaces with a Q-function. Recently, Bednarczuk and Zagrodny [6] introduced an Ekeland-type vector variational principle for monotonically semicontinuous mappings with perturbations given by a convex bounded subset of directions multiplied by the distance function, and they proved EVP for vector-valued mappings by combining topological and set-theoretic methods. Very recently, Khanh and Quy [19] have proposed a very weak type of generalized distances and used it to weaken the assumptions about lower semicontinuity in the existing versions of Ekeland’s variational principle on the complete metric space: to find v X such that, for all x v

F ( v ) F ( x ) + p ( v , x ) k 0 + K ,

where K is a convex cone in the Hausdorff locally convex space Y, F : X 2 Y , p is a weak τ-function and k 0 ( K c l K ) .

Motivated by the above mentioned works, we establish a vectorial form of Ekeland-type variational principle for multivalued bioperator whose domain is a complete metric space and its range is a subset of a locally convex Hausdorff topological space by using the set theoretic methods. We also consider Caristi-Kirk fixed point theorem in a more general setting and our techniques allow us to improve and to extend their results in [2,6,7].

### 2 Preliminaries

This section provides the preliminary terminology and notation used throughout this paper. Let ( X , d ) be a complete metric space, Y be a locally convex space (i.e., a linear topological space with a local base consisting of convex neighborhoods of the origin, see [15]) and K be a closed convex cone in Y. For any x , y Y we define

x K y y x K .

Now, we define the concept of a ω-distance for a metric space which has been introduced by Kada et al.[18].

Definition 2.1 Let ( X , d ) be a metric space. A function w : X × X [ 0 , ) is called a w-distance on X if the following conditions are satisfied:

(i) w ( x 1 , x 3 ) w ( x 1 , x 2 ) + w ( x 2 , x 3 ) for any x 1 , x 2 , x 3 X ;

(ii) for any fixed x X , w ( x , ) is lower semi continuous;

(iii) for any ε > 0 , there exists δ > 0 such that w ( x 3 , x 1 ) δ and w ( x 3 , x 2 ) δ implying d ( x 1 , x 2 ) ε .

Definition 2.2 (See [9,12])

Let f be a function from X to Y. It is said to be

(i) C-bounded below if there exists y Y such that f ( x ) y + C , for all x X ;

(ii) ( D , C ) -lower semicontinuous if for all r R , { x X : f ( x ) r D C } closed;

(iii) ( D , C ) -upper semicontinuous if for all r R , { x X : f ( x ) r D + C } closed;

(iv) ( D , C ) -continuous if it is both ( D , C ) -lower semicontinuous and ( D , C ) -upper semicontinuous;

(v) ( e , C ) -lower semicontinuous if for all r R , { x X : f ( x ) r e C } closed;

(vi) ( e , C ) -upper semicontinuous if for all r R , { x X : f ( x ) r e + C } closed;

(vii) ( e , C ) -continuous if it is both ( e , C ) -lower semicontinuous and ( e , C ) -upper semicontinuous;

(viii) C-lower semicontinuous if for all y Y , { x X : f ( x ) y C } closed;

(ix) C-upper semicontinuous if for all y Y , { x X : f ( x ) y + C } closed;

(x) C-continuous if it is both C-lower semicontinuous and C-upper semicontinuous.

Remark 2.3 It is easy to see that the C-lower (respectively upper) semicontinuity of f implies the ( e , C ) -lower (respectively upper) semicontinuity.

Definition 2.4 (Holmes [15])

Let X be a linear topological space over the field R .

(1) A sequence { x n } X is bounded if λ n x n θ whenever λ n 0 in R .

(2) A set A X is bounded if every sequence in A is bounded.

Let C be a convex cone in a linear topological space Y with int C and D a convex subset of C such that 0 c l ( D + C ) . In order to show the main results, let us give the following definition.

Definition 2.5 A generalized nonlinear scalarization function is defined by

ξ ( D , C ) ( z ) : = inf { r R : z r D C } z Y .

Remark 2.6 If D = { e } with e int C , then ξ ( D , C ) Definition 2.5 reduces to the definition of the Gerstewitz function [14]

ξ e ( z ) : = inf { r R : z r e C } z Y .

Lemma 2.7For r R , we set P r = r D C . Then the following hold:

(i) If z P r for some r R , z P μ for each μ > r .

(ii) For each z Y , there exists a real numberλsuch that z P λ .

(iii) Let z Y . If z P r for some r R , z P μ for each μ < r .

Proof (i) Let z P r for some r R and μ > r . We note that

μ D z = ( μ r ) D + r D z C + C C .

This implies z P μ .

(ii) Assume there exists z Y such that for all λ R , z P λ . From (i), we have z λ D C for all λ R . Then we see that

t D z C and ( 1 t ) D z C for some  t R .

Note that

( t D z ) ( ( 1 t ) D z ) C + C C .

Since D is convex, we have

0 t D + ( 1 t ) D + C D + C ,

which is a contradiction to 0 c l ( D + C ) .

(iii) Let z Y and if z P r for some r R . Assume that for some μ < r , z P μ . From (i), we have z P r , a contradiction. □

Proposition 2.8The function ξ : Y R is well defined.

Proof For any z Y , define

K : = { r R : z r D C } .

It is sufficient to show that K is bounded from below.

Assume that for each r R , there exists l R such that l < r and z l D C .

By Lemma 2.7 (ii), there exists μ R such that z μ D C .

By Lemma 2.7 (iii), we have z α D C for each α < μ , a contradiction. Then K is bounded from below. □

Let us recall the basic set-theoretical concepts and tools which are used in the sequel. Let X be a nonempty set and s X × X a relation. By x   s   y we mean that ( x , y ) s and we write x   s   y if and only if there are finite elements x 1 , , x n X such that

x = x 1 ,   x 1   s   x 2 ,   ,   x n 1   s   x n ,   x n = y .

The relation s is said to be the transitive closure of s, and s = s if s is transitive. We say that the element x X is maximal with respect to a relation s X × X (i.e., x is s-maximal) if for every y X ,

x   s   y     y   s   x .

Definition 2.9 (See [13])

A set X with a relation s X × X is countably orderable with respect to s if for every nonempty subset W X there exists a well-ordered relation μ on W such that

v   μ   w v   s   w for every  v , w W , v w

implies that W is at most countable.

Theorem 2.10 (See [13])

LetXbe a countably orderable set by a relation s X × X . Assume that for any sequence ( x i ) X satisfying

x i   s   x i + 1 for all i N

there are a subsequence ( x i k ) ( x i ) and an elementxsuch that

x i k   s   x for all k N .

Then an s -maximal element ofXexists.

Moreover, ifsis transitive, then there exists ans-maximal element ofX.

### 3 Main theorem

In this section, we will present the following vectorial form of an equilibrium version of vector Ekeland’s principle in setting complete metric spaces and ω-distance.

Theorem 3.1LetXbe a complete metric space, ω : X × X [ 0 , ) be aω-distance onX, Ybe a locally convex space, Cbe a closed and convex cone inYandDbe a closed convex and bounded subset ofCsuch that 0 c l ( D + C ) . Let F : X × X Y be a function satisfying the following conditions:

(i) F ( x , x ) = 0 for all x X ;

(ii) F ( x , y ) + F ( y , z ) F ( x , z ) + C for every x , y , z X ;

(iii) for each x X , the function F ( x , ) : X Y is (D,C)-lower semicontinuous;

(iv) for each fixed x X , F ( x , ) : X Y isC-bounded below.

Then for every x 0 X , there exists x ¯ X such that

(i) F ( x 0 , x ¯ ) + w ( x 0 , x ¯ ) D C ;

(ii) F ( x ¯ , x ) + w ( x ¯ , x ) D C for all x x ¯ .

Proof Let r X × X be a relation defined as follows: For any x , y X ,

x   r   y         F ( x , y ) + ω ( x , y ) D C .

We will first show that r is transitive. Suppose that u 1   r   u 2 and u 2   r   u 3 . Thus, we have

This implies that

F ( u 1 , u 2 ) + F ( u 2 , u 3 ) + ω ( u 1 , u 2 ) D + ω ( u 2 , u 3 ) D C . (3.1)

By assumption (ii), we obtain

F ( u 1 , u 3 ) F ( u 1 , u 2 ) + F ( u 2 , u 3 ) C . (3.2)

Therefore, by the convexity of D, we have

( ω ( u 1 , u 2 ) + ω ( u 2 , u 3 ) ) D = ω ( u 1 , u 2 ) D + ω ( u 2 , u 3 ) D .

Indeed, if ω ( u 1 , u 2 ) + ω ( u 2 , u 3 ) = 0 , we are done. If ω ( u 1 , u 2 ) + ω ( u 2 , u 3 ) > 0 , for d 1 , d 2 D , we have

ω ( u 1 , u 2 ) ω ( u 1 , u 2 ) + ω ( u 2 , u 3 ) d 1 + ω ( u 2 , u 3 ) ω ( u 1 , u 2 ) + ω ( u 2 , u 3 ) d 2 D .

So, we have

ω ( u 1 , u 2 ) d 1 + ω ( u 2 , u 3 ) d 2 ( ω ( u 1 , u 2 ) + ω ( u 2 , u 3 ) ) D .

Hence ω ( u 1 , u 2 ) D + ω ( u 2 , u 3 ) D ( ω ( u 1 , u 2 ) + ω ( u 2 , u 3 ) ) D , which implies that ( ω ( u 1 , u 2 ) + ω ( u 2 , u 3 ) ) D = ω ( u 1 , u 2 ) D + ω ( u 2 , u 3 ) D .

By the definition of ω-distance, ω ( u 1 , u 3 ) ω ( u 1 , u 2 ) + ω ( u 2 , u 3 ) . Therefore, there is a real number ε > 0 such that

ω ( u 1 , u 3 ) D = ω ( u 1 , u 2 ) D + ω ( u 2 , u 3 ) D ε D ω ( u 1 , u 2 ) D + ω ( u 2 , u 3 ) D C . (3.3)

From (3.1), (3.2) and (3.3), we have

F ( u 1 , u 3 ) + ω ( u 1 , u 3 ) D C .

This implies that u 1 r u 3 .

We define S : X 2 X by

S ( x ) = { y X : F ( x , y ) + ω ( x , y ) D C } for all  x X .

It is easy to see that x S ( x ) , and so S ( x ) is nonempty for all x X . By assumption (iii), we note that S ( x ) is a closed set for all x X . We now show that S ( x ) is a countably orderable set by a relation r X × X .

Let

V ( x ) : = inf y S ( x ) ξ ( D , C ) ( F ( x , y ) ) ,

where ξ ( D , C ) ( z ) : = inf { r R : z r D C } for all z Y .

Let W be any nonempty subset of A which is well ordered by a relation s satisfying

u   s   v     u   r   v for every  u , v W ,   u v .

Then, for any u , v W with u v , we note that

u   s   v u   r   v u   r   v and S ( u ) S ( v )

because r is transitive. Since u   r   v , u v , thus F ( u , v ) + ω ( u , v ) D C , which implies that ξ ( D , C ) ( F ( u , v ) ) ω ( u , v ) < 0 . Moreover,

V ( u ) = inf y S ( u ) ξ ( D , C ) ( F ( u , y ) ) inf y S ( v ) ξ ( D , C ) ( F ( u , y ) ) inf y S ( v ) ( ξ ( D , C ) ( F ( u , v ) ) + ξ ( D , C ) ( F ( v , y ) ) ) = ξ ( D , C ) ( F ( u , v ) ) + inf y S ( v ) ξ ( D , C ) ( F ( v , y ) ) < inf y S ( v ) ξ ( D , C ) ( F ( v , y ) ) = V ( v ) .

Thus V ( W ) R is well ordered by the relation “<” and hence V ( W ) is at most countable. Since V is one-to-one mapping on W, W is at most countable.

For any x X , we let ( y n ) S ( x ) with y n   r   y n + 1 for all n N . We next show that there is an element y 0 such that y n   r   y 0 for all n N .

In case y m = y m + 1 = y m + 2 = for some m N , we can put y 0 : = y m and so we have done. Then, it is enough to consider the case i = 1 ω ( y i , y i + 1 ) > 0 . Since y n r y n + 1 for each n N , we obtain

F ( y n , y n + 1 ) + ω ( y n , y n + 1 ) D C . (3.4)

From (3.4) and assumption (ii), we observe that

F ( y 1 , y 2 ) F ( y 1 , y m + 1 ) F ( y 2 , y 3 ) F ( y 3 , y 4 ) F ( y m , y m + 1 ) + C F ( y 1 , y m + 1 ) + ( ω ( y 2 , y 3 ) D + C ) + ( ω ( y 3 , y 4 ) D + C ) + + ( ω ( y m , y m + 1 ) D + C ) + C F ( y 1 , y m + 1 ) + i = 2 m ( ω ( y i , y i + 1 ) D ) + C ,

for all m N . Since F is C-bounded below, there exists z Y such that

F ( y 1 , y 2 ) z + C + i = 2 m ( ω ( y i , y i + 1 ) D ) . (3.5)

By the convexity of D, we have

i = 1 m ( ω ( y i , y i + 1 ) D ) = ( i = 1 m ω ( y i , y i + 1 ) ) D (3.6)

for any m N . Therefore, it follows from (3.5) and (3.6) that

F ( y 1 , y 2 ) z + C + ( i = 2 m ω ( y i , y i + 1 ) ) D .

Since 0 c l ( D + C ) , by the Separation theorem, there exists f Y such that

f , 0 < inf { f , d + c , d D , c C } .

This implies that 0 < ε < f , d + c = f , d + f , c for some ε > 0 , and for any d D , c C . Hence inf d D f , d > 0 and f , c ≥ 0 for any c C . Hence, for each m N , we have

f , F ( y 1 , y 2 ) = f , z + f , c + i = 2 m ω ( y i , y i + 1 ) f , d

for some c C and d D . Since f , c 0 for any c C , it follows that

f , F ( y 1 , y 2 ) f , z + i = 2 m ω ( y i , y i + 1 ) inf d D f , d .

Since inf d D f , d > 0 , we have that i = 1 m ω ( y i , y i + 1 ) is bounded above by f , F ( y 1 , y 2 ) f , z inf d D f , d . Moreover, ( i = 1 m ω ( y i , y i + 1 ) ) is a monotone sequence then the series i = 1 ω ( y i , y i + 1 ) converges. This implies that lim i ω ( y i , y i + 1 ) = 0 . It is easy to see that ( y n ) is a Cauchy sequence in S ( x ) . By the completeness of X and closedness of S ( x ) , ( y n ) converges to a certain y 0 S ( x ) . Since r is transitive and y n   r   y n + 1 , then y n   r   y m for all m > n , and so y n   r   y 0 . This entails that S ( x ) satisfies the condition in Theorem 2.10. Now, the proof includes applying Theorem 2.10 to show that S ( x ) has an r-maximal element x ¯ S ( x ) . Let us observe that for x X , any r-maximal element of S ( x ) is an r-maximal element of X. Hence, (i) holds for  x ¯ . Finally, we show that x ¯ satisfies (ii). Assume that x ¯   r   z for some z x ¯ . Since r is transitive and x ¯ is r-maximal, z   r   x ¯ . Consequently, V ( x ¯ ) > V ( z ) and V ( z ) > V ( x ¯ ) , a contradiction. Hence x ¯ satisfies (ii). □

Remark 3.2 We see in the proof that we do not use the symmetry condition of the metric. So, the conclusion in Theorem 3.1 still holds if we replace the word ‘‘metric space’’ with ‘‘quasi-metric space’’.

By setting D = { ε e } for all ε > 0 in Theorem 3.1, we obtain the following Corollary which is proven by Ansari [2].

Corollary 3.3 (Theorem 3.1 in [2])

Let ( X , d ) be a complete quasi-metric space, ω : X × X [ 0 , ) aω-distance onX, Ybe a locally convex Hausdorff topological vector space, Cbe a proper, closed and convex cone inYwith apex at origin and int C , and e Y be a fixed vector such that e int C . Let F : X × X Y be a function satisfying the following:

(i) F ( x , x ) = 0 , for all x X ;

(ii) F ( x , y ) + F ( y , z ) F ( x , z ) + C for all x , y , z X ;

(iii) for each fixed x X , the function F ( x , ) : X Y is ( e , C ) -lower semicontinuous andC-bounded below.

Then for every ε > 0 and for every x 0 X , there exists x ¯ X such that

(a) F ( x 0 , x ¯ ) + ε ω ( x 0 , x ¯ ) e C ,

(b) F ( x ¯ , x ) + ε ω ( x ¯ , x ) e C , for all x X , x x ¯ .

If F ( x , y ) = f ( y ) f ( x ) , where f : X R is lower semicontinuous and bounded below, then we have the following result.

Corollary 3.4LetXbe a complete metric space, ω : X × X [ 0 , ) be aω-distance onX, Ybe a locally convex space, Cbe a closed and convex cone inYandDbe a closed convex and bounded subset ofCsuch that 0 c l ( D + C ) . Let f : X Y be (D,C)-lower semicontinuous andC-bounded below. Then for every x 0 X there exists x ¯ X such that

(i) f ( x ¯ ) + w ( x 0 , x ¯ ) D f ( x 0 ) C ;

(ii) f ( x ) + w ( x ¯ , x ) D f ( x ¯ ) C for all x x ¯ .

We obtain that Corollary 3.4 is the extension of the following.

Corollary 3.5LetXbe a complete metric space, ω : X × X [ 0 , ) be aω-distance onX, Ybe a locally convex space, Cbe a closed and convex cone inYandDbe a closed convex and bounded subset ofCsuch that 0 c l ( D + C ) . Let f : X Y be (D,C)-lower semicontinuous andC-bounded below. Then for every x 0 X there exists x ¯ X such that

(i) ( f ( x 0 ) C ) ( f ( x ¯ ) + w ( x 0 , x ¯ ) D ) ;

(ii) ( f ( x ¯ ) C ) ( f ( x ) + w ( x ¯ , x ) D ) = for all x x ¯ .

Proof By all conditions of Corollary 3.4, we have for every x 0 X there exists x ¯ X such that

(3.7)

(3.8)

From 3.7, we have (i) holds.

If (ii) were not satisfied, we would have ( f ( x ¯ ) C ) ( f ( x ) + w ( x ¯ , x ) D ) for some x x ¯ . Then there are c 1 C and d 1 D such that

f ( x ¯ ) = f ( x ) + w ( x ¯ , x ) d 1 + c 1 . (3.9)

Since 0 c l ( D + C ) , by the Separation theorem, there exists y Y such that 0 < ε < y , d + c = y , d + y , c for some ε > 0 , d D and c C . Hence inf d D y , d > 0 and y , c 0 for any c C .

From (3.9), we obtain that

y , f ( x ¯ ) = y , f ( x ) + w ( x ¯ , x ) d 1 + c 1 > y , f ( x ) .

Using the same method of (3.9), we conclude that y f ( x ¯ ) < y f ( x ) , a contradiction. Consequently (ii) holds □

If we set Y = R , C = [ 0 , ) and D = { ε } for ε > 0 in Theorem 3.1, we have the following result which is a well-known Ekeland’s variational principle in a more general setting.

Corollary 3.6LetXbe a complete metric space, ω : X × X [ 0 , ) be aω-distance onX, f : X × X R be a function satisfying the following conditions:

(i) F ( x , x ) = 0 for all x X ;

(ii) F ( x , y ) + F ( y , z ) F ( x , z ) for every x , y , z X ;

(iii) for each x X the function F ( x , ) : X R is lower semicontinuous and bounded below.

Then for every x 0 X and ε > 0 , there exists x ¯ X such that

(i) F ( x 0 , x ¯ ) + ε ω ( x 0 , x ¯ ) 0 ;

(ii) F ( x ¯ , x ) + ε ω ( x ¯ , x ) > 0 for all x x ¯ .

Remark 3.7 By setting w = d and F ( x , y ) = f ( y ) f ( x ) , where f : X R is lower semicontinuous and bounded below in Corollary 3.6, we obtain Theorem 1.1 proven by Ekeland [10,11].

The following theorem provides the equivalence between the equilibrium version of Ekeland-type variational principle, the equilibrium problem, Caristi-Kirk type fixed point theorem and Oettli and Théra type theorem

Theorem 3.8LetXbe a complete metric space, ω : X × X [ 0 , ) be aω-distance onX, Ybe a locally convex space, Cbe a closed and convex cone inYandDbe a closed convex and bounded subset ofC. Let T : X 2 X and F : X × X Y be a function satisfying the following conditions:

(i) F ( x , x ) = 0 for all x X ;

(ii) F ( x , y ) + F ( y , z ) F ( x , z ) + C for every x , y , z X ;

(iii) for each x X , the function F ( x , ) : X Y is ( D , C ) -lower semicontinuous;

(iv) for each fixed x X , F ( x , ) : x Y isC-bounded below;

(v) for each x X , there is y X such that y T x and F ( x , y ) + ω ( x , y ) D C .

ThenThas at least one fixed point, i.e., there exists x X such that x T x .

Proof By assumption (i)-(iv) applied to Theorem 3.1, there exists x ¯ X such that

F ( x ¯ , z ) + w ( x ¯ , z ) D C for all  z x ¯ .

On the other hand by assumption (v), there exists y T ( x ¯ ) such that

F ( x ¯ , y ) + w ( x ¯ , y ) D C .

Then we see that x ¯ = y , and so x ¯ T ( x ¯ ) , that is, T has at least one fixed point. □

Remark 3.9 We set F ( x , y ) = f ( y ) f ( x ) , D = { ε } , ε > 0 and replace ω-distance by d-distance in Theorem 3.8, we obtain Theorem 3.1 in [3] and Theorem 4.1 in [4] (vectorial Caristi-Kirk fixed point theorem).

### Competing interests

The authors declare that they have no competing interests.

### Authors’ contributions

The work presented here was carried out in collaboration between all authors. SP designed theorems and methods of the proof and interpreted the results. KS proved the theorems, interpreted the results and wrote the paper. All authors read and approved the final manuscript.

### Acknowledgement

The first author would like to thank the Office of the Higher Education Commission of Thailand for supporting by grant fund under the program Strategic Scholarships for the Join Ph.D. Program Thai Doctoral degree for this research.

### References

1. Al-Homidan, S, Ansari, QH, Yao, J-C: Some generalizations of Ekeland-type variational principle with applications to equilibrium problems and fixed point theory. Nonlinear Anal., Theory Methods Appl.. 69(1), 126–139 (2008). Publisher Full Text

2. Ansari, QH: Vectorial form of Ekeland-type variational principle with applications to vector equilibrium problems and fixed point theory. J. Math. Anal. Appl.. 334, 561–575 (2007). Publisher Full Text

3. Araya, Y, Kimura, K, Tanaka, T: Existence of vector equilibrium via Ekeland’s variational principle. Taiwan. J. Math.. 12, 1991–2000 (2008)

4. Araya, Y: Ekeland’s variational principle and its equivalent theorems in vector optimization. J. Math. Anal. Appl.. 346, 9–16 (2008). Publisher Full Text

5. Aubin, JP, Siegel, J: Fixed points and stationary points of dissipative multivalued maps. Proc. Am. Math. Soc.. 78(3), 391–398 (1980). Publisher Full Text

6. Bednarczuk, EM, Zagrodny, D: Vector variational principle. Arch. Math.. 93, 577–586 (2009). Publisher Full Text

7. Bianchi, M, Kassay, G, Pini, R: Existence of equilibria via Ekeland’s principle. J. Math. Anal. Appl.. 305, 502–512 (2005). Publisher Full Text

8. Caristi, J: Fixed point theorems for mappings satisfying inwardness conditions. Trans. Am. Math. Soc.. 215, 241–251 (1976)

9. Chen, GY, Huang, XX: Ekeland’s variational principle for set-valued mappings. Math. Methods Oper. Res.. 48, 181–186 (1998). Publisher Full Text

10. Ekeland, I: On the variational principle. J. Math. Anal. Appl.. 47, 324–353 (1974). Publisher Full Text

11. Ekeland, I: Nonconvex minimization problems. Bull. Am. Math. Soc.. 1, 443–474 (1979). Publisher Full Text

12. Facchinei, F, Pang, JS: Finite Dimensional Variational Inequalities and Complementarity Problems, I, Springer, New York (2003)

13. Gajek, L, Zagrodny, D: Countably orderable sets and their applications in optimization. Optimization. 26, 287–301 (1992). Publisher Full Text

14. Gerth, C, Weidner, P: Nonconvex separation theorems and applications in vector optimization. J. Optim. Theory Appl.. 67, 297–320 (1990). Publisher Full Text

15. Holmes, RB: Geometric Functional Analysis and Its Applications, Springer, New York (1975)

16. Isac, G: Ekeland’s principle and Pareto e-efficiency. In: Tamiz M (ed.) Multi-objective Programming and Goal Programming, Theory and Applications, Springer, Berlin (1996)

17. Isac, G: Nuclear cones in product spaces, Pareto efficiency and Ekeland-type variational principle in locally convex spaces. Optimization. 53, 253–268 (2004). Publisher Full Text

18. Kada, O, Suzuki, T, Takahashi, W: Nonconvex minimization theorems and fixed point theorems in complete metric spaces. Math. Jpn.. 44, 381–391 (1996)

19. Khanh, PQ, Quy, DN: On generalized Ekeland’s variational principle and equivalent formulations for set-valued mappings. J. Glob. Optim.. 49, 381–396 (2011). Publisher Full Text

20. Nemeth, AB: A nonconvex vector minimization problem. Nonlinear Anal.. 10, 669–678 (1986). Publisher Full Text

21. Takahashi, W: Existence theorems generalizing fixed point theorems for multivalued mappings. In: Thera MA, Baillon JB (eds.) Fixed Point Theory and Applications, pp. 397–406. Longman, Harlow (1991)

22. Tammer, C: A generalization of Ekeland’s variational principle. Optimization. 25, 129–141 (1992). Publisher Full Text