∎
22email: [email protected], ORCID: 0000-0003-2579-3601 33institutetext: A. Y. Kruger (corresponding author) 44institutetext: Optimization Research Group, Faculty of Mathematics and Statistics, Ton Duc Thang University, Ho Chi Minh City, Vietnam
44email: [email protected], ORCID: 0000-0002-7861-7380 55institutetext: Nguyen Hieu Thao 66institutetext: School of Science, Engineering and Technology, RMIT University Vietnam, Ho Chi Minh City, Vietnam
66email: [email protected], ORCID: 0000-0002-1455-9169
Extremality of families of sets and set-valued optimization
Abstract
The paper explores a new extremality model involving collections of arbitrary families of sets. We demonstrate its applicability to set-valued optimization problems with general preferences, weakening the assumptions of the known results and streamlining their proofs.
Keywords:
extremal principle separation optimality conditions set-valued optimizationMSC:
49J52 49J53 49K40 90C30 90C461 Introduction
The paper explores another extension of the extremal principle introduced recently in CuoKruTha24 . The conventional extremal principle KruMor80 ; MorSha96 ; Mor06.1 covers a wide range of problems in optimization and variational analysis as demonstrated, e.g., in the books BorZhu05 ; Mor06.1 ; Mor06.2 . At the same time, there exist problems, mainly in multiobjective and set-valued optimization described via closed preference relations, that cannot be covered within the framework of linear translations (as in the conventional principle). The first example of this kind was identified in Zhu Zhu00 . Fortunately, such problems can be handled with the help of a more flexible extended version of the extremal principle using nonlinear perturbations (deformations) of the sets defined by set-valued mappings. Such an extension was developed in Mordukhovich et al. MorTreZhu03 (see also BorZhu05 ; Mor06.2 ) and applied by other authors to various multiobjective problems ZheNg06 ; LiNgZhe07 ; Bao14.2 .
The model in MorTreZhu03 exploits non-intersection of perturbations of given sets . The perturbations are chosen from the respective families of sets determined by given set-valued mappings on metric spaces. In the particular case of linear translations, i.e., when, for all , and , the model reduces to the conventional extremal principle. It was shown by examples in MorTreZhu03 ; Mor06.2 that the framework of set-valued perturbations is richer than that of linear translations. With minor modifications in the proof, the conventional extremal principle was extended to the set-valued setting producing a more advanced model.
This model has been refined in CuoKruTha24 , making it more flexible and, at the same time, simpler. The refined model studies extremality and stationarity of nonempty families of arbitrary sets and is applicable to a wider range of variational problems. The next definition and theorem are simplified versions of (CuoKruTha24, , Definition 3.2 and Theorem 3.4), respectively.
Definition 1 (Extremality and stationarity: families of sets).
Let be families of subsets of a normed space , and . The collection is
-
(i)
extremal at if there is a such that, for any , there exist such that and .
-
(ii)
stationary at if, for any , there exist a and such that and .
-
(iii)
approximately stationary at if, for any , there exist a , and such that and .
Theorem 1.1.
Let be families of closed subsets of a Banach space , and . If is approximately stationary at , then, for any , there exist , , and such that
If is Asplund, then in the above assertion can be replaced by .
The symbols and in the above theorem denote, respectively, the Clarke and Fréchet normal cones. Recall that a Banach space is Asplund if every continuous convex function on an open convex set is Fréchet differentiable on a dense subset Phe93 , or equivalently, if the dual of each its separable subspace is separable. We refer the reader to Phe93 ; Mor06.1 for discussions about and characterizations of Asplund spaces. All reflexive, particularly, all finite dimensional Banach spaces are Asplund. Most assertions involving Fréchet normals, subdifferentials and coderivatives are only valid in Asplund spaces; see MorSha96 .
Remark 1.
-
(i)
Part ii of Definition 1 is the explicit form of (CuoKruTha24, , Definition 3.2 (iii)), while part iii is a particular case of (CuoKruTha24, , Definition 3.2 (ii)) with , thus, representing the weakest version of the property in (CuoKruTha24, , Definition 3.2 (ii)).
- (ii)
- (iii)
-
(iv)
For each , the sets making the family in Definition 1 can be considered as perturbations of some given set . With this interpretation in mind, Definition 1 i covers the definition of extremality with respect to set-valued perturbations in MorTreZhu03 ; Mor06.2 . Note that the “perturbation” sets in MorTreZhu03 ; Mor06.2 are rather loosely connected with the given sets.
Example 1.
Let consist of a single one-point set , and be a family of singletons for . It is easy to see that is extremal at in the sense of Definition 1 i (even with ). The subsets of may be considered as “perturbations” of the sets in the sense of MorTreZhu03 ; Mor06.2 . The pair is clearly not extremal at in the conventional sense of KruMor80 ; Mor06.1 .
The more general (and simpler) model in Definition 1 and Theorem 1.1 is capable of treating a wider range of applications. In this paper, we demonstrate the applicability of Theorem 1.1 to set-valued optimization problems with general preference relations. This allows us to expand the range of set-valued optimization models studied in earlier publications, weaken their assumptions and streamline the proofs.
We study extremality/stationarity properties of the triple , where is a set-valued mapping between normed spaces, is a subset of , and is a nonempty family of subsets of . The latter family may, in particular be determined by an abstract level-set mapping defining a preference relation on .
Members of do not have to be simply translations (deformations) of a fixed set (ordering cone). Extremality/stationarity properties of the triple reduce to the corresponding properties of the two special families of subsets of which involve , and products of and members of . The properties are illustrated by examples. Application of Theorem 1.1 yields necessary conditions for approximate stationarity and, hence, also stationarity and extremality. Natural qualification conditions in terms of Clarke or Fréchet coderivatives and normal cones are provided, which allow one to write down the necessary conditions in the form of an abstract multiplier rule. The statements cover the corresponding results in MorTreZhu03 ; ZheNg05.2 ; ZheNg06 .
Requirements on preference relations defined by level-set mappings, making them meaningful in optimization and applications, are discussed. A certain subset of properties, which are satisfied by most conventional and many other preference relations, is established. The properties are shown to be in general weaker than those used in Mor06.2 ; Bao14.2 ; KhaTamZal15 , but still sufficient for the corresponding set-valued optimization problems to fall within the theory developed in the current paper. Several multiplier rules for problems with a single set-valued mapping, and then with multiple set-valued mappings are formulated.
The structure of the paper is as follows. Section 2 recalls some definitions and facts used throughout the paper. The applicability of Theorem 1.1 is illustrated in Sections 3–5 considering set-valued optimization problems with general preference relations. A model with a single set-valued mapping is studied in Section 3. A particular case of this model when the family is determined by an abstract level-set mapping is considered in Section 4. A more general model with multiple set-valued mappings is briefly discussed in Section 5.
2 Preliminaries
Our basic notation is standard, see, e.g., Mor06.1 ; RocWet98 ; DonRoc14 ; Iof17 . Throughout the paper, if not explicitly stated otherwise, and are normed spaces. Products of normed spaces are assumed to be equipped with the maximum norm. The topological dual of a normed space is denoted by , while denotes the bilinear form defining the pairing between the two spaces. The open ball with center and radius is denoted by . If , we write instead of . The open unit ball is denoted by with a subscript indicating the space, e.g., and . Symbols and stand for the real line and the set of all positive integers, respectively.
The interior and closure of a set are denoted by and , respectively. The distance from a point to a subset is defined by , and we use the convention .
Given a subset of a normed space and a point , the sets (cf. Kru03 ; Cla83 )
(1) | |||
(2) |
are the Fréchet and Clarke normal cones to at , where stands for the Clarke tangent cone to at :
The sets (1) and (2) are nonempty closed convex cones satisfying . If is a convex set, they reduce to the normal cone in the sense of convex analysis:
By convention, we set if .
A set-valued mapping between two sets and is a mapping, which assigns to every a (possibly empty) subset of . We use the notations and for the graph and the domain of , respectively, and for the inverse of . This inverse (which always exists with possibly empty values at some ) is defined by , . Obviously .
If and are normed spaces, the Clarke coderivative of at is a set-valued mapping defined by
(3) |
Replacing the Clarke normal cone in (3) by the Fréchet one, we obtain the definition of the Fréchet coderivative.
Definition 2 (Aubin property).
A mapping between metric spaces has the Aubin property at if there exist and such that
(4) |
The number is called the modulus of the Aubin property at .
Aubin property is among the most widely used properties of set-valued mappings in variational analysis (see, e.g., AubFra90 ; RocWet98 ; Mor06.1 ; DonRoc14 ; Iof17 ). It is known, in particular, to be equivalent to the metric regularity of the inverse mapping. It also yields estimates for the normals to the graph of the (given) mapping.
Lemma 1.
Let and be normed spaces, , and .
-
(i)
If has the Aubin property at with modulus , then there is a such that
(5) -
(ii)
If , then in the above assertion can be replaced by .
Proof.
- (i)
-
(ii)
Suppose , and has the Aubin property at with modulus , i.e., condition (4) is satisfied for some . Let and . Take any sequences and such that and as . Fix an arbitrary . Without lost generality, we can assume that and for all . By (4), for each , there exists a point such that . Set . Then . Passing to subsequences, we can suppose that . Observe that as , and for each . Thus, , and . By the definition of the Clarke normal cone, we have . Since vector is arbitrary, it follows that .
3 Set-valued optimization: a single mapping
Let and be normed spaces, , , and . To model the setting of Definition 1, we consider a nonempty family of subsets of , and define two families of subsets of :
(6) |
The first family consists of the single set , and the first component of each member of the second family is always the given set ; only the second component varies.
To emphasize the structure of the pair (6), when referring to the corresponding properties in Definition 1, we will talk about extremality/stationarity of the triple .
Definition 3.
The triple is extremal (resp., stationary, approximately stationary) at if the pair (6) is extremal (resp., stationary, approximately stationary) at .
Proposition 1.
The triple is
-
(i)
extremal at if and only if there is a such that, for any , there exists an such that , and
(7) -
(ii)
stationary at if and only if for any , there exist a and an such that , and condition (7) is satisfied;
-
(iii)
approximately stationary at if and only if, for any , there exist a , an , and such that , , , and
The next example illustrates relations between the properties in Proposition 1.
Example 2.
Let , , and be given by
Then for all . The following assertions hold true:
-
(i)
is extremal at with ;
-
(ii)
is extremal at with some but not with ;
-
(iii)
is stationary but not extremal at ;
-
(iv)
is approximately stationary at but not stationary at .
The assertions are straightforward. We only prove assertion (iv). Let . Choose any and . Then , and for any with (i.e., for any ). By Proposition 1 (ii), is not stationary at .
The following example shows that the family of sets plays an important role in determining the properties.
Example 3.
Let and be given by
Then .
Application of Theorem 1.1 yields necessary conditions for approximate stationarity and, hence, also stationarity and extremality.
Theorem 3.1.
Let and be Banach spaces, the sets , and all members of be closed. If the triple is approximately stationary at , then, for any , there exist , , , , , and such that
If is Asplund, then in the above assertion can be replaced by .
The normalization condition in Theorem 3.1 ensures that normal vectors to remain sufficiently large when , i.e., and cannot go to simultaneously. The case when vectors are bounded away from (hence, one can assume ) is of special interest as it leads to a proper multiplier rule. A closer look at the alternative: either are bounded away from as , or they are not (hence, vectors remain large), allows one to formulate the following consequence of Theorem 3.1.
Corollary 1.
Let and be Banach spaces, the sets , and all members of be closed. If the triple is approximately stationary at , then one of the following assertions holds true:
-
(i)
there is an such that, for any , there exist , , , , and such that and
(8) -
(ii)
for any , there exist , , and such that
If is Asplund, then and in the above assertions can be replaced by and , respectively.
Proof.
Let the triple be approximately stationary at . By Theorem 3.1, for any , there exist , , , , , and such that and . We consider two cases.
Case 1. . Note that . Set . Let . Choose a number so that and . Set , , , , , , , and . Then , , , , , , , . Furthermore, , hence, ; and , hence, condition (8) is satisfied. Thus, assertion (i) holds true.
Case 2. . Then , and as . Let . Choose a number so that and . Set , , , and . Then , , , , , and . Thus, assertion (ii) holds true.
If is Asplund, then and in the above arguments can be replaced by and , respectively.
Remark 2.
The following condition is the negation of the condition in Corollary 1 (ii).
-
-
there is an such that for all , , and such that .
-
It excludes the singular behavior mentioned in Remark 2 (ii) and serves as a qualification condition ensuring that only the condition in part (i) of Corollary 1 is possible. We denote by the analogue of with and in place of and , respectively.
Corollary 2.
The next proposition provides two typical sufficient conditions for the fulfillment of conditions and .
Proposition 2.
Let and be normed spaces.
-
(i)
If has the Aubin property at , then is satisfied. If, additionally, , then is satisfied too.
-
(ii)
If , then both and are satisfied.
Proof.
- (i)
-
(ii)
If , then for all near , and consequently, for any normal vector to at and any , condition yields . Hence, both and are satisfied with any sufficiently small .
Remark 3.
In view of Proposition 2, each of the Corollaries 1 and 2 covers (ZheNg05.2, , Theorems 3.1 and 4.1) and (ZheNg06, , Theorem 3.1 and Corollary 3.1), which give dual necessary conditions for Pareto optimality, as well as (MorTreZhu03, , Proposition 5.1) for a vector optimization problem with a general preference relation.
The next example illustrates the verification of the necessary conditions for approximate stationarity in Corollaries 1 and 2 for the triple , where is defined in Example 2.
Example 4.
Let , and and be as in Example 2. Thus, the triple is approximately stationary at , and the conclusions of Corollary 1 must hold true. Moreover, the assumptions in both parts of Proposition 2 are satisfied, and consequently, condition holds true. By Corollary 2, assertion (i) in Corollary 1 holds true with and in place of and , respectively. We now verify this assertion.
4 Abstract level-set mapping
We now consider a particular case of the model in Sections 3 when the family is determined by an abstract level-set mapping . The latter mapping defines a preference relation on : if and only if ; see, e.g., (KhaTamZal15, , p. 67).
Given a point , we employ below the following notation:
(9) |
Certain requirements are usually imposed on in order to make the corresponding preference relation meaningful in optimization and applications; see, e.g., Zhu00 ; MorTreZhu03 ; Mor06.2 ; KhaTamZal15 . In this section, we discuss the following properties of at or near the reference point :
-
(O1)
;
-
(O2)
;
-
(O3)
;
-
(O4)
for all near ;
-
(O5)
if and , then ;
-
(O6)
if and , then .
Some characterizations of the properties and relations between them are collected in the next proposition.
Proposition 3.
Proof.
-
(i)
(O1) for any for any , there is a such that . This proves the ‘’ implication. Conversely, let for some . Then , and consequently, , where . The implication ‘’ follows.
- (ii)
-
(iii)
The assertion is a consequence of the definition of in (9).
- (iv)
-
(v)
(O4) . The conclusion follows thanks to (iii).
-
(vi)
The assertion is a consequence of (iii).
Remark 4.
Properties (O4) and (O6) are components of the definition of closed preference relation (see (Mor06.2, , Definition 5.55), (Bao14.2, , p. 583), (KhaTamZal15, , p. 68)) widely used in vector and set-valued optimization. They are called, respectively, local satiation (around ) and almost transitivity. Note that the latter property is actually stronger than the conventional transitivity. It is not satisfied for the preference defined by the lexicographical order (see (Mor06.2, , Example 5.57)) and some other natural preference relations important in vector optimization and its applications including those to welfare economics (see (KhaTamZal15, , Sect. 15.3)). Closed preference relations are additionally assumed in Mor06.2 ; Bao14.2 ; KhaTamZal15 to be nonreflexive, thus, satisfying, in particular, property (O3). In view of Proposition 3, if a preference relation satisfies properties (O3), (O4) and (O6), it also satisfies properties (O1), (O2) and (O5). In this section, we employ the weaker properties (O1) and (O5), which are satisfied by most conventional and many other preference relations. This makes our model applicable to a wider range of multiobjective and set-valued optimization problems compared to those studied in Mor06.2 ; Bao14.2 ; KhaTamZal15 .
The next two examples illustrate some characterizations of the level-set mapping.
Example 5.
Example 6.
We are going to employ in our model the ‘localized’ family of sets
(10) |
Note that members of are not simply translations (deformations) of the fixed set (or ); they are defined by sets where does not have to be equal to .
Remark 5.
Given a set containing , one can naturally define the level-set mapping by for all . Then (10) defines the family of perturbations as the traditional collection of translations of , i.e., .
In the current setting, the properties in Proposition 1 take the following form.
Proposition 4.
Let , and be given by (10). The triple is
-
(i)
extremal at if and only if there is a such that, for any , there exists a such that , and
(11) -
(ii)
stationary at if and only if, for any , there exist a and a such that , and condition (11) is satisfied;
-
(iii)
approximately stationary at if and only if, for any , there exist a , a , and such that , , , and
The statements of Theorem 3.1 and its corollaries can be easily adjusted to the current setting. For instance, Corollary 2 can be reformulated as follows.
Corollary 3.
Let and be Banach spaces, and be closed, , and be given by (10). Suppose that the triple is approximately stationary at . If condition is satisfied, then there is an such that, for any , there exist , , , , and such that , and condition (8) holds true.
If is Asplund and condition is satisfied, then the above assertion holds true with and in place of and , respectively.
The properties in Definition 3 are rather general. They cover various optimality and stationarity concepts in vector and set-valued optimization. With , and as above, and points and , the next definition seems reasonable.
Definition 4.
The point is extremal for on if there is a such that
(12) |
Definition 4 covers both local () and global () extremality. The above concept is applicable, in particular, to solutions of the following set-valued minimization problem with respect to the preference determined by :
() |
Remark 6.
-
(i)
The concept in Definition 4 is broader than just (local) minimality as is not assumed to be an objective mapping of an optimization problem. It can, for instance, be involved in modeling constraints.
-
(ii)
The property in Definition 4 is similar to the one in the definition of fully localized minimizer in (BaoMor10, , Definition 3.1) (see also (KhaTamZal15, , p. 68)). The latter definition uses the larger set in place of in (12). It is not difficult to check that the two properties are equivalent (when ). Unlike many solution concepts in vector optimization, the above definition involves “image localization” (hence, is in general weaker). It has proved to be useful when studying locally optimal allocations of welfare economics; cf. BaoMor10 ; KhaTamZal15 .
We next show that, under some mild assumptions on the level-set mapping , the extremality in the sense of Definition 4 can be treated in the framework of the extremality in the sense of Definition 3 (or its characterization in Proposition 4 (i)).
Proposition 5.
Proof.
In view of (O1), it follows from Proposition 3 (i) that
(13) |
Suppose is not extremal at . Let . By Proposition 4 (i), there exists an such that, for any with , it holds
(14) |
In view of (13), there is a point with , and we can choose a point belonging to the set in (14). Thus, and . Thanks to (O5), we have , and consequently, . Since is arbitrary, is not extremal for on .
5 Set-valued optimization: multiple mappings
It is not difficult to upgrade the model used in Definition 3 and the subsequent statements to make it directly applicable to constraint optimization problems: instead of a single mapping with for some and a single family of subsets of , one can consider finite collections of mappings between normed spaces together with points , and nonempty families of subsets of .
This more general setting can be viewed as a structured particular case of the set-valued optimization model considered in Section 3 if one sets
Thus, , and means that and . To shorten the notation, we keep talking in this section about extremality/stationarity of the triple at .
Definition 5.
The triple is extremal (resp., stationary, approximately stationary) at if the collection of families of sets:
is extremal (resp., stationary, approximately stationary) at , where .
With the notation introduced above, Definitions 1 and 5 lead to characterizations of the extremality and stationarity of the triple given in parts (i) and (ii) of Proposition 1. The corresponding characterization of the approximate stationarity is a little different. It is formulated in the next proposition.
Proposition 6.
The triple is approximately stationary at if and only if, for any , there exist a , , , and such that , , and, for each , there is an such that
Application of Theorem 1.1 in the current setting produces necessary conditions for approximate stationarity and, hence, also stationarity and extremality extending Theorem 3.1 and its corollaries. Condition can be extended as follows:
-
-
there is an such that for all , , and such that ,
-
while the corresponding extension of condition is obtained by replacing and in by and , respectively. An extension of Corollary 3 takes the following form.
Theorem 5.1.
Let , be Banach spaces, and, for each , the graph and all members of be closed. Suppose is approximately stationary at . If condition is satisfied, then there is an such that, for any , there exist , , , , and such that and
If is Asplund and condition is satisfied, then the above assertion holds true with and in place of and , respectively.
Remark 7.
-
(i)
Proposition 2 (with in part (i)) gives two typical sufficient conditions for the fulfillment of conditions and .
- (ii)
-
(iii)
Theorem 5.1 is a consequence of the dual necessary conditions for approximate stationarity of a collection of sets in Theorem 1.1. The latter theorem can be extended to cover a more general quantitative notion of approximate -stationarity (with a fixed ), leading to corresponding extensions of Theorem 5.1 and its corollaries covering, in particular, dual conditions for -Pareto optimality in (ZheNg11, , Theorems 4.3 and 4.5).
Employing the multiple-mapping model studied in this section, one can consider a more general than () optimization problem with set-valued constraints:
() |
where are mappings between normed spaces, , , and is equipped with a level-set mapping . The “functional” constraints in () can model a system of equalities and inequalities as well as more general operator-type constraints.
Using the set of admissible solutions
,
we say that a point is extremal in problem () if it is extremal for on . This means, in particular, that , , and there exist .
We are going to employ the model studied in the first part of this section with objects in place of . There are mappings and sets in (). As in (10), we define , where . Now, set
Using the same arguments, one can prove the next extension of Proposition 5.
Proposition 7.
Condition in the current setting is reformulated as follows:
-
-
there is an such that for all , , and such that ,
-
while the corresponding reformulation of condition is obtained by replacing and in by and , respectively. In view of Proposition 7, Theorem 5.1 yields the following statement.
Corollary 4.
Let , be Banach spaces, the sets , and be closed, and . Suppose satisfies conditions (O1) and (O5). If is extremal in problem () and condition is satisfied, then there is an such that, for any , there exist , , , , , and such that and
If is Asplund and condition is satisfied, then the above assertion holds true with and in place of and , respectively.
Declarations
Funding. Nguyen Duy Cuong is supported by Vietnam National Program for the Development of Mathematics 2021-2030 under grant number B2023-CTT-09.
Conflict of interest. The authors have no competing interests to declare that are relevant to the content of this article.
Data availability. Data sharing is not applicable to this article as no datasets have been generated or analysed during the current study.
Acknowledgments
A part of the work was done during Alexander Kruger’s stay at the Vietnam Institute for Advanced Study in Mathematics in Hanoi. He is grateful to the Institute for its hospitality and supportive environment.
References
- (1) J.-P. Aubin and H. Frankowska. Set-Valued Analysis. Birkhäuser Boston Inc., Boston, MA, 1990. doi:10.1007/978-0-8176-4848-0.
- (2) T. Q. Bao. Extremal systems for sets and multifunctions in multiobjective optimization with variable ordering structures. Vietnam J. Math., 42(4):579–593, 2014. doi:10.1007/s10013-014-0099-6.
- (3) T. Q. Bao and B. S. Mordukhovich. Set-valued optimization in welfare economics. In Advances in Mathematical Economics, volume 13 of Adv. Math. Econ., pages 113–153. Springer, Tokyo, 2010. doi:10.1007/978-4-431-99490-9_5.
- (4) J. M. Borwein and Q. J. Zhu. Techniques of Variational Analysis. Springer, New York, 2005.
- (5) H. T. Bui and A. Y. Kruger. Extremality, stationarity and generalized separation of collections of sets. J. Optim. Theory Appl., 182(1):211–264, 2019. doi:10.1007/s10957-018-01458-8.
- (6) F. H. Clarke. Optimization and Nonsmooth Analysis. John Wiley & Sons Inc., New York, 1983. doi:10.1137/1.9781611971309.
- (7) N. D. Cuong, A. Y. Kruger, and N. H. Thao. Extremality of families of sets. Optimization, 2024. doi:10.1080/02331934.2024.2385656.
- (8) A. L. Dontchev and R. T. Rockafellar. Implicit Functions and Solution Mappings. A View from Variational Analysis. Springer Series in Operations Research and Financial Engineering. Springer, New York, 2 edition, 2014. doi:10.1007/978-1-4939-1037-3.
- (9) A. D. Ioffe. Variational Analysis of Regular Mappings. Theory and Applications. Springer Monographs in Mathematics. Springer, 2017. doi:10.1007/978-3-319-64277-2.
- (10) A. A. Khan, C. Tammer, and C. Zălinescu. Set-Valued Optimization: An Introduction with Applications. Vector Optimization. Springer, Heidelberg, 2015. doi:10.1007/978-3-642-54265-7.
- (11) A. Y. Kruger. On Fréchet subdifferentials. J. Math. Sci. (N.Y.), 116(3):3325–3358, 2003. doi:10.1023/A:1023673105317.
- (12) A. Y. Kruger and B. S. Mordukhovich. Extremal points and the Euler equation in nonsmooth optimization problems. Dokl. Akad. Nauk BSSR, 24(8):684–687, 1980. In Russian. Available from: https://asterius.federation.edu.au/akruger/research/publications.html.
- (13) G. Li, K. F. Ng, and X. Y. Zheng. Unified approach to some geometric results in variational analysis. J. Funct. Anal., 248(2):317–343, 2007.
- (14) B. S. Mordukhovich. Variational Analysis and Generalized Differentiation. I: Basic Theory, volume 330 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer, Berlin, 2006. doi:10.1007/3-540-31247-1.
- (15) B. S. Mordukhovich. Variational Analysis and Generalized Differentiation. II: Applications, volume 331 of Grundlehren der Mathematischen Wissenschaften [Fundamental Principles of Mathematical Sciences]. Springer, Berlin, 2006.
- (16) B. S. Mordukhovich and Y. Shao. Extremal characterizations of Asplund spaces. Proc. Amer. Math. Soc., 124(1):197–205, 1996.
- (17) B. S. Mordukhovich, J. S. Treiman, and Q. J. Zhu. An extended extremal principle with applications to multiobjective optimization. SIAM J. Optim., 14(2):359–379, 2003.
- (18) R. R. Phelps. Convex Functions, Monotone Operators and Differentiability, volume 1364 of Lecture Notes in Mathematics. Springer-Verlag, Berlin, 2nd edition, 1993. doi:10.1007/978-3-662-21569-2.
- (19) R. T. Rockafellar and R. J.-B. Wets. Variational Analysis. Springer, Berlin, 1998.
- (20) X. Y. Zheng and K. F. Ng. The Fermat rule for multifunctions on Banach spaces. Math. Program., 104(1):69–90, 2005. doi:10.1007/s10107-004-0569-9.
- (21) X. Y. Zheng and K. F. Ng. The Lagrange multiplier rule for multifunctions in Banach spaces. SIAM J. Optim., 17(4):1154–1175, 2006. doi:10.1137/060651860.
- (22) X. Y. Zheng and K. F. Ng. A unified separation theorem for closed sets in a Banach space and optimality conditions for vector optimization. SIAM J. Optim., 21(3):886–911, 2011. doi:10.1137/100811155.
- (23) Q. J. Zhu. Hamiltonian necessary conditions for a multiobjective optimal control problem with endpoint constraints. SIAM J. Control Optim., 39(1):97–112, 2000.