Relationships between upper exhausters and the basic subdifferential in variational analysis

Similar documents
CITY UNIVERSITY OF HONG KONG

arxiv: v1 [math.oc] 17 Oct 2017

Subdifferential representation of convex functions: refinements and applications

SOME REMARKS ON THE SPACE OF DIFFERENCES OF SUBLINEAR FUNCTIONS

On Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q)

Outer limits of subdifferentials for min-max type functions

Some Properties of the Augmented Lagrangian in Cone Constrained Optimization

Brøndsted-Rockafellar property of subdifferentials of prox-bounded functions. Marc Lassonde Université des Antilles et de la Guyane

Global Maximum of a Convex Function: Necessary and Sufficient Conditions

Necessary and Sufficient Conditions for the Existence of a Global Maximum for Convex Functions in Reflexive Banach Spaces

Downloaded 09/27/13 to Redistribution subject to SIAM license or copyright; see

SECOND-ORDER CHARACTERIZATIONS OF CONVEX AND PSEUDOCONVEX FUNCTIONS

FIRST ORDER CHARACTERIZATIONS OF PSEUDOCONVEX FUNCTIONS. Vsevolod Ivanov Ivanov

A convergence result for an Outer Approximation Scheme

Optimality Conditions for Nonsmooth Convex Optimization

ON A CLASS OF NONSMOOTH COMPOSITE FUNCTIONS

Epiconvergence and ε-subgradients of Convex Functions

A CHARACTERIZATION OF STRICT LOCAL MINIMIZERS OF ORDER ONE FOR STATIC MINMAX PROBLEMS IN THE PARAMETRIC CONSTRAINT CASE

A Proximal Method for Identifying Active Manifolds

ON GAP FUNCTIONS OF VARIATIONAL INEQUALITY IN A BANACH SPACE. Sangho Kum and Gue Myung Lee. 1. Introduction

Stability of efficient solutions for semi-infinite vector optimization problems

Characterizations of the solution set for non-essentially quasiconvex programming

On Optimality Conditions for Pseudoconvex Programming in Terms of Dini Subdifferentials

Iterative Convex Optimization Algorithms; Part One: Using the Baillon Haddad Theorem

On Monch type multi-valued maps and fixed points

Local strong convexity and local Lipschitz continuity of the gradient of convex functions

On the convexity of piecewise-defined functions

SOME PROPERTIES ON THE CLOSED SUBSETS IN BANACH SPACES

AN INTERSECTION FORMULA FOR THE NORMAL CONE ASSOCIATED WITH THE HYPERTANGENT CONE

Journal of Inequalities in Pure and Applied Mathematics

Contents: 1. Minimization. 2. The theorem of Lions-Stampacchia for variational inequalities. 3. Γ -Convergence. 4. Duality mapping.

A PROOF OF A CONVEX-VALUED SELECTION THEOREM WITH THE CODOMAIN OF A FRÉCHET SPACE. Myung-Hyun Cho and Jun-Hui Kim. 1. Introduction

Optimization and Optimal Control in Banach Spaces

On robustness of the regularity property of maps

The Directed Subdifferential of DC Functions

Course 212: Academic Year Section 1: Metric Spaces

A Note on Nonconvex Minimax Theorem with Separable Homogeneous Polynomials

Week 3: Faces of convex sets

Variational inequalities for set-valued vector fields on Riemannian manifolds

ON A HYBRID PROXIMAL POINT ALGORITHM IN BANACH SPACES

McMaster University. Advanced Optimization Laboratory. Title: A Proximal Method for Identifying Active Manifolds. Authors: Warren L.

Mathematics for Economists

Differentiability of Convex Functions on a Banach Space with Smooth Bump Function 1

Product metrics and boundedness

Identifying Active Constraints via Partial Smoothness and Prox-Regularity

OPTIMALITY CONDITIONS FOR D.C. VECTOR OPTIMIZATION PROBLEMS UNDER D.C. CONSTRAINTS. N. Gadhi, A. Metrane

Optimality, identifiability, and sensitivity

Stationarity and Regularity of Infinite Collections of Sets. Applications to

Refined optimality conditions for differences of convex functions

Generalized directional derivatives for locally Lipschitz functions which satisfy Leibniz rule

AW -Convergence and Well-Posedness of Non Convex Functions

generalized Jacobians, nonsmooth analysis, mean value conditions, optimality

The local equicontinuity of a maximal monotone operator

The best generalised inverse of the linear operator in normed linear space

Keywords. 1. Introduction.

DUALIZATION OF SUBGRADIENT CONDITIONS FOR OPTIMALITY

arxiv: v1 [math.fa] 16 Jun 2011

On Nonconvex Subdifferential Calculus in Banach Spaces 1

On a result of Pazy concerning the asymptotic behaviour of nonexpansive mappings

On Weak Pareto Optimality for Pseudoconvex Nonsmooth Multiobjective Optimization Problems

Vector Variational Principles; ε-efficiency and Scalar Stationarity

Constraint qualifications for convex inequality systems with applications in constrained optimization

POLARS AND DUAL CONES

Journal of Inequalities in Pure and Applied Mathematics

Journal of Inequalities in Pure and Applied Mathematics

THE UNIQUE MINIMAL DUAL REPRESENTATION OF A CONVEX FUNCTION

Chapter 2 Convex Analysis

Optimality conditions in global optimization and their applications

Weak sharp minima on Riemannian manifolds 1

Iterative algorithms based on the hybrid steepest descent method for the split feasibility problem

On constraint qualifications with generalized convexity and optimality conditions

Strongly convex functions, Moreau envelopes and the generic nature of convex functions with strong minimizers

Translative Sets and Functions and their Applications to Risk Measure Theory and Nonlinear Separation

Measurable Choice Functions

A Brøndsted-Rockafellar Theorem for Diagonal Subdifferential Operators

Metric regularity and systems of generalized equations

Existence of global solutions of some ordinary differential equations

Convergence rate estimates for the gradient differential inclusion

Lecture Notes in Advanced Calculus 1 (80315) Raz Kupferman Institute of Mathematics The Hebrew University

Coordinate Update Algorithm Short Course Subgradients and Subgradient Methods

Finite Convergence for Feasible Solution Sequence of Variational Inequality Problems

Sequential Pareto Subdifferential Sum Rule And Sequential Effi ciency

Optimality, identifiability, and sensitivity

On nonexpansive and accretive operators in Banach spaces

ERROR BOUNDS FOR VECTOR-VALUED FUNCTIONS ON METRIC SPACES. Keywords: variational analysis, error bounds, slope, vector variational principle

On the Midpoint Method for Solving Generalized Equations

An Approximate Lagrange Multiplier Rule

STABLE AND TOTAL FENCHEL DUALITY FOR CONVEX OPTIMIZATION PROBLEMS IN LOCALLY CONVEX SPACES

GEOMETRIC APPROACH TO CONVEX SUBDIFFERENTIAL CALCULUS October 10, Dedicated to Franco Giannessi and Diethard Pallaschke with great respect

On Total Convexity, Bregman Projections and Stability in Banach Spaces

A note on the σ-algebra of cylinder sets and all that

NONSMOOTH ANALYSIS AND PARAMETRIC OPTIMIZATION. R. T. Rockafellar*

On the validity of the Euler Lagrange equation

A Dual Condition for the Convex Subdifferential Sum Formula with Applications

Relaxed Quasimonotone Operators and Relaxed Quasiconvex Functions

Introduction to Convex Analysis Microeconomics II - Tutoring Class

Quasi-relative interior and optimization

Lecture 1: Background on Convex Analysis

Convex Geometry. Carsten Schütt

WEAK CONVERGENCE OF RESOLVENTS OF MAXIMAL MONOTONE OPERATORS AND MOSCO CONVERGENCE

Transcription:

J. Math. Anal. Appl. 334 (2007) 261 272 www.elsevier.com/locate/jmaa Relationships between upper exhausters and the basic subdifferential in variational analysis Vera Roshchina City University of Hong Kong, Tat Chee Avenue, Kowloon Tong, Hong Kong Received 16 November 2006 Available online 4 January 2007 Submitted by B.S. Mordukhovich Abstract In this paper we establish a relationship between the basic subdifferential and upper exhausters of positively homogeneous and polyhedral functions. In the case of a finite exhauster this relationship is represented in a form of an equality, and in the case of a Lipschitz function an inclusion formula is obtained. 2006 Elsevier Inc. All rights reserved. Keywords: Basic subdifferential; Fréchet subdifferential; Positively homogeneous function; Upper and lower exhausters 1. Introduction Upper and lower exhausters of a positively homogeneous functions were introduced in [1]. For the historic background and more details the reader may refer to [1] and [2]. Exhausters provide a very nice framework for studying various nonsmooth problems. One can easily check necessary and sufficient optimality conditions and find steepest descent and ascent directions. Both these tasks are reduced to a sequence of convex problems, which can be easily solved with the existing tools. The calculus of exhausters is already well developed (see [2]), and what is important, the calculus rules are provided in the form of equalities. Note that some nonsmooth constructions, being very useful in theoretical aspect, have serious limitations for the use in practice because of the lack of good calculus rules. For example, the Generalized Newton Method (see [8]) uses * Fax: +(852) 2788 8561. E-mail address: vera.roshchina@gmail.com. 0022-247X/$ see front matter 2006 Elsevier Inc. All rights reserved. doi:10.1016/j.jmaa.2006.12.059

262 V. Roshchina / J. Math. Anal. Appl. 334 (2007) 261 272 elements from the Clarke Generalized Jacobian, which in not always easy to evaluate even for some simple functions, due to the calculus rules in the form of inclusions. It has been shown recently that many nonsmooth constructions (Clarke, Fréchet and Michel- Penot subdifferentials) can be expressed via upper and lower exhausters (see [3]). In the current paper we continue this study and introduce the relationship between exhausters and the basic subdifferential. The basic (limiting, Mordukhovich) subdifferential was introduced by Mordukhovich in [6] and is used as the basic construction in Variational Analysis (see [7]). In the current paper we study the relationship between the exhausters and the basic subdifferential in the finite-dimensional setting. The paper is organized as follows. In Section 2 we briefly introduce the notion of exhausters, in Section 3 the relationship between exhausters and the Fréchet subdifferential is studied. In Section 4 we review some facts from the theory of Painlevé Kuratowski set convergence, which are used in Section 5, where the relationships between upper exhausters and the basic subdifferential of positively homogeneous and polyhedral functions are studied. Section 6 introduces an illustrative example, and Section 7 contains conclusive remarks. 2. Upper and lower exhausters of directionally differentiable functions Let X R n be an open set. Recall that a function f : X R is called Hadamard directionally differentiable at a point x X, if for every g R n there exists the following limit f f(x+ αg ) f(x) (x; g) = lim. [α,g ] [+0,g] α The quantity f (x; g) is called the Hadamard directional derivative of the function f at the point x in the direction g. Hadamard directional derivative is a positively homogeneous function. Recall that a function h : R n R is positively homogeneous (p.h.), if h(λx) = λh(x) x R n,λ 0. Every upper semicontinuous (u.s.c.) positively homogeneous function h can be represented as a lower envelope of a family S of proper sublinear functions (see [2]), that is, h(x) = inf s(x). (1) s S By the Minkowski duality, for each proper sublinear function s : R n R we have s(x) = max v,x, where C is a compact convex set. Hence, we can rewrite (1) as follows: h(x) = inf max v,x, C E h where E h is a family of compact convex sets (subdifferentials of functions in S ). Such a family of sets is called an upper exhauster of h. Analogously, every lower semicontinuous (l.s.c.) p.h. function h can be represented as h(x) = sup min v,x, C E h where E h is a family of compact convex sets called a lower exhauster of h at x. If both upper and lower exhausters E h and E h exist (in this case h is continuous), then the pair [E h, E h] is called a biexhauster of h.

V. Roshchina / J. Math. Anal. Appl. 334 (2007) 261 272 263 Since Hadamard directional derivative is a positively homogeneous function of a direction, it can be studied by means of exhausters. That is, let f (x; g) be the Hadamard directional derivative of the function f at the point x. Iff (x; g) is upper semicontinuous, then it can be represented as f (x; g) = inf max v,g, C E f(x) where the family of compact convex sets E f(x)is an upper exhauster of f at a point x. Analogously, if f (x; g) is lower semicontinuous, we have f (x; g) = sup min v,g, C E f(x) where E f(x)is a lower exhauster of f at the point x. 3. Relationships between Fréchet subdifferential and upper exhausters In this section we discuss the relationship between the Fréchet subdifferential and upper exhausters and derive some interesting results from it. One is that the intersections of sets in different upper exhausters of the same function always coincide. The second one is that we get a very easy way to construct the Fréchet subdifferential of a Hadamard directionally differentiable function if the upper exhauster is known. First, recall the definition of the Fréchet subdifferential (see [7, 1.3.2]). Let f : X R, where X is an open set in R n, x 0 R n. Then the set { ˆ f(x } 0 ) = v R n (f (x) f(x 0 )) v,x x 0 lim inf 0 is called the Fréchet subdifferential of the function f at the point x 0. It is not difficult to observe (see [4]), that for a positively homogeneous function h : R n R the following representation holds: ˆ h(0 n ) = { v h(x) v,x 0 x R n}. The following theorem (see [3]) provides a relationship between the upper exhauster and the Fréchet subdifferential of a p.h. function. Theorem 1. Let E h be an upper exhauster of a p.h. function h : R n R. Then C = ˆ h, C E h where ˆ h is the Fréchet subdifferential of h at 0 n. (2) The proof of this theorem is straightforward, and can be found in [3]. The Fréchet subdifferential is uniquely defined, while an upper exhauster is not, hence, from Theorem 1 we have the following corollary. Corollary 1. Let E1 h and E 2 h be two upper exhausters of the same p.h. function h : Rn R, then C = C. C E1 h C E2 h

264 V. Roshchina / J. Math. Anal. Appl. 334 (2007) 261 272 It is not difficult to observe that if a function f : R n R is Hadamard directionally differentiable at a point x R n, then ˆ f(x) = ˆ h x (0 n ), where h x (g) = f (x; g) for all g R n. This observation makes it easy to calculate the Fréchet subdifferentials of a Hadamard differentiable function with a known upper exhauster using the expression (2). Note that symmetrically to the Fréchet (lower) subdifferential an upper construction can be defined, and the similar results can be stated in the terms of lower exhausters (see [3] for more details). 4. Set convergence In this section we review some basics from the theory of Painlevé Kuratowski set convergence. First, define the following collections of sets in N (see [9, Chapter 4]): N := {N N N \ N finite}, N := {N N N infinite}. That is, the collection N consists of all the sequences of natural numbers containing all k beyond some n 0, and N is the set of all subsequences of N. Definition 1. For a sequence {C n } of subsets of R n, the outer limit is the set Lim sup C n = { x R n N N, x n C n (n N) with x n x }, while the inner limit is the set Lim inf C n = { x R n N N, x n C n (n N) with x n x }. The limit of a sequence exists if the outer and inner limit sets are equal: Lim C n = Lim sup C n = Lim inf C n. We capitalize the first letter of the notations for the set-related limits to avoid any possible confusion with limits of sequences of points. When Lim C n exists in the sense of Definition 1 and equals C, then the sequence {C n } is said to converge to C in the sense of Painlevé Kuratowski. It is said that a sequence {C n } escapes to the horizon, if it eventually departs from any bounded region in R n. In other words, for any ε>0 there exists N N such that C n B ε = n N. In this case Lim sup C n =. We recall some basic facts about set convergence, which will be used in what follows. The proof of Proposition 1 can be found in [9, Chapter 4]. Proposition 1. For a sequence {C n } of convex sets in R n, Lim inf C n is a closed convex set, and so too, if it exists, Lim C n. Proposition 2. If a sequence of sets does not escape to the horizon, then there exists a converging subsequence.

V. Roshchina / J. Math. Anal. Appl. 334 (2007) 261 272 265 Proof. From Corollary 4.11 in [9] we know that the condition Lim sup C n = holds if and only if the sequence {C n } escapes to the horizon. Hence, in the case when the sequence does not escape to the horizon, the outer limit is nonempty, and by the cluster description of outer limits (Proposition 4.19 in [9]) we have Lim sup C n = C, C L where L is the set of cluster points of {C n }. Hence, there exists at least one converging subsequence of {C n }. Lemma 1. Let {C n } be a sequence of sets in R n, such that C n C 0 R n, and {ρ n } be a sequence of positive numbers, such that ρ n. Then Lim [C n ρ n B]= Lim C n = C 0, (3) where B is the unit ball in R n. Proof. It is not difficult to observe that Lim inf [C n ρ n B] Lim sup[c n ρ n B] Lim sup C n = Lim C n = C 0. (4) Let v 0 C 0. Then there exists a sequence of points {v n }, v n C n, such that v n v 0.The sequence {v n } is bounded, hence, there exists sufficiently large N, such that v n C n ρ n B for every n>n. Then v 0 Lim inf [C n + ρ n B]. Due to the arbitrariness of v 0 C 0 we have C 0 Lim inf [C n ρ n B]. Now (3) follows from (4) and (5). (5) Definition 2. For a collection of sets E in R n we define its closure in the sense of set convergence cl E as follows: cl E = { C 0 R n } {C n },C n E n N, C n C 0. Proposition 3. Let E be a collection of sets in R n, such that no sequence in E escapes to the horizon, and let cl E be its closure in the sense of set convergence. Then cl(cl E) = cl E. Proof. First of all, note that cl E cl(cl E), so the only thing we have to prove is the opposite inclusion. Let C 0 cl(cl E). Then there exists a sequence of sets {C n } cl E converging to C 0. Consider two sequences of positive numbers {ρ n } and {ε n }, such that ρ n, ε n 0. By Theorem 4.10 in [9] for every n there exists a set C n E, such that C n ρ n B C n + ε n B and C n ρ n B C n + ε n B. (7) Since neither sequence in E escapes to the horizon, without loss of generality we may assume that C n C 0 cl E by Proposition 2. Since ε n 0, we have (6)

266 V. Roshchina / J. Math. Anal. Appl. 334 (2007) 261 272 Lim C n + ε n B = Lim C n = C 0, From Lemma 1 we have Lim C n + ε n B = Lim C n = C 0. (8) Lim [C n ρ n B]= Lim C n = C 0, Lim [ C n ρ n B]= Lim C n = C 0. (9) It follows from (7) (9) that C 0 C 0 and C 0 C 0, hence, C 0 = C 0 cl E. Due to the arbitrariness of C 0 cl(cl E) we have cl(cl E) cl E, which together with (6) yield cl(cl E) = cl E. Definition 3. We say that a collection E of sets in R n is totally bounded, if there exists L>0, such that v L v C, C E. Proposition 4. Let a family of sets E be totally bounded. Then its closure cl E is also a totally bounded family of sets. The proof is straightforward. Proposition 5. Let {C n } be a totally bounded sequence of compact convex sets, and C n C 0 R n. Then for every fixed x R n lim max v,x =max v,x. (10) n 0 Proof. It follows from Propositions 1 and 4, that C 0 is a compact convex set. Fix any arbitrary x R n. Then there exists v 0 C 0, such that max v,x = v 0,x. 0 There exists a sequence {v n }, v n C n, v n v 0.Wehave lim v n,x = lim v [ n v 0 + v 0,x = lim vk v 0,x + v 0,x ] = v 0,x. Further, lim inf max v,x lim v k,x = v 0,x =max v,x. (11) n 0 Now we only have to show the opposite inequality. For every n we can find w n C n such that max v,x = w n,x, n and choose a subsequence {w ns }, such that lim sup max v,x = lim w n n n s s,x. Since {w ns } is bounded, without loss of generality we may assume that it converges to some w 0 C 0, hence, lim sup max v,x = lim w n n n s s,x = w 0,x max v,x, 0 which together with (11) yield (10).

V. Roshchina / J. Math. Anal. Appl. 334 (2007) 261 272 267 5. Relationships between the basic subdifferential and upper exhausters For a continuous function f : X R the basic subdifferential at a point x 0 R n can be defined as follows (see Theorem 1.89 in [7]): f (x 0 ) = Lim sup ˆ f (x), (12) x x 0 where ˆ f(x) is the Fréchet subdifferential of the function f at a point x X. Let h be a p.h. continuous function, and let E h be its upper exhauster. For every C E h we denote h C (x) = max v,x x Rn, then h(x) = inf h C(x) x R n. C E h 5.1. Lipschitz functions Lemma 2. Let E h be a totally bounded upper exhauster of a p.h. function h : R n R. Then cl E h is also an upper exhauster of h and h(x) = min max v,x. C cl E h (13) Proof. First of all, we show that the maximum and minimum in (13) are attained. It follows from Proposition 1 that every set in cl E h is closed and convex, and from Proposition 4 we have that every set in cl E h is bounded, hence, all the sets in cl E h are convex and compact and the maximum in (13) is attained. Consider any arbitrary x R n. There exists a sequence of sets {C n } cl E h, such that inf h C(x) = lim h C cl E C h n (x). Since the sequence of sets {C n } is totally bounded, it does not escape to the horizon, and by Propositions 2 and 3 without loss of generality we may assume that C n C 0 cl E h.by Proposition 5 we have lim max v,x =max v,x, n 0 hence, the minimum in (13) is attained for every x R n. Since E h cl E h,wehave h(x) min max v,x. (14) C cl E h Take any C 0 cl E h. There exists a sequence of sets {C n } E h, such that C n C 0.By Proposition 5 and the definition of an upper exhauster we have max v,x = lim max v,x h(x). 0 n Due to the arbitrariness of C 0 cl E h we have h(x) min max v,x. C cl E h It follows from Eq. (14) and the last expression that (13) holds.

268 V. Roshchina / J. Math. Anal. Appl. 334 (2007) 261 272 Lemma 3. For a p.h. function h : R n R with a totally bounded upper exhauster E h and for every x R n the following holds: ˆ h(x) ˆ h C (x). (15) C cl E h h C (x)=h(x) Proof. Let v ˆ h(x). By the definition of the Fréchet subdifferential we have h(x) h(x 0 ) v,x x 0 lim inf 0. For every x R n and C cl E h, such that h C (x 0 ) = h(x 0 ) (note that the set of such C is not empty due to Lemma 2), we have h C (x) h(x) (since cl E h is an upper exhauster of h by Lemma 2). Then for every v ˆ h we have h C (x) h C (x 0 ) v,x x 0 h C (x) h(x 0 ) v,x x 0 lim inf = lim inf h(x) h(x 0 ) v,x x 0 lim inf 0, which yields the inclusion ˆ h(x 0 ) ˆ h C (x 0 ) for every C cl E h, such that h C (x 0 ) = h(x 0 ), hence (15) holds. Lemma 4. For a p.h. continuous function h we have h(0 n ) = cl ˆ h(x), x S {0 n } where S is the unit sphere in R n. Proof. Due to the positive homogeneity of h for every x R n and λ>0wehave ˆ h(λx) = ˆ h(x). Hence, from (12) we get h(0 n ) = cl x S {0 n } x S {0 n } ˆ h(x). C cl E h h C (x)=h(x) Theorem 2. Let a p.h. function h : R n R have a totally bounded upper exhauster E h, then the following representation is valid: { } h(0 n ) cl arg max v,x, where cl E h is the closure of E h in the sense of set convergence. Proof. Follows from Lemmas 4, 3 and the representation of a subdifferential of a sublinear function (e.g. see Example 3 in [5, Chapter 1, Section 3]). Remark 1. Since a p.h. function h has a totally bounded upper exhauster if and only if it is Lipschitz (see [3]), Theorem 2 holds for any p.h. Lipschitz function.

V. Roshchina / J. Math. Anal. Appl. 334 (2007) 261 272 269 5.2. Functions with finite upper exhausters Let a p.h. function h : R n R have a finite upper exhauster, that is, h(x) = min max v,x x C E h Rn, (16) where E h is a finite family of compact convex sets. For every x R n and C E h denote h C (x) = max v,x, then (16) can be rewritten as h(x) = min h C(x). (17) C E h For every x R n by I(x)we denote the active subset of E h: I(x)= { C E h h(x) = h C (x) }. It follows from the representation (17) that I(x)is nonempty for every x R n. Moreover, I(0) = E h. Since E h is finite, for every x 0 there exists a neighborhood N(x 0 ) of x 0, such that h(x) = min h C(x) x N(x 0 ). (18) C I(x 0 ) Now we get a representation of the Fréchet subdifferential via upper exhauster. Lemma 5. For a p.h. function h defined by (16) and every x 0 R n the following representation holds: ˆ h(x 0 ) = { arg max v,x 0 }. (19) C I(x 0 ) Proof. Fixanarbitraryx 0 R n and v C I(x 0 ) ˆ h C (x 0 ). By the definition of the Fréchet subdifferential we have h C (x) h C (x 0 ) v,x x 0 lim inf 0 C I(x 0 ). Hence, min C I(x0 ) h C (x) h(x 0 ) v,x x 0 lim inf 0, and we get the inclusion ˆ h(x 0 ) ˆ h C (x 0 ). C I(x 0 ) The opposite inclusion follows from Lemma 3 (since E h is finite, we have cl E h = E h). Hence, we have ˆ h(x 0 ) = ˆ h C (x 0 ). C I(x 0 ) Now (19) follows from the above equality and the representation of a convex subdifferential of a sublinear function.

270 V. Roshchina / J. Math. Anal. Appl. 334 (2007) 261 272 Corollary 2. For a p.h. function h defined by (16), the following holds: ˆ h(0 n ) = C. C E h Proof. Note that I(0 n ) = E h and {arg max v,0 n } = C. Then the result immediately follows from Lemma 5. Remark 2. Note that the above result had already been obtained in a more general form in Section 3. Theorem 3. Let h : R n R be a p.h. function defined by (16). Then its basic subdifferential at 0 n can be represented as { h(0 n ) = cl arg max v,x }, or, equivalently, h(0 n ) = x S {0 n } C I(x) C E h C cl x S C I(x) { arg max v,x }. Proof. Follows directly from Lemmas 5 and 4. 5.3. Polyhedral functions We say that a function f : R n R is polyhedral, if it can be represented as f(x)= min max l ij (x), i I j J i where I and J i, i I, are index sets and l ij are affine functions. Note that due to the finiteness of the index sets J i and I, every polyhedral function f locally coincides with some polyhedral positively homogeneous function h, and an upper exhauster of h is a finite collection of polyhedral sets. Hence, all the results from the last two sections can also be applied to these functions, and, moreover, these results can be simplified. The next lemma is a reformulation of Theorem 3. Lemma 6. For a p.h. polyhedral function h we have h(0 n ) = ˆ h(x) = { } arg max v,x. (20) x S {0 n } x S {0 n } C I(x) Proof. Taking into account Theorem 3, we only have to show that ˆ h(x) = cl ˆ h(x). x S {0 n } x S {0 n } For every x R n bylemma5wehave ˆ h(x) = { } arg max v,x. (21) C I(x) Note that since every C is polyhedral, and the exhauster is finite, there is also a finite amount of different sets which could be met in the right-hand side of (21) for all x, and all of these sets are closed. Any finite union of closed sets is closed, hence, we have (20).

V. Roshchina / J. Math. Anal. Appl. 334 (2007) 261 272 271 6. Example To illustrate the results obtained in Sections 3 and 5, we provide an example. It demonstrates how to obtain the Fréchet and basic subdifferentials via an upper exhauster of a p.h. function. Example 1. Let h(x) = x 1 +x 2, or, equivalently, h(x) = min { max{x 2 + x 1,x 2 x 1,x 1 x 2 }, max{x 2 + x 1,x 2 x 1, x 1 x 2 } }. Then E h ={C 1,C 2 },where(seefig.1(a)) C 1 = co { (1, 1), (1, 1), ( 1, 1) }, C 2 = co { ( 1, 1), ( 1, 1), (1, 1) }. Let us see how to get the Fréchet subdifferential from the upper exhauster. By Theorem 1 we have (see the hatched area on Fig. 1(b)): ˆ h(0 n ) = C 1 C 2 = co { (0, 0), (1, 1), ( 1, 1) }. For the evaluation of the basic subdifferential we have to use the formulae from Lemma 6. Note that { {1, 2}, (x1,x 2 ) {x 2 0} {x 2 < 0, x 1 = 0}, I(x 1,x 2 ) = {1}, (x 1,x 2 ) {x 1 < 0, x 2 < 0}, {2}, (x 1,x 2 ) {x 1 > 0, x 2 < 0}. Hence, we get {(1, 1)}, x 2 > x 1,x 1 > 0, co{(1, 1), ( 1, 1)}, x 1 = 0, x 2 > 0, {( 1, 1)}, x 2 >x 1,x 1 < 0, { } co{( 1, 1), (1, 1)}, x 2 = x 1,x 1 < 0, arg max v,x = {(1, 1)}, x 1 < 0, x 2 <x 1, i i I(x 1,x 2 ), x 1 = 0, x 2 < 0, {( 1, 1)}, x 1 > 0, x 2 < x 1, co{( 1, 1), (1, 1)}, x 2 = x 1,x 1 > 0, co{(1, 1), ( 1, 1), (0, 0)}, x 1 = x 2 = 0. At last, taking the union of all sets in the last equality for all (x 1,x 2 ) S 2 {0 2 }, we get (see Fig. 1(c)): h(0, 0) = co { (1, 1), ( 1, 1), (0, 0) } co { ( 1, 1), (0, 0) } co { (1, 1), (0, 0) }. (a) (b) (c) Fig. 1. Example 1.

272 V. Roshchina / J. Math. Anal. Appl. 334 (2007) 261 272 7. Conclusions In the current paper we have studied some relationships between upper exhausters and the basic subdifferential. Only positively homogeneous functions in finite-dimensional case were considered, however, the further study of these two objects in more general setting is of a significant interest. It is possible to define exhausters in Banach spaces, more details on this topic can be found in [10]. Exhausters are essentially constructive objects, which can be easily employed in practice as a standard tool for studying nonsmooth problems, as well as convenient tools for evaluation of other nonsmooth constructions. Acknowledgments The author is grateful to Professor B.S. Mordukhovich for suggesting the topic of this research and for lots of priceless advice, and to the anonymous referee for his valuable remarks. References [1] V.F. Demyanov, Exhausters of a positively homogeneous function, Optimization 45 (1999) 13 29. [2] V.F. Demyanov, Exhausters and convexificators new tools in nonsmooth analysis, in: V. Demyanov, A. Rubinov (Eds.), Quasidifferentiability and Related Topics, Kluwer Academic, Dordrecht, 2000, pp. 85 137. [3] V.F. Demyanov, V.A. Roshchina, Exhausters, optimality conditions and related problems, J. Global Optim., 2006, submitted for publication. [4] A.Ya. Kruger, On Fréchet subdifferential, J. Math. Sci. 116 (3) (2003) 3325 3358. [5] G.G. Magaril-Ilyaev, V.M. Tikhomirov, Convex Analysis: Theory and Applications, Transl. Math. Monogr., Amer. Math. Soc., Providence, RI, 2003. [6] B.S. Mordukhovich, Maximum principle in the problem of time optimal response with nonsmooth constraints, J. Appl. Math. Mech. 40 (6) (1976) 960 969. [7] B.S. Mordukhovich, Variational Analysis and Generalized Differentiation I. Basic Theory, Grundlehren Math. Wiss., vol. 330, Springer-Verlag, Berlin, 2006. [8] L. Qi, J. Sun, A nonsmooth version of Newton s method, Math. Program. 58 (1993) 353 367. [9] R.T. Rockafellar, R.J.-B. Wets, Variational Analysis, Grundlehren Math. Wiss., vol. 317, Springer-Verlag, Berlin, 1998. [10] A. Uderzo, Convex approximators, convexificators and exhausters: Applications to constrained extremum problems, in: V. Demyanov, A. Rubinov (Eds.), Quasidifferentiability and Related Topics, Kluwer Academic, Dordrecht, 2000, pp. 297 327.