2017 International Conference on Mathematics, Modelling and Simulation Technologies and Applications (MMSTA 2017) ISBN: 978-1-60595-530-8
A New Generalized Derivative and Applications
Guo-chen LIN
*Department of Applied Mathematics, Xiamen University of Technology, Xiamen, 361024, China *Corresponding author
Keywords: Generalized derivative, Generalized subdifferential.
Abstract. We introduce a new generalized derivative approximated by subdifferentials of local convexifications of nonconvex functions, which overcomes "too large" Clarke subdifferential. At last we give its applications in optimization.
Definitions and Propositions
In 1970s Clarke made advance in differential of Lipschitzian functions[1-4]. People developed the nonsmooth analysis[5-6]. We introduce a new generalized derivative approximated by subdifferentials of local convexifications of nonconvex functions, which overcomes "too large" Clarke subdifferential.
In the paper g is a function on Banach spaceX x y, , X . B x r( , ) is a closed ball with center x
and radius r.
Definition 1.1: Generalized directional derivative of g at x is
0
0
0 ( , r)
( ) ( )
( ; y)
lim
sup
lim
rc rcr
t z B x
z ty z x
t
g
g
g
where
rc
g
is a convexification of( ) z B( , 2 )
( )
else.
r
g z x r
z
g
That is
1 1 1 1 1
( ) inf n ( ) : , n , n , n 1, n
i i i i i
i i i
rc z r n i i i i X z
g
g x
x
x
. Obviously, when
z
B x
( , 2 )
r
,
1
11 1 1
( ) inf n ( ) : , n , n ( , 2 ), n 1, n
i i i i i
rc i i i i i
z n i i B x r z
g
g x
x
x
.Definition 1.2: Generalized subdifferntial of g at x is
* * 0 *
( ) : ( ; ) , , .
g x
x
X
g
x yx
y y X
The following theorem shows
g x
( )
is approximanted by local convexifications.Theorem 1.3: ( ) ( , )
o r rc
g x
g
B x r
, whererc
g
is a classical subdifferential of rcg
.Proof: * ( , )
o r
g
rcB x rx
, 0, 0 , ( , ), 0,
y X r z B x r t
such that z ty B x r( , 2 ), we have*
( ) ( )
, .
rc z ty rc z y
t
g
g
x
0 *
, ( ; ) ,
y X
g
x yx
y .
*
( )
g x
x
.
Theorem1.4: Suppose g is locally Lipschitzian at
x
0 with Lipschitzian constant L. Then0
0
( ; )
g x
is finite, positive homogeneous, subadditivity, Lipschitzian and |g x
0( 0; ) | 4 L || ||y y .Proof: It is obvious that it is positive homogeneous. Subadditivity is the result of convexity of .
rc
g
Since g is locally Lipschitzian at0, 0, x y, B( , )0
x
x
, we have| g( ) g( ) |x y L x|| y||. When 2r,
0
( , )|| ||[ ( || || ) ( )] /
sup
z B r rcr
y g z y z r
x y
g
0 1 0 1 1
( , ) 1 1
|| || sup [ ( ( )]: , , ( , 2 ), 1, /
|| ||
sup
n n n n ni i i
i i i
z B r i i i i
r
y g z y g n i B r z r
i
x
yy
y
x
y
4rL y|| || /r
4 || ||L y
.
Thus
0
0
0
0
0 ( , )
0 ( , )
( ; ) || || [ ( ) ( )] /
|| ||
|| || [ ( ) ( )] /
|| || 4 || || .
sup
lim
sup
lim
r z B r rc rc
r z B r rc
r
y y z y z r
x y
r
y g z y z r
x y
L y
g
x
g
g
g
According to subadditivity we have
0 0
0 0
( ; )y ( ; y) 4 ||L y|| 4 || || .L y
g
x
g
x
So
0 0
|
g x
( ; ) | 4 || || .y L y Similarly we have0 0
0 0
|
g
(x
; )x g
(x
; ) | 4 ||y L xy||,x y, X.Then 0 0 ( ; )
g x
is Lipschitzian.Theorem 1.5: Suppose g is locally Lipschitzian at x with Lipschitzian constant L. Then
a)
g x
( )
is nonempty, convex and *w
compact. For allx
*g x( ) we have ||x
*|| 4 L,b) 0
* *
, ( ; ) max , : (x)
y X
g
x yx
yx
g ,
c)
g
need not to be closed and upper semicontinous. Proof: a) Since 0( ; )x
g
is continuous and convex, and
g x
( )
is the classical subdifferenial of0
( ; )x
g
at 0. Then
g x
( )
is nonempty, convex and *w
compact. By theorem 1.4, For all*
(x),
g
y
X
x
,we have0 *
,y
g
( ; ) 4 || || .x y L yx
Then *
||
x
|| 4 L.b) If 0
* *
, ( ; ) max , : (x)
y
g
x yx
yx
g , By the Theorem Hahn-Banach,
* * 0 *
, ( ; )x y ,y
y
x
g
y
and
g
0( ; )x y
*, . Then* (x)
g
0 * 0 ( ; )x y ,y ( ; ).x y
g
y
g
It is a contradiction. The proof is completed. c) Antiexamples: g :
is0 ( )
0.
x x
g x
x x
Obviously,
1 0
( ) 0 0
1 0 .
x
g x x
x
Then
g
is neither closed nor upper semicontinous.Theorem 1.6: Suppose g attains its local minimum at x, then 0g(x).
Proof: Since g attains its local minimum at x,
0 0
0 ( , ) ( , ) ( ).
rc
r r
B x y B x y g x
g
.The following propositions show the relationship between generalized subdifferential and Dini subdifferential when g attains its locally minimum at x.
Definition 1.7[5]: Dini directional derivative is
( ) ( )
( ; )
liminf
.u y t o
g x tu g x g x y
t
d
When g is locally Lipschitzian at x,
0
( ) ( )
( ; )
lim inf
.t
g x ty g x g x y
t
d
Definition 1.8[5]: Dini subdifferential is
* * *
(x) : , ( ; ) .
g
x
X
x
yd
g x y
Theorem 1.9: Suppose g is locally Lipschitzian and attains its local minimum at x, then
(x)
(x)
g
g
.Proof: Since g attains its local minimum at x, ( ) g( )
rc x x
g
for r small enough. Then*
( ) 0,
o r
g
rc x rx
, such that*
( )
rc x
g
x
*
2 ( ) ( )
, 0, , , ,
|| ||
r g x ty g x
y r t y
y t
x
* 0
( ) ( )
,
liminf
t g x ty g x , .y y
t
x
Since
0 r
g
rc( )x g x( ), g x( ) g x( )
.The following theorem shows that the generalized derivative(subdifferential) we introduce is the generalization of classical derivative(subdifferential).
Theorem 1.10: Suppose g is continuous and convex, then
g x
( )
is the classical subdifferentialof g at x and 0 ( ; )x
g
is the classical directional derivativeg
'( ; )x .Proof: Since g is convex, |B( ,2 )x r g |B( ,2 )x r
rc
g
. Obviously, 0 '( ; )x ( ; )x
g
g
. Now weshow
g
0( ; )x g
'( ; )x . By the definition of 0( ; ),x y 0, B x( , )
0 0
( ty) ( )
( ; ).
limlim
rc i rc i i tx y t
g
z
g
z
g
Since *
i
z
is the classical subdifferential of g atz
isuch that*
0 0
( ty) ( )
g( ty) ( )
,
lim
i ilim
rc i rc i .i
t t
g y
t t
g
z
g
z
z
z
z
Then
0 *
, ( ; ).
lim
i iy
g
x yz
Since the classical subdifferential of g at x is locally bounded, then * *
x
X
,x
* is the*
w
cluster point of
*i
z
. Then *x is the classical subdifferential of g at x. Thus
0 * '
( ; )x y ,y ( ; ).x y
g
x
g
By Theorem 1.5 b), we have
g x
( )
is the classical subdifferential of g at x. The proof iscompleted.
Now we naturally introduce the definition of strict differentiable and study its characters and propositions.
Definition 1.11: There exists a strict derivative of g at x, if
0 *
( ; ) ( ), , , ( ) .
s s
x y g x y y g x
g
D
D
X
Theorem 1.12: g is locally Lipschitzian at x, there exists strict derivative ( )
sg x
D
of g at x, then
( ) s ( ) .
g x
D
g x
Conversely, if
g x
( )
is a single-point set
*x
, then g is strict differentiable at x with strictderivative *
( ) sg x
x
D
.Proof: Suppose that g is strict differentiable at x, then
0
( ; )x y sg x( ),y ,for any y.
g
D
We now show
* *
( ), ( )
sg x g x
x
D
x
.If not, *
, , s ( ),
y
x
yD
g x y . Then
0 *
, y sg x( ), y
g
( ;x y).x
D
It is a contradiction. The proof is completed.
Conversely,
y
X
, let *
* 0:span y R, ,ky k ( ; )x y
y
y
g
. Now we show
* 0
, ( ; ) |x span y .
y g
If
k
0
, obviously * 0,ky ( ;x ky)
y
g
. If k < 0; sinceg
0( ; )x is subadditivity, we have0 0 0
( ; 0)x ( ;x ky) ( ;x ky).
g
g
g
0 0 * *
( ;x ky) ( ;x ky) , ky ,ky .
g
g
y
y
By the Theorem Hahn-Banach, *
y
can be extended to be a continuous linear functional on X,without loss of generality, which is denoted by *
y
and* 0
, ( ; ).x
y
g
Then
y
*
g x
( )
and0 * *
( ; )x y ,y ,y .
g
y
x
If there exists y such that 0 * ( ; )x y ,y
g
x
, thenx
*y
*. It is a contradiction with
g x
( )
x
*. Then0 *
( ; )x y ,y .
g
x
Theorem 1.13: There exists the Frechet derivative *
x
of g atx
0, then *x
is the strictderivative of g at
0
x
.Proof: Since there exists Frechet derivative *
x
of g atx
0,
y
X
,
0
,
0
,2
r
,
x
B
(
x
0, 2 )
r
,n
,
1
n
i
i
R
,
0 1 ( ,2 )
n i
B r i
x
x
,
1 1
n i i
such that1
n i i i
x
x
, we have*
0 0 0 0
2r ||
x x
i || g( ) g(x
ix
)x x x
, i ||x x
i || 2 .r
Then
*
0 0
1
2 n i[g( ) g(i ) , i ] 2 .
i
r
x
x
x x x
r
Then
*
0 0
1
2 n ig( ) g(i ) , 2
i
r
x
x
x x x
r
.Then
*
0 0
2 ( ) g( ) , 2
rc
r
g
xx
x x x
r .
Then
*
0 0
( ) g( ) ,
2 || || 2 || ||
|| ||
rc x
y y
r y
g
x
x x x
.
0 0 0 0 * 0 * 0 0 ( , ) * 0 ( , ) * *
0 0 0 0 0
( , )
( ; ) ,
( ) ( )
lim lim ,
|| ||
lim [ ( ) ( )] ,
|| || || ||
lim [ ( ) g( ) , ] [ ( ) g( ) , ]
|| || || ||
sup
sup
sup
rc rc r tx B r
r
x B r rc rc
r
x B r rc rc
y y
x ty x y
x t
y r
x y x y
x r y
y r r
x y x y x x
x r y y
g x
x
g
g
x
g
g
x
g
x
x
x
g
x
x
x
0.
Since 0 0 ( ; )
g x
is subadditivity,0 0 0 * *
0 0 0
0
g
(x
; 0)g
(x
;y)g
(x
; )y x
,y x
,y 0.Then
0 0 * *
0 0
( ; )y ( ; y) , y ,y .
g
x
g
x
x
x
Then 0 *
0
( ; )y ,y
g x
x
. Then 0 *0
( ; )y ,y
g x
x
.The proof is completed.Theorem 1.13 shows that the generalized subdifferential overcomes "too large" Clarke subdifferential[1-4]. We can obtain some propositions else.
Firstly, we have the following results: the generalized directional derivative
g x
( )
of locally Lipschitzian function g on n
is equal tog
'( )x , a:e: Let [x; y] is the segment of n , '
' '
, ( )
x
y
y xx
x
. By Theorem Fubini, there existsx
'x, g is Frechet differentiablealmost everywhere on ' ' ,
y
x
. and
1 ' ' '
0 g(
x
t y( x)),yx dtg( )y
g( ).x
Let
'
1 1 '
0 ( ( )),
lim
0 ( ( )),x
g x t y x y x dt g t y x y x dt
x
x
where
x
' is selected such that g is Frechet differentiable almost everywhere on ' ' ,y
x
. Then
'
1 1 ' '
0 ( ( )),
lim
0 ( ) ( ) ( ) ( ).x
g x t y x y x dt g g g y g x
x
y
x
Corollary 1.14: Suppose g is locally Lipschitzian on an open subset D of a finite dimensional
space, for any x y, D, there exist some segments
0 x, 1
x
x
,
x x
1, 2 …x
m1,x
my which connect two points x and y, then g is uniquely determined by g excluding a constant.Proof: Let x xD y, D,
0 x, 1
x
x
,
x x
1, 2 …x
m1,x
my connect x and y. Then1 1
1
1 1 1
1 0 ( ) ( ) ( ) ( ) ( ) ( ( )), m i i i m
i i i i i
i
f y f x f f
f x g t dt
x
x
x
x x
x x
for any f satisfying f g. Then f is uniquely determined excluding a constant.
Corollary 1.15: Suppose g is locally Lipschitzian on a finite dimensional space, the generalized
Proof: Since g is locally Lipschitzian on a finite dimensional space, g is differentiable almost
everywhere and the Clarke subdifferential contains the Frechet derivative, by Theorem 1.13, the proof is completed.
The following is another characterization of generalized subdifferential. Definition 1.16: DX x, D,
0 ( )
D
z D
z
else
0
( ) : ( ; ) 0
D D
T x yX
x y
* * *
( ) : , 0, ( ) .
D D
N x
x
X
x
y y T xObviously,
0D( ; ) 0x or , and TD( )x is a convex cone, ND( )x isw
* closed convexcone.
Theorem 1.17: ND( )x D( )x
Proof:
x
* D( )x , y TD( )x ,we have *, 0( ; ) 0D
y x y
x
.Then( ) ( ).
D D
N x x
If there exists
x
*ND( )x ,x
*D( )x ,then there exists yX, * 0,y D( ; )x y
x
.Then0
( ; ) 0
D x y
.Then y yTD( )x .That isx
*,y 0.It is a contradiction.Theorem 1.18: Suppose g is a function on a finite dimensional space X and locally Lipschitzian
at
x
0 with Lipschitzian constant L. Thenx
*0g(x
0) if and only if*
(g)
0 0 0
(
x
, 1) gG (x
, (gx
)) where G g( ) is the graph of g.Proof: Without loss of generality, the norm of X is || ( , ) || max || ||,| | /2x t
x t L
.Necessity: Since
x
*0g(x
0), s 0, 0 s, 2 r ,there exists y belong to B(x
0, )r ,0
( , 2 )
x B
x
r ,we have
* 0
( ) ( ) , ,
rcx rc y x y
g
g
x
and
0 | ( ) ( ) | 2 .
rc y g rL
g
x
then ( , ( )) (( 0, ( 0)), )
rc
y
g
y Bx
gx
r .Note that B((
x
0, (gx
0)), 2 )r G g( ) is compact, then co( ((Bx
0, (gx
0)), 2 )r G g( )) iscompact. Then
0 0
( , ( )) co( (( , ( )), 2 ) ( )).
rc
y
g
y Bx
gx
r G gThen
( )
( G g ) ( ,rc ( )) 0.
rc
y
g
y
( , )x t X
,without loss of generality, ( 0, 2 ), t ( )
rc
*
( ) ( ) ( ) 0
( G g ) ( , ) (rc G g ) ( ,rc ( )) ( G g) ( , ) 0rc ( , 1),( , ) ( , ( ))
rc rc
x t y
g
y x tx
x t yg
y
. Then
*
( )
0 0 0
(
x
, 1) G g(x
, (gx
)).Sufficiency: Since *
( )
0 0 0
(
x
, 1) G g (x
, (gx
)) , for any ; there exist 2r and0 0
( , )y t B((
x
, (gx
)), )r , x B( , 2 )x
0 r ,we have*
( ) ( ) 0
(G g ) ( ,rc x
g
rc( )) (x G g ) ( , )rc y t (x
, 1), ( , xg
rc( )) ( , ) .x y tNote that (G g( )) ( , ) 0rc y t (if not, the left of inequality is ). Then ( )
rc
t
g
y . Then* 0
( , 1),( , ( )) ( , ) 0.
rc
x
g
x y tx
That is
* 0
( ) ( ) ( ) , .
rc x rc y rc x t x y
g
g
g
x
The proof is completed.
Applications
The section is about the applications of generalized derivative and subdifferential on optimization. P1:
0
m i
i
g
are locally Lipschitzian on n
, how to locally minimizeg
0 on
n: ( ) 0,1
i
D x
g
x i m ?Suppose z is the optimal solution of P1, without loss of generality,
0( ) 0z
g
. If not,0( ) 0( )z
g
g
is the substitute for
0( )
g
.P2: If g is a function on n
, how to locally minimize g on D of n
?Theorem 2.1: If z is the optimal solution of P1 and
0( ) 0z
g
, ( ) max
( ) : 0 i m
i
h
g
, thenthere exists subset with measure 0, such that
0 co ( ( j) ) : 0 i m, ( j), j , j , j h
i
d
g z
i Iz z
zz
z
where ( )j
: ( )j ( )j
i
I
z
ig
z
hz
, (
( ) )j
i
d
g z
is the set of the cluster points ( )j ig z
, h is the set
of all points which are not Frechet differenntiable. Firstly, we need the following lemma:
Lemma 2.2 [5]: If z is the optimal solution of P1 and
0( ) 0z
g
, then z is the locally minimum of h.Lemma 2.3 [2]: If h is locally Lipschitzian at z on
n, is a set with measure 0, then
( ) co ( ( ) ) : , , h .
j j j j
ch z d h
z
z
zz
z
The proof of Theorem 2.1 is as followings: Proof: Since
i
g
is locally Lipschitzian, so as h, and (0 i m)i
g
is Frechet differentiableexcluding a set with measure 0. By Lemma 2.2 and Lemma 2.3, z is a local minimum of h, then
Note that h,
i
g
is Frechet differentiable at zj and( )j ( ),j ( ).j
i
h
z
g
z
i Iz
The proof is completed.
Competing interests statement: The author declare that the author has no competing financial interests.
Acknowledgement
The research was financially supported by the funding of young and middle-aged teachers' educational and scientific research project in the Fujian Education Department: JAT160371.
References
[1] F.H. Clarke, Generalized Gradients and Applications, Trans. Amer. Math. Soc, 205 (1975), 247-262.
[2] F.H. Clarke, Optimization and Nonsmooth Analysis, Wiley-Interscience New York, 1983. [3] F.H. Clarke, Yu. S. Ledyaev, R.J. Stern and P.R. Wolenski, Nonsmooth Analysis and Control Theory, Graduate Texts in Mathematics, Springer-Verlag New York, 1998.
[4] F.H. Clarke, R.J. Stern, P.R. Wolenski, Subgradient Criteria for Monotonicity, the Lipschitz Condition, and Convexity. Can. J. Math., 45 (1993), 1167–1183.
[5] G. Giorgi, S. Komlósi, Dini Derivatives in Optimization Part II, Decisions in Economics and Finance, 15(1992), no. 2, 3-24.