Skip to main content

# On generalized Fenchel-Moreau theorem and second-order characterization for convex vector functions

## Abstract

Based on the concept of conjugate and biconjugate maps introduced in (Tan and Tinh in Acta Math. Viet. 25:315-345, 2000) we establish a full generalization of the Fenchel-Moreau theorem for the vector case. Besides this, by using the Clarke generalized first-order derivative for locally Lipschitz vector functions, we establish a first-order characterization for monotone operators. Consequently, a second-order characterization for convex vector functions is obtained.

MSC: 26B25, 49J52, 49J99, 90C46, 90C29.

## 1 Introduction

Convex functions play an important role in nonlinear analysis, especially in optimization theory since they guarantee several useful properties concerning extremum points. Consequently, characterizations of the class of these functions, first-order as well as second-order, have been studied intensively. We also know that in convex analysis the theory of Fenchel conjugation plays a central role and the Fenchel-Moreau theorem concerning biconjugate functions plays a key role in the duality theory.

In the vector case, there are also many efforts focussing on these topics (see ). However, the results are still far from the repletion. The main difficulty for ones working on the vector setting is the non-completion of the order under consideration. Hence several generalizations are not complete.

The first purpose of the paper is to generalize the Fenchel-Moreau theorem to the vector case. Based on the concepts of supremum and conjugate and biconjugate maps introduced in , we obtain a full generalization of the theorem. Secondly, by using the Clarke generalized first-order derivative for locally Lipschitz vector functions, we establish a first-order characterization for monotone operators. Consequently, a second-order characterization for convex vector functions is obtained.

The paper is organized as follows. In the next section, we present some preliminaries on a cone order in finitely dimensional spaces and on convex vector functions. Section 3 is devoted to a generalization of the Fenchel-Moreau theorem. The last section deals with a second-order characterization of convex vector functions.

## 2 Preliminaries

Let $C⊆ R m$ be a nonempty set. We recall that C is said to be a cone if $tx∈C$, $∀x∈C$, $t≥0$. A cone C is said to be pointed if $C∩(−C)={0}$. A convex cone $C⊆ R m$ specifies on $R m$ a partial order defined by

$∀x,y∈ R m ,x ⪯ C y⇔y−x∈C.$

When $intC≠∅$, we shall write $x ≪ C y$ if $y−x∈intC$. From now on we assume that $R m$ is ordered by a convex cone C.

Definition 2.1 [, Definition 2.1]

Let $A⊆ R m$ be a nonempty set, and let $a∈A$. We say that

1. (i)

a is an ideal efficient (or ideal minimum) point of A with respect to C if

$a⪯x,∀x∈A.$

The set of ideal efficient points of A is denoted by $IMin(A|C)$.

2. (ii)

a is an efficient (or Pareto minimum) point of A with respect to C if

$∀x∈A,x⪯a⇒a⪯x.$

The set of efficient points of A is denoted by $Min(A|C)$.

Remark 2.2 When C is pointed and $IMin(A|C)$ is nonempty, then $IMin(A|C)$ is a singleton and $Min(A|C)=IMin(A|C)$. The concepts of Max and IMax are defined analogously. It is clear that $−MinA=Max(−A)$.

Definition 2.3 

Let $A⊆ R m$ be a nonempty set, and let $b∈ R m$. We say that b is an upper bound of A with respect to C if

$x⪯b,∀x∈A.$

The set of upper bounds of A is denoted by $Ub(A|C)$.

When $Ub(A|C)≠∅$, we say that A is bounded from above. The concept of lower bound is defined analogously. The set of lower bounds of A is denoted by $Lb(A|C)$.

Definition 2.4 [, Definition 2.3]

Let $A⊆ R m$ be a nonempty set, and let $b∈ R m$. We say that

1. (i)

b is an ideal supremal point of A with respect to C if $b∈IMin(UbA|C)$, i.e.,

${ x ⪯ b , ∀ x ∈ A , b ⪯ y , ∀ y ∈ Ub ( A | C ) .$

The set of ideal supremal points of A is denoted by $ISup(A|C)$.

2. (ii)

b is a supremal point of A with respect to C if $b∈Min(UbA|C)$, i.e.,

${ x ⪯ b , ∀ x ∈ A , ∀ y ∈ Ub ( A | C ) , y ⪯ b ⇒ b ⪯ y .$

The set of supremal points of A is denoted by $Sup(A|C)$.

Remark 2.5 If $ISupA≠∅$, then $ISupA=SupA$. In addition, if the ordering cone C is pointed, then ISupA is a singleton.

In the sequel, when there is no risk of confusion, we omit the phrase ‘with respect to C’ and the symbol ‘$| C$’ in the definitions above. We list here some properties of supremum which will be needed in the sequel.

Lemma 2.6 Assume that the ordering cone $C⊆ R m$ is closed, convex and pointed.

1. (i)

[, Corollary  2.21] Let $A⊆ R m$ be nonempty. If $UbA∩ co A ¯ ≠∅$, then

$UbA∩ co A ¯ =ISupA$

(where $co A ¯$ denotes the closure of the convex hull of A).

2. (ii)

[, Corollary  2.14] Let $S⊆R$ be nonempty and bounded from above. Then, for every $c∈C$, we have

$ISup(Sc)=(supS)c$

(where $Sc:={tc:t∈S}$).

3. (iii)

[, Theorem  2.16, Remark  2.18] Let $A⊆ R m$ be nonempty. Then $SupA≠∅$ if and only if A is bounded from above. In this case, we have

$UbA=SupA+C.$
4. (iv)

[, Proposition  2.22] Let $A,B⊆ R m$ be nonempty. Then

1. (a)

If $A⊆B$, then $SupB⊆SupA+C$;

2. (b)

$SupA+SupB⊆Sup(A+B)+C$. If, in addition, $ISupA∪ISupB≠∅$, then

$SupA+SupB=Sup(A+B).$

Now let f be a vector function from a nonempty set $D⊆ R n$ to $R m$, and let $S⊆D$, $x∈S$. We say that f is continuous relative to S at x if for every neighborhood W of $f(x)$, there exists a neighborhood V of x such that

$x ′ ∈V∩S⇒f ( x ′ ) ∈W.$

f is called continuous relative to S if it is continuous relative to S at every $x∈S$. The epigraph of f (with respect to the ordering cone C) is defined as the set

$epif:= { ( x , y ) ∈ D × R m : f ( x ) ⪯ y } .$

f is called closed (with respect to C) if epif is closed in $R n × R m$. Now assume that $D⊆ R n$ is nonempty and convex. We recall that $f:D→ R m$ is said to be convex (with respect to C) if for every $x,y∈D$, $λ∈[0,1]$,

$f ( λ x + ( 1 − λ ) y ) ⪯λf(x)+(1−λ)f(y).$

Subdifferential of f at $x∈D$ is defined as the set

$∂f(x):= { A ∈ L ( R n , R m ) : A ( y − x ) ⪯ f ( y ) − f ( x ) ( ∀ y ∈ D ) } .$

Convex vector functions have several nice properties as scalar convex functions (see, [6, 16, 17]). We recall some results which will be used in the sequel.

Lemma 2.7 [, Theorem 4.12]

Assume that the ordering cone $C⊆ R m$ is closed, convex and pointed. Let f be a convex vector function from a nonempty convex set $D⊆ R n$ to $R m$. Then $∂f(x)≠∅$ for every $x∈riD$.

From [, Theorem 3.6] we immediately have the following lemma.

Lemma 2.8 Assume that the ordering cone $C⊆ R m$ is closed, convex and pointed with $intC≠∅$. Let f be a closed convex vector function from a nonempty convex set $D⊆ R n$ to $R m$, and let $x,y∈D$ be arbitrary. Then f is continuous relative to $[x,y]$ (where $[x,y]:={tx+(1−t)y:t∈[0,1]}$).

## 3 Generalized Fenchel-Moreau theorem

Let F be a set-valued map from a finitely dimensional normed space X to $R m$. We recall that the epigraph of F with respect to C is defined as the set

$epiF:= { ( x , y ) ∈ X × R m : y ∈ F ( x ) + C } .$

The effective domain of F is the set

$domF:= { x ∈ X : F ( x ) ≠ ∅ } .$

F is called convex (resp., closed) with respect to C if epiF is convex (resp., closed) in $X× R m$. Sometimes a vector function $f:D⊆ R n → R m$ is identified with the set-valued map

$F(x):={ { f ( x ) } , x ∈ D , ∅ , x ∉ D .$

Definition 3.1 [, Definition 3.1]

Assume that $domF≠∅$. The conjugate map of F, denoted by $F ∗$, is a set-valued map from $L(X, R m )$ to $R m$ defined as follows.

$F ∗ (A):=Sup ⋃ x ∈ X [ A ( x ) − F ( x ) ] ,∀A∈L ( X , R m ) ,$

where $L(X, R m )$ denotes the space of continuous linear maps from X to $R m$.

Definition 3.2 [, Definition 3.2]

Let F be a set-valued map from $R n$ to $R m$. Assume that $dom F ∗ ≠∅$. The biconjugate map of F, denoted by $F ∗ ∗$, is a set-valued map from $R n$ to $R m$ defined as follows.

$F ∗ ∗ (x):=Sup ⋃ A ∈ L ( R n , R m ) [ A ( x ) − F ∗ ( A ) ] ,∀x∈ R n .$

Remark 3.3 Let F be a set-valued map from $R n$ to $R m$ with $dom F ∗ ≠∅$. By identifying $x∈ R n$ with the linear map $x ¯ :L( R n , R m )→ R m$ defined as follows:

$x ¯ (A):=A(x),∀A∈L ( R n , R m ) ,$

we see that $F ∗ ∗$ is the restriction of $( F ∗ ) ∗$ on $R n$, i.e.,

$F ∗ ∗ = ( F ∗ ) ∗ | R n .$

In the rest of this section, we assume that the ordering cone $C⊆ R m$ is closed, convex, pointed and $intC≠∅$.

Lemma 3.4 [, Proposition 3.5]

Let F be a set-valued map from $R n$ to $R m$ with $domF≠∅$. Then

1. (i)

$F ∗$ is closed and convex.

2. (ii)

If $dom F ∗ ≠∅$, then $F(x)⊆ F ∗ ∗ (x)+C$, $∀x∈ R n$.

Lemma 3.5 Let F be a set-valued map from $R n$ to $R m$ with $dom F ∗ ≠∅$. Then $F ∗ ∗$ is closed and convex.

Proof It is immediate from Remark 3.3 and Lemma 3.4. □

Lemma 3.6 [, Proposition 3.6]

Let f be a convex vector function from a nonempty convex set $D⊆ R n$ to $R m$, and let $x∈D$, $A∈L( R n , R m )$. Then $A∈∂f(x)$ if and only if

$f ∗ (A)=A(x)−f(x).$

Lemma 3.7 Let f be a convex vector function from a nonempty convex set $D⊆ R n$ to $R m$. Then

$D⊆dom f ∗ ∗ ⊆ D ¯ .$

Proof Let $x∈riD$ be arbitrary. By Lemma 2.7, $∂f(x)≠∅$. Then, by Lemma 3.6, $∂f(x)⊆dom f ∗$. Consequently, $dom f ∗ ≠∅$. Then, by Lemma 3.4, $D⊆dom f ∗ ∗$. Now, suppose on the contrary that $dom f ∗ ∗ ⊈ D ¯$. Then there is $x 0 ∈dom f ∗ ∗$ such that $x 0 ∉ D ¯$. Using the strong separation theorem, one can find $ξ∈L( R n ,R)∖{0}$ so that

$ξ( x 0 )> sup x ∈ D ¯ ξ(x).$
(1)

Pick any $y 0 ∈riD$ and $A 0 ∈∂f( y 0 )$. By Lemma 3.6, $f ∗ ( A 0 )$ is a singleton. For each $c∈C$, we define a linear map $β c :R→ R m$ as follows:

$β c (t)=tc(∀t∈R).$

By (1) and by Lemma 2.6(ii),

$ISup ⋃ x ∈ D { ( β c ξ ) ( x ) } = ( sup x ∈ D ξ ( x ) ) c.$

Then we have

$f ∗ ( A 0 ) + ( sup x ∈ D ξ ( x ) ) c = f ∗ ( A 0 ) + ISup ⋃ x ∈ D { ( β c ξ ) ( x ) } = Sup ⋃ x ∈ D { A 0 ( x ) − f ( x ) } + ISup ⋃ x ∈ D ( β c ξ ) ( x ) = Sup ( ⋃ x ∈ D { A 0 ( x ) − f ( x ) } + ⋃ x ∈ D { ( β c ξ ) ( x ) } ) (by Lemma 2.6(iv)) ⊆ Sup ⋃ x ∈ D { A 0 ( x ) − f ( x ) + ( β c ξ ) ( x ) } + C (by Lemma 2.6(iv)) = f ∗ ( A 0 + β c ξ ) + C .$

Then there exists $y c ∈ f ∗ ( A 0 + β c ξ)$ such that

$f ∗ ( A 0 )+ ( sup x ∈ D ξ ( x ) ) c⪰ y c .$

Let $z∈ f ∗ ∗ ( x 0 )$ be arbitrary. From the definition of $f ∗ ∗$, one has

$z ⪰ ( A 0 + β c ξ ) ( x 0 ) − y c ⪰ [ A 0 ( x 0 ) − f ∗ ( A 0 ) ] + [ ξ ( x 0 ) − sup x ∈ D ξ ( x ) ] . c ( ∀ c ∈ C ) .$

By (1), this is impossible since $C≠{0}$ and pointed. Thus, $dom f ∗ ∗ ⊆ D ¯$. The proof is complete. □

Let $x 0 ,x∈ R n$, ${ x k } k ⊆[ x 0 ,x]$. Then we write ‘$x k ↑x$’ if

${ x k → x , ∥ x k + 1 − x 0 ∥ ≥ ∥ x k − x 0 ∥ ( ∀ k ) .$

Lemma 3.8 [, Lemma 3.16]

Let f be a convex function from a nonempty convex set $D⊆ R n$ to $R m$, and let $x∈D$. If there exists $x 0 ∈riD$ such that

$f(x)= lim t ↑ 1 f ( t x + ( 1 − t ) x 0 ) ,$

then for every sequence ${ ( A k , x k ) } k ⊆L( R n , R m )×[ x 0 ,x]$ such that $x k ↑x$ and $A k ∈∂f( x k )$, we have

$lim k → ∞ A k (x− x k )=0.$

Although biconjugate maps of vector functions have a set-valued structure, under certain conditions, they reduce to single-valued maps. Such conditions are the convexity and closedness of the functions. Moreover, we have the following theorem.

Theorem 3.9 (Generalized Fenchel-Moreau theorem) Let f be a vector function from a nonempty convex set $D⊆ R n$ to $R m$. Then f is closed and convex if and only if

$f= f ∗ ∗ .$

Proof $⇒ ̲$: Let $x∈D$ be arbitrary. Pick a point $x 0 ∈riD$. By Lemma 2.8, f is continuous relative to $[ x 0 ,x]$. Hence

$f(x)= lim t ↑ 1 f ( t x + ( 1 − t ) x 0 ) .$
(2)

Let ${ λ k } k ⊆(0,1)$ be an increasing sequence that converges to 1. Put $x k = λ k x+(1− λ k ) x 0$. Then ${ x k } k ⊆riD∩[ x 0 ,x]$ and $x k ↑x$. By Lemma 2.7, $∂f( x k )≠∅$. For each k, pick $A k ∈∂f( x k )$. By Lemma 3.6, $f( x k )= A k ( x k )− f ∗ ( A k )$. Hence,

$∥ f ( x ) − [ A k ( x ) − f ∗ ( A k ) ] ∥ = ∥ f ( x ) − [ A k ( x k ) − f ∗ ( A k ) ] + [ A k ( x k ) − A k ( x ) ] ∥ ≤ ∥ f ( x ) − f ( x k ) ∥ + ∥ A k ( x k − x ) ∥ .$
(3)

Take $k→∞$ in (3), by (2) and by Lemma 3.8, we have

$∥ f ( x ) − [ A k ( x ) − f ∗ ( A k ) ] ∥ →0,$

which together with Lemma 3.4(ii) implies

$f(x)∈Ub ( ⋃ A ∈ L ( R n , R m ) [ A ( x ) − f ∗ ( A ) ] ) ∩cl ( co ( ⋃ A ∈ L ( R n , R m ) [ A ( x ) − f ∗ ( A ) ] ) ) .$

Hence, by Lemma 2.6(i), Remark 2.5 and by the definition of biconjugate maps, we have

$f(x)=ISup ⋃ A ∈ L ( R n , R m ) [ A ( x ) − f ∗ ( A ) ] = f ∗ ∗ (x).$
(4)

Finally, we shall show that

$dom f ∗ ∗ =D.$

Indeed, by the proof above, we have $dom f ∗ ∗ ⊇D$. Let $x 0 ∈dom f ∗ ∗$ be arbitrary. By Lemma 3.7, $x 0 ∈ D ¯$. Let $y 0 ∈ f ∗ ∗ ( x 0 )$ and $x∈riD$. Then $(x,f(x)),( x 0 , y 0 )∈epi f ∗ ∗$. For every natural number $k≥1$, put

$x k = 1 k x + ( 1 − 1 k ) x 0 , y k = 1 k f ( x ) + ( 1 − 1 k ) y 0 .$

Obviously, $( x k , y k )→( x 0 , y 0 )$ and $( x k , y k )∈epi f ∗ ∗$, k, since $f ∗ ∗$ is convex. By (4), $f( x k )= f ∗ ∗ ( x k )$ since $x k ∈D$. Hence, $( x k , y k )∈epif$ (k). This fact together with closedness of f implies

$( x 0 , y 0 )∈epif.$

Hence $x 0 ∈D$. Thus, $dom f ∗ ∗ =D$ and then $f= f ∗ ∗$.

$⇐ ̲$: It is immediate from Lemma 3.5. The theorem is proved. □

When $m=1$ and $C= R +$, Theorem 3.9 is the famous Fenchel-Moreau theorem in convex analysis.

## 4 Second-order characterization of convex vector functions

Let $X,Y$ be real finitely dimensional normed spaces. We denote by $L(X,Y)$ the space of continuous linear maps from X to Y. In $L(X,Y)$ we equip the norm defined by

$∥A∥:=sup { ∥ A ( x ) ∥ : ∥ x ∥ ≤ 1 } ,∀A∈L(X,Y).$

Let $D⊆X$ be a nonempty open set, $x 0 ∈D$, and let $f:D→Y$ be a vector function.

Definition 4.1 

Assume that f is locally Lipschitz. The Clarke generalized derivative of f at $x 0$ is defined as

where $Df( x k )$ denotes the derivative of f at $x k$.

The following definition is suggested by [, Definition 2.1].

Definition 4.2 Assume that f is a vector function of class $C 1 , 1$. The Clarke generalized second-order derivative of f at $x 0$ is defined as

where $D 2 f( x k )$ denotes the second-order derivative of f at $x 0$.

In the remainder of this section, we assume that the ordering cone $C⊆ R m$ is closed and convex.

Definition 4.3 Let $D⊆ R n$ be a nonempty set, and let a map $F:D→L( R n , R m )$. We say that F is monotone with respect to C if

$F(x)(y−x)+F(y)(x−y)⪯0,∀x,y∈D.$

When $m=1$ and $C= R +$, Definition 4.3 collapses to the classical concept of monotonicity.

Now assume that $D⊆ R n$ is a nonempty, convex and open set. Let $F:D→L( R n , R m )$ be a locally Lipschitz map, $x∈D$, $y∈ R n$. We denote by I the largest open line segment satisfying $x+ty∈D$, $∀t∈I$. Define

$Φ(t):=F(x+ty)(y),t∈I.$

Set

$∂ Φ ( t ) ( ϵ ) : = { l ( ϵ ) : l ∈ ∂ Φ ( t ) } , M ( y , y ) : = [ M ( y ) ] ( y ) , ∀ M ∈ L ( R n , L ( R n , R m ) ) , y ∈ R n , ∂ F ( x + t y ) ( y , y ) : = { M ( y , y ) : M ∈ ∂ F ( x + t y ) } .$

We have the following lemma.

Lemma 4.4 $∂Φ(t)(ϵ)⊆ϵ∂F(x+ty)(y,y)$, $∀t∈I$, $ϵ∈R$.

Proof Observe that $Φ=φ∘F∘ψ$, where

$ψ:t↦x+ty,φ:A∈L ( R n , R m ) ↦A(y).$

Since φ is linear and ψ is affine, we have

$∂ ψ ( t ) ( ϵ ) = D ψ ( t ) ( ϵ ) = ϵ y , ∀ t ∈ I , ϵ ∈ R ∂ φ ( A ) ( M ) = D φ ( A ) ( M ) = φ ( M ) = M ( y ) , ∀ A , M ∈ L ( R n , R m ) .$

Then, applying a chain rule in [, Corollary 2.6.6], one obtains

□

Theorem 4.5 Let $D⊆ R n$ be a nonempty, convex and open set, and let $F:D→L( R n , R m )$ be a locally Lipschitz map. Then the following statements are equivalent:

1. (i)

F is monotone with respect to C.

2. (ii)

For every $x∈D$ at which F is differentiable,

$DF(x)(u,u)∈C,∀u∈ R n .$
3. (iii)

For every $x∈D$, $A∈∂F(x)$,

$A(u,u)∈C,∀u∈ R n .$

Proof $( i ) ⇒ ( ii ) ̲$ Let $x∈D$ at which F is differentiable, and let $u∈ R n$ be arbitrary. Let ${ t k } k$ be a positive sequence converging to 0. Since F is monotone with respect to C, we have

$( F ( x + t k u ) − F ( x ) ) t k (u)= 1 t k 2 ( F ( x + t k u ) − F ( x ) ) (x+ t k u−x)∈C,∀k.$

Taking $k→∞$, since C is closed, we obtain $DF(x)(u,u)∈C$.

$( ii ) ⇒ ( iii ) ̲$ Let $x∈D$, $A∈∂F(x)$ and $u∈ R n$ be arbitrary. By the definition of the Clark generalized derivative, we can represent A in the form

$A= ∑ i = 1 k λ i A i ,$
(5)

where $λ i ≥0$, $∑ i = 1 k λ i =1$ and $A i = lim j → ∞ DF( x i j )$ with $x i j →x$ ($j→∞$), and there exists $DF( x i j )$ for every $i=1,…,k$; $j=1,2,…$ . Since $DF( x i j )(u,u)∈C$ and C is closed, passing to the limit, we have $A i (u,u)∈C$, $∀i=1,…,k$. By (5) and by the convexity of C, we obtain $A(u,u)∈C$.

$( iii ) ⇒ ( i ) ̲$ Let $x,y∈D$ be arbitrary. Consider the function

$Φ(t)=F ( x + t ( y − x ) ) (y−x).$

Then Φ is locally Lipschitz on an open line segment I which contains $[0,1]$. Hence Φ is Lipschitz on any compact line segment $[a,b]$ with

$[0,1]⊆(a,b)⊆[a,b]⊆I.$

By the mean value theorem, for a vector function [, Proposition 2.6.5], there exist $τ 1 ,…, τ k ∈[0,1]$, $λ 1 ,…, λ k ≥0$, $λ 1 +⋯+ λ k =1$ such that

$Φ(1)−Φ(0)∈ ∑ i = 1 k λ i ∂Φ( τ i )(1).$

Hence

$( F ( y ) − F ( x ) ) ( y − x ) = Φ ( 1 ) − Φ ( 0 ) ∈ ∑ i = 1 k λ i ∂ Φ ( τ i ) ( 1 ) ⊆ ∑ i = 1 k λ i ∂ F ( x + τ i ( y − x ) ) ( y − x , y − x ) (by Lemma 4.4) ⊆ C .$

Thus F is monotone. The proof is complete. □

We note that Theorem 4.5 generalizes the corresponding result of Luc and Schaible in  in which $m=1$ and $C= R +$.

Theorem 4.6 Let $D⊆ R n$ be a nonempty convex and open set, and let $f:D→ R m$ be a $C 1 , 1$ vector function. Then f is convex with respect to C if and only if for every $x∈D$, $A∈ ∂ 2 f(x)$, $u∈ R n$,

$A(u,u)∈C.$

Proof We have

□

Specially, we have the following.

Corollary 4.7 [, Theorem 4.9]

Let $D⊆ R n$ be a nonempty convex and open set, and let $f:D→ R m$ be a twice continuously differentiable function. Then f is convex with respect to C if and only if

$D 2 f(x)(u,u)∈C,∀x∈D,u∈ R n .$

Proof Since continuously differentiable functions are locally Lipschitz, repeating arguments in the proof of the above theorem, we obtain the result. □

We note that when $m=1$, $C= R +$, Corollary 4.7 collapses to the classical result on the second-order characterization of convex functions.

Example 4.8 Let $R 3$ be ordered by the cone $C=con(co{(1,0,1),(0,−1,−1),(0,0,1)})$. Let $f: R 2 → R 3$ be defined by $f( x 1 , x 2 ):=( 1 2 x 1 2 +2 x 1 − x 2 ,− 1 2 x 2 2 − x 1 +2 x 2 , 1 2 x 1 2 + x 1 − 1 2 x 2 2 )$. By computing we have

$D 2 f(x)= ( ( 1 0 0 0 ) , ( 0 0 0 − 1 ) , ( 1 0 0 − 1 ) ) ,∀x∈ R 2 .$

Then

$D 2 f ( x ) ( y , y ) = ( y 1 2 , − y 2 2 , y 1 2 − y 2 2 ) = y 1 2 ( 1 , 0 , 1 ) + y 2 2 ( 0 , − 1 , − 1 ) ∈ C , ∀ x , y ∈ R 2 .$

Hence f is convex with respect to C by Corollary 4.7.

## References

1. 1.

Benoist J, Popovici N: Characterizations of convex and quasiconvex set-valued maps. Math. Methods Oper. Res. 2003, 57: 427–435.

2. 2.

Hamel AH: A duality theory for set-valued functions I: Fenchel conjugation theory. Set-Valued Anal. 2009, 17: 153–182. 10.1007/s11228-009-0109-0

3. 3.

Kawasagi H: A duality theorem in multiobjective nonlinear programming. Math. Oper. Res. 1982, 7: 95–110.

4. 4.

Luc DT: On duality theory in multiobjective programming. J. Optim. Theory Appl. 1984, 43(4):557–582.

5. 5.

Luc DT: Theory of vector optimization. Lect. Notes Econ. Math. Syst. 1989, 319: 1–175.

6. 6.

Luc DT, Tan NX, Tinh PN: Convex vector functions and their subdifferential. Acta Math. Vietnam. 1998, 23(1):107–127.

7. 7.

Luc DT, Schaible S: On generalized monotone nonsmooth maps. J. Convex Anal. 1996, 3: 195–205.

8. 8.

Luc DT: Generalized convexity in vector optimization. Nonconvex Optim. Appl. 76. Handbook of Generalized Convexity and Generalizes Monotonicity 2005, 195–236.

9. 9.

Malivert C: Fenchel duality in vector optimization. Lecture Notes in Econom. and Math. Systems 382. In Advances in Optimization. Springer, Berlin; 1992:420–438.

10. 10.

Postolica V: A generalization of Fenchel’s duality theorem. Ann. Sci. Math. Qué. 1986, 10(2):199–206.

11. 11.

Postolica V: Vectorial optimization programs with multifunctions and duality. Ann. Sci. Math. Qué. 1986, 10(1):85–102.

12. 12.

Pshenichnyi BN: Convex multivalued mappings and their conjugates. Kibernetika 1972, 3: 94–102.

13. 13.

Song W: A generalization of Fenchel duality in set-valued vector optimization. Math. Methods Oper. Res. 1998, 48(2):259–272.

14. 14.

Tanino T: Conjugate duality in vector optimization. J. Math. Anal. Appl. 1992, 167: 84–97.

15. 15.

Tanino T, Sawaragi Y: Conjugate maps and duality in multiobjective optimization. J. Optim. Theory Appl. 1980, 31: 473–499.

16. 16.

Tan NX, Tinh PN: On conjugate maps and directional derivatives of convex vector functions. Acta Math. Vietnam. 2000, 25: 315–345.

17. 17.

Tinh PN, Kim DS: Convex vector functions and some applications. J. Nonlinear Convex Anal. 2013, 14(1):139–161.

18. 18.

Clark FH Canadian Mathematical Society Series of Monographs and Advanced Texts. In Optimization and Nonsmooth Analysis. Wiley, New York; 1983. pp. xiii+308

19. 19.

Hiriart-Urruty J-B, Strodiot J-J, Nguyen VH:Generalized Hessian matrix and second-order optimality conditions for problems with $C 1 , 1$ data. Appl. Math. Optim. 1984, 11(1):43–56.

Download references

## Acknowledgements

This research was supported by the Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education Science and Technology (NRF-2013R1A1A2A10008908).

## Author information

Authors

### Corresponding author

Correspondence to Do Sang Kim.

## Additional information

### Competing interests

The authors declare that they have no competing interests.

### Authors’ contributions

All authors contributed equally and significantly in this research work. All authors read and approved the final manuscript.

## Rights and permissions

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

Reprints and Permissions

## About this article

### Cite this article

Tinh, P.N., Kim, D.S. On generalized Fenchel-Moreau theorem and second-order characterization for convex vector functions. Fixed Point Theory Appl 2013, 328 (2013). https://doi.org/10.1186/1687-1812-2013-328

Download citation

• Received:

• Accepted:

• Published:

### Keywords

• convex vector function
• biconjugate map
• Fenchel-Moreau theorem
• monotonicity
• second-order characterization 