Abstract
As a starting point of our research, we show that, for a fixed order , each local minimizer of a rather general nonsmooth optimization problem in Euclidean spaces is either M-stationary in the classical sense (corresponding to stationarity of order 1), satisfies stationarity conditions in terms of a coderivative construction of order , or is asymptotically stationary with respect to a critical direction as well as order in a certain sense. By ruling out the latter case with a constraint qualification not stronger than directional metric subregularity, we end up with new necessary optimality conditions comprising a mixture of limiting variational tools of orders 1 and . These abstract findings are carved out for the broad class of geometric constraints and , and visualized by examples from complementarity-constrained and nonlinear semidefinite optimization. As a byproduct of the particular setting , our general approach yields new so-called directional asymptotic regularity conditions which serve as constraint qualifications guaranteeing M-stationarity of local minimizers. We compare these new regularity conditions with standard constraint qualifications from nonsmooth optimization. Further, we extend directional concepts of pseudo- and quasi-normality to arbitrary set-valued mappings. It is shown that these properties provide sufficient conditions for the validity of directional asymptotic regularity. Finally, a novel coderivative-like variational tool is used to construct sufficient conditions for the presence of directional asymptotic regularity. For geometric constraints, it is illustrated that all appearing objects can be calculated in terms of initial problem data.
Keywords: Asymptotic stationarity and regularity, Constraint qualifications, Directional limiting variational calculus, M-stationarity, Pseudo- and super-coderivatives, Pseudo- and quasi-normality
Introduction
In order to identify local minimizers of optimization problems analytically or numerically, it is desirable that such points satisfy applicable necessary optimality conditions. Typically, under validity of a constraint qualification, first-order necessary optimality conditions of abstract Karush–Kuhn–Tucker (KKT)-type hold at local minimizers. Here, first-order refers to the fact that first-order tools of (generalized) differentiation are used to describe the variation of all involved data functions. In the case where the celebrated tools of limiting variational analysis are exploited, one speaks of so-called Mordukhovich (or, briefly, M-) stationarity, see [66]. In the absence of constraint qualifications, i.e., in a degenerate situation, local minimizers still satisfy a Fritz–John (FJ)-type first-order necessary optimality condition which allows for a potentially vanishing multiplier associated with the generalized derivative of the objective function. Since such a condition allows to discard the objective function, it might be too weak in practically relevant scenarios.
In recent years, asymptotic (approximate or sequential are also common) concepts of stationarity and regularity received much attention not only in standard nonlinear optimization, see [3, 5–7], but also in complementarity-, cardinality-, and switching-constrained programming, see [4, 53, 61, 70], conic optimization, see [2], nonsmooth optimization, see [45, 63, 64], or even infinite-dimensional optimization, see [26, 55, 58]. The interest in asymptotic stationarity conditions is based on the observation that they hold at local minimizers in the absence of constraint qualifications while being more restrictive than the corresponding FJ-type conditions, and that different types of solution algorithms like multiplier-penalty- and some SQP-methods naturally compute such points. Asymptotic constraint qualifications provide conditions which guarantee that an asymptotically stationary point is already stationary in classical sense. It has been reported, e.g., in [5, 61, 63, 70] that asymptotic constraint qualifications are comparatively mild. Inherently from their construction, asymptotic constraint qualifications simplify the convergence analysis of some numerical solution algorithms.
The aim of this paper is to apply the directional approach to limiting variational analysis, see e.g. [18], in order to enrich the asymptotic stationarity and regularity conditions from [58, 63] with the aid of directional information. Noting that the directional tools of variational analysis were successfully applied to find refined M-stationarity-type optimality conditions and mild constraint qualifications for diverse problems in optimization theory, see e.g. [14–16, 36, 38, 39, 42] and the references therein, this seems to be a desirable goal.
Section 4 contains the core of our research. As a starting point, we show in Sect. 4.2 (see, particularly, Theorem 4.1) that local minimizers of rather general optimization problems in Euclidean spaces, which we formally introduce in Sect. 4, are either M-stationary, satisfy a stationarity condition combining the limiting subdifferential of the objective function and a coderivative-like tool associated with the constraints of some arbitrary order , a so-called pseudo-coderivative, see [37], or come along with an asymptotic stationarity condition depending on a critical direction as well as the order where the involved sequence of multipliers is diverging. Even for , this enhances the findings from [58, 63]. Furthermore, this result opens a new way on how to come up with applicable necessary optimality conditions for the original problem, namely, by ruling out the irregular situation of asymptotic stationarity which can be done in the presence of so-called metric pseudo-subregularity of order , see [37] again. In the case , we end up with M-stationarity, and metric pseudo-subregularity reduces to metric subregularity, i.e., we obtain results related to [36]. For , this procedure leads to a mixed-order stationarity condition involving the pseudo-coderivative of order , and metric pseudo-subregularity is weaker than metric subregularity. If and so-called geometric constraints, induced by a twice continuously differentiable mapping g as well as a closed set D, are investigated, this pseudo-coderivative can be estimated from above in terms of initial problem data, i.e., in terms of (first- and second-order) derivatives associated with g as well as tangent and normal cones to D, under mild conditions. These estimates of the pseudo-coderivative of order 2 are interesting on their own and presented in Sect. 3, which is the essence to all applications of our general findings. The associated mixed-order necessary optimality conditions and qualification conditions are worked out in Sect. 4.3, and in Sect. 4.4, they are applied to complementarity-constrained and nonlinear semidefinite optimization problems in order to illustrate our findings. Let us note that related necessary optimality conditions for optimization problems which comprise first- and second-order tools at the same time can be found e.g. in [9, 11–13, 35, 37, 51]. These results are based on the concept of 2–regularity and its extensions, see [11, 74] for its origins. Indeed, even Gfrerer’s metric pseudo-subregularity from [37], utilized in this paper, can be seen as an extension of 2–regularity to arbitrary set-valued mappings. For us, however, these mixed-order conditions are only a by-product - we focus on how they can be used to find new constraint qualifications guaranteeing M-stationarity of local minimizers.
Section 5 is dedicated to the investigation of directional asymptotic regularity conditions, which are motivated by the asymptotic stationarity conditions from Theorem 4.1 (for ) and whose validity directly yields M-stationarity of local minimizers. Roughly speaking, these conditions demand certain control of unbounded input sequences (multipliers) associated with the regular coderivative of the underlying set-valued mapping in a neighborhood of the reference point. We enrich and refine the asymptotic regularity conditions from [63] in two ways. First, the directional approach reveals that asymptotic regularity is only necessary in critical directions. Second, we observe an additional restriction the problematic multipliers satisfy: while their norm tends to infinity, their direction is tightly controlled. These insights enable us to relate our new constraint qualifications with already existing ones from the literature. Similarly as standard asymptotic regularity, the directional counterpart is also independent of (directional) metric subregularity. However, several sufficient conditions for metric subregularity, which are independent of asymptotic regularity, imply directional asymptotic regularity. For instance, this is true for the First-Order Sufficient Condition for Metric Subregularity from [39], see Sect. 5.1. Moreover, in Sect. 5.2, we extend the (directional) concepts of pseudo- and quasi-normality from [15, 16] to abstract set-valued mappings and show that these conditions are sufficient for directional metric subregularity as well as directional asymptotic regularity. Notably, even standard (nondirectional) versions of pseudo- and quasi-normality do not imply asymptotic regularity since the latter does not restrict the direction of the problematic multipliers. Finally, a new directional coderivative-like tool, the directional super-coderivative, see Sect. 2.3, is used in Sect. 5.3 to construct sufficient conditions for the validity of directional asymptotic regularity. In the presence of so-called metric pseudo-regularity, see [37] again, this leads to conditions in terms of the aforementioned pseudo-coderivatives. Noting that these generalized derivatives can be computed in terms of initial problem data for geometric constraint systems, we can specify our findings in this situation. As it turns out, the approach is closely related to our findings from Sect. 4.3. Furthermore, we show that the explicit sufficient conditions for directional asymptotic regularity provide constraint qualifications for M-stationarity which are not stronger than the First- and Second-Order Sufficient Condition for Metric Subregularity from [39].
Notation and preliminaries
We rely on standard notation taken from [10, 25, 66, 71].
Basic notation
Let , , and denote the real, the nonnegative real, and the nonpositive real numbers, respectively. The sign function is defined by for all , for all , and . Throughout the paper, and denote Euclidean spaces, i.e., finite-dimensional Hilbert spaces. For simplicity, the associated inner product will be represented by since the underlying space will be clear from the context. The norm induced by the inner product is denoted by . The unit sphere in will be represented by . Furthermore, for and , is the closed -ball around . We are also concerned with so-called (closed) directional neighborhoods of given directions. These are sets of type
where is a reference direction and . Clearly, . For a nonempty set , the closed convex cone is referred to as the polar cone of Q. Furthermore, for some , and are the annihilator of and the smallest subspace of containing , respectively. By , we denote the distance of to Q. For simplicity, we use . The closure and the horizon cone of Q are represented by and , respectively. For a given linear operator , is used to denote its adjoint while is the image of A.
Let be a continuously differentiable mapping. We use to denote the derivative of g at . Note that is a linear operator. Let us emphasize that, in the special case , does not coincide with the standard gradient which would correspond to . For twice continuously differentiable g and a vector , we set for each in order to denote the associated scalarization mapping . By and we represent the first- and second-order derivatives of this map at (w.r.t. the variable which enters g). Furthermore, for , we make use of
for brevity where is the dimension of and denote the m canonical unit vectors of . In the case , the second-order derivative is a bilinear mapping, and for each , we identify with an element of .
Fundamentals of variational analysis
Let us fix a closed set and some point . We use
to denote the (Bouligand) tangent cone to Q at x. Furthermore, we make use of
the regular (or Fréchet) and limiting (or Mordukhovich) normal cone to Q at x. Observe that both of these normal cones coincide with the standard normal cone of convex analysis as soon as Q is convex. For , we set and . Finally, for some , we use
in order to represent the directional limiting normal cone to Q at x in direction u. Note that this set is empty if u does not belong to . If Q is convex, we have .
The limiting normal cone to a set is well known for its robustness, i.e., it is outer semicontinuous as a set-valued mapping. In the course of the paper, we exploit an analogous property of the directional limiting normal cone which has been validated in [42, Proposition 2].
Lemma 2.1
Let be closed and fix . Then, for each , we have
In this paper, the concept of polyhedrality will be of essential importance. Let us recall that a set will be called polyhedral if it is the union of finitely many convex polyhedral sets. Similarly, it is referred to as locally polyhedral around whenever is polyhedral for some . The following lemma provides some basic properties of polyhedral sets. Statement (a) is proven in [48, Proposition 8.24]. The equality in statement (b) follows from [19, Proposition 2.11] and the rest is straightforward, see [38, Lemma 2.1] as well.
Lemma 2.2
Let be a closed set which is locally polyhedral around some fixed point . Then the following statements hold.
There exists a neighborhood of x such that .
- For arbitrary , we have
If Q is, additionally, convex, and , then the final inclusion holds as an equality.2.1
It is well known that the regular and limiting normal cone enjoy an exact product rule which is not true for the tangent cone in general. However, the following lemma shows that such a product rule also holds for tangents as soon as polyhedral sets are under consideration. Its proof is straightforward and, hence, omitted.
Lemma 2.3
For closed sets and as well as and , we have .
For closed sets and as well as and , such that P and Q are locally polyhedral around x and y, respectively, we have .
Let us mention that a slightly more general version of the above lemma can be found in [41, Proposition 1].
For a set-valued mapping , we use , , , and in order to represent the domain, graph, kernel, and image of , respectively. Furthermore, the so-called inverse mapping is defined via .
There exist numerous concepts of local regularity or Lipschitzness associated with set-valued mappings. In this paper, we are mostly concerned with so-called directional metric pseudo-(sub)regularity which originates from [37, Definition 1].
Definition 2.1
Fix a set-valued mapping which has a closed graph locally around , a pair of directions , and a constant .
- We say that is metrically pseudo-regular of order in direction (u, v) at if there are constants , , and such that the estimate
holds for all with . In the case where this is fulfilled for , we say that is metrically pseudo-regular of order at .2.2 We say that is metrically pseudo-subregular of order in direction u at if there are constants , , and such that (2.2) holds for and all . In the case where this is fulfilled for , we say that is metrically pseudo-subregular of order at .
Metric pseudo-regularity of order in direction (u, 0) at is a sufficient condition for metric pseudo-subregularity of order in direction u at the same point, see [37, Lemma 3]. Observe that metric pseudo-subregularity in a specified direction of some order implies metric pseudo-subregularity of arbitrary order larger than in the same direction. For , the above definition of (directional) metric pseudo-subregularity recovers the one of (directional) metric subregularity, see [36, Definition 1.2]. On the contrary, for , the above definition of directional metric pseudo-regularity does not recover the one of directional metric regularity which demands that (2.2) holds for all such that , see [36, Definition 1.1]. Particularly, for , the notion of directional metric regularity reduces to the classical one of metric regularity, while directional metric pseudo-regularity does not. This was shown in [37, Example 1.1], which is a very natural example, and we will use it to illustrate some novel concepts.
Example 2.1
For every , the mapping , given by , , is metrically pseudo-regular of order at (0, 0). The case provides an example of a mapping which is metrically pseudo-regular of order 1 at (0, 0) but not metrically regular there. The violation of metric regularity is clear as any points approaching 0 come along with , blowing up the left-hand side of (2.2). These problematic elements y are, however, ruled out by the condition in the definition of metric pseudo-regularity, which reads in the present situation.
Another important case, which we will explore in detail, corresponds to . In this case, the notions from Definition 2.1 provide an extension of so-called 2-regularity from [11, 74] to set-valued mappings. In Sect. 3.2, we compare our approach with an extension of 2-regularity to constraint mappings from [8, 9].
Recall that a single-valued function is called calm in direction at whenever there are constants , , and such that
If this holds for , we simply say that g is calm at x. Clearly, the latter property is weaker than Lipschitzness of g at x.
Generalized differentiation
In this section, we recall some notions from generalized differentiation and introduce some novel derivatives for set-valued mappings.
Subdifferentials
Let us start with a lower semicontinuous function and some point . The lower semicontinuous function given by
is referred to as the subderivative of at . The regular (or Fréchet) and limiting (or Mordukhovich) subdifferential of at are given by
respectively, where is the epigraph of . In the case where is continuously differentiable at , both sets reduce to the singleton containing only the gradient . We note that for any sequences and such that , , for some , and for each , we also have , see [71, Proposition 8.7]. This property is referred to as robustness of the limiting subdifferential.
In the case where is locally Lipschitzian around , and for some direction ,
is referred to as the limiting subdifferential of at in direction u. We note that and for all . Furthermore, let us mention that, in the definition of the directional limiting subdifferential, we can equivalently replace the requirement by for each . This can be easily checked by means of a classical diagonal sequence argument. Hence, the directional limiting subdifferential also enjoys a certain kind of robustness.
Graphical derivatives
Below, we introduce three different graphical derivatives of a set-valued mapping. While the standard graphical derivative is well known from the literature, the concepts of graphical pseudo-derivative and graphical subderivative are, to the best of our knowledge, new.
Definition 2.2
Let be a set-valued mapping possessing a closed graph locally around .
- The graphical derivative of at is the mapping given by
In the case where is single-valued at , we use for brevity. Given , the graphical pseudo-derivative of order of at is the mapping which assigns to the set of all such that there are sequences , , and which satisfy , , , and for all .
The graphical subderivative of at is the mapping which assigns to the set of all such that there are sequences , , and which satisfy , , , , , and for all .
Let us note that for every set-valued mapping , whose graph is closed locally around , we have for all . Furthermore, for each , one obtains the trivial estimates
and
| 2.3 |
right from the definition of these objects.
In the course of the paper, we are mainly interested in the graphical (sub)derivative associated with so-called normal cone mappings. In the next lemma, we present some corresponding upper estimates.
Lemma 2.4
Let be a nonempty, closed, convex set such that the (single-valued) projection operator onto D, denoted by , is directionally differentiable. Fix and . Then, for arbitrary , we find
and for , we find
Above, denotes the directional derivative of at in direction .
Proof
By convexity of D, we have the well-known equivalence
In the remainder of the proof, we set for brevity. Next, let us fix as well as and such that , , , and , i.e., , for each . Using , we find
| 2.4 |
In the case where holds, we can choose for each , and taking the limit in (2.4) while exploiting directional differentiability and Lipschitzness of yields . This shows the first estimate.
Now, assume that is valid. Then and can be postulated, and taking the limit in (2.4) shows . By nature of the projection, we have
for each . Exploiting (2.4), this is equivalent to
for each . Some rearrangements and the characterization of the projection lead to
Division by and (2.4), thus, give us for each , and taking the limit, we obtain which shows the second estimate.
Let us note that it has been shown in [75, Theorem 3.1, Corollary 3.1] that the estimate on the graphical derivative of the normal cone mapping holds as an equality in the situation where D is the convex cone of positive semidefinite symmetric matrices, and that the presented proof extends to arbitrary convex cones as long as the associated projection operator is directionally differentiable. This result can also be found in slightly more general form in [67, Theorem 3.3]. In order to make the estimates from Lemma 2.4 explicit, one needs to be in position to characterize the directional derivative of the projection onto the convex set D. This is easily possible if D is polyhedral, see [44] and Remark 3.1, but even in nonpolyhedral situations, e.g., where D is the second-order cone or the cone of positive semidefinite symmetric matrices, closed formulas for this directional derivative are available in the literature, see [69, Lemma 2] and [73, Theorem 4.7], respectively.
The following technical result will become handy later on.
Lemma 2.5
Let be nonempty and closed, and fix . Then the following assertions hold.
For each , we have .
For each , we have .
Proof
We only prove validity of the first assertion. The second one can be shown in analogous fashion.
Fix and . Then we find sequences and with , , , and for each . Since, for each , is a cone, we find , and follows by robustness of the directional limiting normal cone, see Lemma 2.1.
In the next two results, we investigate the special situation in detail. First, in the case where we consider the normal cone mapping associated with polyhedral sets, there is no difference between graphical derivative and graphical subderivative as the subsequent lemma shows.
Lemma 2.6
Let be a polyhedral set. Then is polyhedral as well, and for arbitrary and , we have
Proof
It follows from [1, Theorem 2] that there exist finitely many convex polyhedral sets and closed, convex, polyhedral cones such that . Particularly, is polyhedral.
Next, consider some nonzero with . Then we find and such that , , , , , as well as for all . Thus, we can pick and a subsequence (without relabeling) such that and for all . By convexity of , we also have which shows . The converse implication can be proven in analogous fashion by multiplying the null sequence in the domain space with another null sequence.
The next lemma shows how the graphical derivative of normal cone mappings associated with Cartesian products of polyhedral sets can be computed.
Lemma 2.7
Fix some . For each , let for some be polyhedral. Set , , and . Then we have
and for arbitrary satisfying as well as , we find
Proof
The representation of is a simple consequence of the product rule for the computation of limiting normals, see e.g. [66, Proposition 1.4], and does not rely on the polyhedrality of the underlying sets. Thus, is, up to a permutation of components, the same as . Since, for each , is polyhedral by Lemma 2.6, the same has to hold for . The final formula of the lemma is a simple consequence of Lemma 2.3 and [71, Exercise 6.7].
Coderivatives, pseudo-coderivatives, and super-coderivatives
In the subsequently stated definition, we first recall the notion of regular and limiting coderivative of a set-valued mapping before introducing its so-called directional pseudo-coderivative. The latter will be of essential importance in the course of the paper. It corresponds to a minor modification of the notion of directional pseudo-coderivative introduced by Gfrerer in [37, Definition 2], which we recall as well.
Definition 2.3
Let be a set-valued mapping possessing a closed graph locally around . Furthermore, let be a pair of directions.
- The regular and limiting coderivative of at are the set-valued mappings and given, respectively, by
The set-valued mapping given by
is the limiting coderivative of at in direction (u, v). If is single-valued at , we use for brevity. - Given and , the pseudo-coderivative of order of at in direction (u, v) is the mapping which assigns to the set of all such that there are sequences , , and which satisfy , , , , , and
In the case , this definition recovers the one of .2.5 - Given and , Gfrerer’s pseudo-coderivative of order of at in direction (u, v) is the mapping which assigns to the set of all such that there are sequences , , and which satisfy , , , , , and
Again, for , we recover the definition of .2.6
Let be a set-valued mapping whose graph is closed locally around and fix a pair of directions , , and . Then we obtain the trivial relations
| 2.7 |
Note also that the mappings and have a nonempty graph if and only if while the mapping has a nonempty graph if and only if .
Since the (directional) limiting coderivative is defined via the (directional) limiting normal cone, it possesses a robust behavior as well. In the subsequent lemma, we show a somewhat robust behavior of the directional pseudo-coderivatives under consideration, which will be important later on. Basically, we prove that one can replace the regular by the limiting normal cone in (2.5) and (2.6) without changing the resulting pseudo-coderivative. The technical proof, which is based on a standard diagonal sequence argument, is presented in Appendix A for the purpose of completeness.
Lemma 2.8
Definition 2.3 (b) and Definition 2.3 (c) can equivalently be formulated in terms of limiting normals.
To illustrate the pseudo-coderivatives from Definition 2.3, we revisit Example 2.1.
Example 2.2
For , we consider the mapping , given by , , already discussed in Example 2.1. Set as well as and choose arbitrarily. First, by definition requires sequences and satisfying , , , and for all , showing . Thus, we fix to find for all as the defining sequences satisfy , , and for all . Furthermore, holds for each as the defining sequences satisfy , , and for all . Using similar arguments as above, one can check that yields , and for , we get for all .
Below, we introduce yet another concept of coderivative which will become important in Sect. 5.3.
Definition 2.4
Let be a set-valued mapping with a closed graph and fix and . The super-coderivative of at in direction (u, v) is the mapping , which assigns to the set of all such that there are sequences , , and which satisfy , , , , , , and such that
| 2.8 |
holds for all .
We start with some remarks regarding Definition 2.4. First, observe that we only exploit the super-coderivative w.r.t. unit directions which also means that and can be chosen such that and hold for all . Particularly, condition (2.8) is reasonable.
Second, we would like to note that implies the existence of , , and which satisfy , , , , and as well as for all . Thus, in the light of Definition 2.2 (c) of the graphical subderivative, one might be tempted to say that the pair (u, v) belongs to the graph of the graphical super-derivative of at . This justifies the terminology in Definition 2.4.
Let us briefly discuss the relation between pseudo-coderivatives and the novel super-coderivative from Definition 2.4. Consider and for and . Setting for each , where and are the sequences from the definition of the pseudo-coderivative, we get since .
In the subsequent lemma, we comment on the converse inclusion which, to some extent, holds in the presence of a qualification condition in terms of the pseudo-coderivative.
Lemma 2.9
Let , , , and be fixed. Furthermore, assume that holds. Then there exists such that
Proof
Let be arbitrarily chosen. Then we find sequences , , and which satisfy , , , , , , and as well as (2.8) for all . This also gives us
| 2.9 |
for all . Set for each . In the case where is not bounded, we have along a subsequence (without relabeling), and taking the limit in
yields that contains a nonzero element, which is a contradiction. Hence, is bounded.
For each , we set . First, suppose that is not bounded. Then, along a subsequence (without relabeling), we may assume . By boundedness of , follows. Rewriting (2.9) yields
for each , and taking the limit while respecting , thus, gives . In the case where converges to some (along a subsequence without relabeling), we can simply take the limit in (2.9) in order to find . Finally, let us consider the case (along a subsequence without relabeling). Then, by boundedness of , taking the limit in (2.9) gives . Thus, we have shown the first inclusion.
The second inclusion follows by the upper estimate (2.7) for the pseudo-coderivative.
Sufficient conditions for pseudo-(sub)regularity
Graphical derivative and (directional) limiting coderivative are powerful tools for studying regularity properties of set-valued mappings, such as (strong) metric regularity and subregularity, as well as their inverse counterparts of Lipschitzness, such as Aubin property and (isolated) calmness. Indeed, given a closed-graph set-valued mapping , metric regularity and strong metric subregularity at some point are characterized, respectively, by
| 2.10a |
| 2.10b |
see e.g. [60, 66, 71] for the definition of these Lipschitzian properties as well as the above results. Let us mention that (2.10a) is referred to as Mordukhovich criterion in the literature, while (2.10b) is called Levy–Rockafellar criterion.
For fixed , we will refer to
| 2.11 |
which implies that is metrically subregular at in direction u, see e.g. [36, Theorem 5], as FOSCMS(u). Note that it is formulated as an inclusion as the left-hand side in (2.11) is empty whenever . Indeed, in this case, is trivially metrically subregular at in direction u. Furthermore, whenever (2.11) holds for all , which we will refer to as FOSCMS, then is already metrically subregular at , see [38, Lemma 2.7]. Above, FOSCMS abbreviates First-Order Sufficient Condition for Metric Subregularity, and this terminology has been coined in [36]. Clearly, each of the conditions from (2.10) is sufficient for FOSCMS. The relations (2.7) suggest that the pseudo-coderivative can be useful particularly in situations where the above regularity properties, which are related to (first-order) coderivatives, fail.
Note that the aforementioned notions of regularity and Lipschitzness express certain linear rate of change of the mapping. Similarly, there is an underlying linearity in the definition of graphical derivative and coderivatives. Take the graphical derivative for instance. Since the same sequence appears in the domain as well as in the range space, if implies that and are both nonzero, it suggests a proportional (linear) rate of change. Thus, in order to characterize pseudo-(sub)regularity of order of , it is not very surprising that we need to exploit derivative-like objects based on sub- or superlinear structure. Exemplary, this has been successfully visualized in [37, Corollary 2] by means of Gfrerer’s directional pseudo-coderivative of order from Definition 2.3 (c). Here, we show that the fundamental result from [37, Theorem 1(2)] yields also an analogous sufficient condition for metric pseudo-subregularity via the pseudo-coderivative from Definition 2.3 (b).
Lemma 2.10
Let be a set-valued mapping having a closed graph locally around , fix a direction , and some . Assume that
| 2.12 |
holds. Then is metrically pseudo-subregular of order at in direction u.
Proof
Suppose that is not metrically pseudo-subregular of order at in direction u. Due to [37, Theorem 1(2)], we find sequences , , and satisfying (among other things) , , , as well as , such that and
for each . Let us set for each . Then we have
for each and from . Observing that possesses a nonvanishing accumulation point , taking the limit along a suitable subsequence yields which contradicts the assumptions of the lemma.
Let us remark that due to (2.7), condition
| 2.13 |
is stronger than (2.12) and, thus, also sufficient for metric pseudo-subregularity of of order at in direction u. By means of [37, Corollary 2], (2.13) is actually equivalent to being metrically pseudo-regular at in direction (u, 0). Note that in the case , both conditions (2.12) and (2.13) recover FOSCMS(u). In Example 2.2, (2.12) and (2.13) hold simultaneously. The following example illustrates that (2.12) can be strictly milder than (2.13).
Example 2.3
For , we consider the mapping given by
Essentially, is a closed staircase enclosed by the graphs of the functions and . Set and . First, it is easy to see that (2.12) is satisfied, because one can show . Indeed, the sequences and from the definition of the pseudo-coderivative satisfy, among others, , , , and for each . Thus, can have a nonempty graph only for . Next, let us argue that (2.13) fails due to . We consider the sequences and given by
We obviously have , , as well as , and one can easily check that holds for all . By construction, there exist vertical normals to at for each , so we can choose and satisfying (2.6). Taking the limit shows .
Remark 2.1
Let be a set-valued mapping having locally closed graph around , and fix some . Note that if we replace the set by just the singleton in Definition 2.1 of metric pseudo-subregularity, the estimate (2.2) simplifies to
Asking this to hold for all and some seems like a natural way to define strong metric pseudo-subregularity of order of at . It is an easy exercise to verify that this condition is satisfied if and only if . This characterization is clearly an extension of the Levy–Rockafellar criterion (2.10b), and it provides a justification for the graphical pseudo-derivative.
Finally, by definition of the pseudo-coderivatives, we easily find the inclusions
for each and . Hence, as increases, the qualification conditions (2.12) and (2.13) become weaker.
Pseudo-(sub)regularity of order 2 for constraint mappings
In this section, we address the pseudo-coderivative calculus for so-called constraint mappings which are given by for all , where is a single-valued continuous function and is a closed set, and apply our findings from Sect. 2.3.4 in order to derive sufficient conditions for directional metric pseudo-(sub)regularity of order 2. Let us emphasize that this representation of will be a standing assumption in the overall section. The constraint mapping plays an important role for the analysis of so-called geometric constraint systems of type .
Directional pseudo-coderivatives and sufficient conditions
The first lemma of this subsection addresses upper estimates of the regular, limiting, and directional limiting coderivative of constraint mappings. These results are in principle quite standard, with the exception of the lower estimates in (a) and (c), which can be shown using [20, Theorem 3.1] and [18, Lemma 6.1], respectively. However, since we proceed in a fairly mild setting where g is assumed to be merely continuous, we cannot simply rely on change-or-coordinates formulas, see e.g. [71, Exercise 6.7], even for the proof of the standard parts in (a) and (b). Thus, we prove everything using the results from our recent paper [20].
Lemma 3.1
Fix . Then the following statements hold.
- For each , we have
and the opposite inclusion holds if g is calm at x. - For each , we have
and the opposite inclusion holds whenever g is continuously differentiable at x. - For each pair of directions and each , we have
provided g is calm at x, and the opposite inclusion holds whenever g is continuously differentiable at x.
Proof
- For the proof, we observe that is valid. Now, we exploit the sum rule from [20]. Therefore, let us introduce the surrogate mapping given by
for all , and observe that holds while M is single-valued and continuous on . Now, we find3.1
for all from [20, Theorem 3.1], and the converse inclusion holds if g is calm at x since this ensures that M is so-called isolatedly calm at the point of interest, see [20, Corollary 4.4, Section 5.1.1]. Now, computing the regular normal cone to via [20, Lemmas 2.1, 2.2] and applying the definition of the regular coderivative yields the claim. The proof of the inclusion is similar as the one of the first statement. Again, we exploit the mapping M given in (3.1) and apply [20, Theorem 3.1] while observing that M is so-called inner semicompact w.r.t. its domain at each point by continuity of g. In the presence of continuous differentiability, the converse inclusion follows easily by applying the change-of-coordinates formula provided in [71, Exercise 6.7].
This assertion can be shown in similar way as the second one, see [20, Lemma 2.1] as well.
Let us note that the upper estimate in (a) was also shown in [15, Lemma 3.2], but it actually follows directly from [71, Exercise 6.44] upon realizing . In the case where g is not calm at the reference point, one can still obtain an upper estimate for the directional limiting coderivative from [20, Theorem 3.1] which is slightly more technical since it comprises another union over .
Next, we estimate the directional pseudo-coderivatives of order 2 of constraint mappings in terms of initial problem data.
Theorem 3.1
Let g be twice continuously differentiable. Given and a direction , let
for some . Then there exists such that
| 3.2a |
| 3.2b |
Further specifications of satisfying (3.2) are available under additional assumptions.
- Each of the following two conditions
3.3a
implies that we can find satisfying (3.2).3.3b If and D is locally polyhedral around , then , and there are two elements satisfying (3.2) (for with , respectively) with and .
Proof
Since , we find sequences , , and with , , , , , as well as
for all where we used for brevity of notation. Lemma 3.1 yields and for each . Taking the limit in , we find . Combining this with a Taylor expansion and denoting gives us
| 3.4a |
| 3.4b |
for each . We readily obtain , i.e., (3.2b), as well as
i.e., (3.2a), due to the closedness of .
In the general case (a), we will us the identity (3.4a) only with the right-hand side , but in the polyhedral case (b), it is also reasonable to take a closer look at the expression .
Let us now prove (a). Using the notation from above, let us first assume that , given by for each , remains bounded. Then we may pass to a subsequence (without relabeling) so that it converges to some . We get
and follows. Clearly, taking the limit in (3.4a) yields (3.2a) as well.
On the other hand, if does not remain bounded, we pass to a subsequence (without relabeling) such that and for some where we used for each . Multiplying (3.4a) by and taking the limit yields . Taking into account , we get
| 3.5 |
Let us assume that . Then, for sufficiently large , we have , so we can set for any such and find such that (along a subsequence without relabeling). Moreover, we have
from (3.4b), so that (3.5) yields . This contradicts (3.3b). In the case where holds, (3.3b) is not applicable. However, we still have
so that taking the limit while respecting (3.5) yields which contradicts (3.3a).
In the polyhedral case (b), we will show that one can always replace the potentially unbounded sequences from (3.4a) by bounded ones. To start, we prove that for all sufficiently large . Lemma 2.2 (a) yields the existence of a neighborhood of 0 such that
| 3.6 |
as well as the fact that is polyhedral. Thus, from (3.4b) we conclude
for all sufficiently large .
Next, let us set for brevity of notation, and note that K is a polyhedral cone. From above we know that holds for all sufficiently large . Then we also get and, by Lemma 2.2 (a), , where is also a polyhedral cone. Thus, referring to (3.4a), we may invoke Hoffman’s lemma, see [31, Lemma 3C.4], to find some bounded sequences and satisfying
for . Thus, accumulation points of for satisfy (3.2a) and and .
Below, we comment on the findings of Theorem 3.1. To start, we illustrate that the additional information on the multiplier provided in statements (a) and (b) is the same whenever D is a convex polyhedral set in .
Remark 3.1
We use the notation from Theorem 3.1. Suppose that D is a convex polyhedral set in . First, we claim that
The first two relations are straightforward and so let us prove the last one. Based on the so-called reduction lemma, see [31, Lemma 2E.4], and [31, Proposition 2A.3], for each pair , we get
where is a neighborhood of (0, 0) and represents the critical cone to D at . By Lemma 2.2 (a), this simply means
Thus, means , which gives us
and
by the basic properties of convex polyhedral cones and Lemma 2.2 (b).
Hence, in the convex polyhedral case, the information on and from statements (a) and (b) (case ) of Theorem 3.1 is the same, while the information from statement (b) (case ) is seemingly sharper. Let us now demonstrate that it is actually also equivalent to the others.
Note that (3.2b) can be equivalently written as due to Lemma 2.2 (b) and for all . This also means that, for any such , the sets
coincide, and viewing , , u, and v as parameters, the linear programs
are the same for . On the other hand, (3.2a) with and , respectively, precisely characterizes the fact that u is a minimizer of LP(1) and LP(2). Hence, this information on is the same.
Some additional comments on Theorem 3.1 are stated subsequently.
Remark 3.2
We use the notation from Theorem 3.1.
Note that, in the case , assumption (3.3b), which is stated in terms of the graphical subderivative, is milder than (3.3a) in terms or the standard graphical derivative, and it preserves the connection to the direction . Let us also note that the case is, anyhow, special since this would annihilate the directional information in (3.2b) completely.
- If and D is locally polyhedral around , conditions (3.3) reduce to
thanks to Lemma 2.6.
In the polyhedral case, we can derive yet sharper information on if we start with the new pseudo-coderivative instead of the one utilized by Gfrerer. This is also the main reason for introducing the new definition. Throughout the paper, we will rely on the following result. Particularly, it plays an important role in Proposition 5.4 and Corollary 5.3, which we were not able to get using the estimates from Theorem 3.1.
Theorem 3.2
Let g be twice continuously differentiable. Given , assume that and D is locally polyhedral around . For a direction , let
for some . Then there exists satisfying where
| 3.7 |
together with two elements and satisfying for . Moreover, is equivalent to the existence of with .
Proof
Similar arguments as in the proof of Theorem 3.1 yield (3.4a) together with for each where
As in the final part of the proof of Theorem 3.1, all we need to show is for all sufficiently large and some appropriately chosen .
Noting that D is polyhedral while is a polyhedral cone, we can apply Lemma 2.2 (a) to find neighborhoods of 0 such that (3.6) and
Consequently, we have and, hence, also for sufficiently large . Similarly, we conclude that . Taking into account that for each cone K, , and , one has , we find
for all sufficiently large , and we obtain .
Since is polyhedral, so is , see Lemma 2.6, and it can be written as the union of finitely many convex polyhedral sets, say . Thus, we have
for sufficiently large . We may pick an index such that holds for infinitely many and suppose that can be represented as for some matrices A, B, as well as c of appropriate dimensions. Hence, by passing to a subsequence (without relabeling), we get
For each , a generalized version of Hoffman’s lemma, see [47, Theorem 3], now yields the existence of with
for some constant not depending on k. Thus, is bounded and satisfies
We may assume that converges to some . Exploiting (3.7), we infer
for all sufficiently large from polyhedrality of and the definition of the limiting normal cone.
To show the second statement, note that is equivalent to , so that any of these two conditions readily yields the existence of with . Conversely, suppose that there exists with . Let be an arbitrary sequence with , and define the sequences and by and
for all . First, a second-order Taylor expansion together with yields . Next, using similar arguments as before, polyhedrality of and, locally around , D, together with , yields , i.e., , for sufficiently large . Taking the limit gives , and this completes the proof.
Remark 3.3
Let us mention that if and D is locally polyhedral around , we get the relations
from Lemma 2.2 (b). This also yields .
Again, in the convex polyhedral case, the two options provided by Theorem 3.2 coincide. This can be shown using the same arguments as in Remark 3.1 but with the sets
| 3.8 |
which coincide because the required existence of with obviously yields the inclusion and, thus, for all . This means that our conditions from Theorem 3.2 precisely state that the associated linear programs (LP(i)), , with replaced by , have a solution.
From Theorems 3.1 and 3.2 we obtain the following explicit sufficient conditions for metric pseudo-(sub)regularity of constraint mappings.
Corollary 3.1
Let g be twice continuously differentiable. Consider and a direction . The characterization (2.13) of metric pseudo-regularity of order 2 of in direction (u, 0) at holds under conditions (a), (b), and (c), while the sufficient condition (2.12) for metric pseudo-subregularity of order 2 of in direction u at is valid also under (d).
- One has
- One has
Furthermore, we either have3.9
or and3.10 3.11 - It holds , D is locally polyhedral around , and
3.12 - It holds , D is locally polyhedral around , and for each one has
where and are given as in (3.7).3.13
Due to Remark 3.3, (3.12) indeed implies validity of (3.13) for arbitrarily chosen .
Remark 3.4
Let us note that if and D is locally polyhedral around , then (3.10) and (3.11) appearing in Corollary 3.1 (b) reduce to
| 3.14 |
thanks to Remark 3.2 (b).
The convex polyhedral case: a comparison with related results
Throughout the subsection, we assume that D is a convex polyhedral set in , and aim to compare our findings, at least partially, with available results from the literature. To start, we recall the definition of directional 2-regularity taken from [9, Definition 1].
Definition 3.1
Set , let D be convex and polyhedral, and fix as well as . Then the 2-regularity condition is said to hold at in direction u if the following is valid:
| 3.15 |
Let us mention that the original definition of directional 2-regularity from [9, Definition 1] is different from the one stated in Definition 3.1. However, both conditions are equivalent by [9, Proposition 1]. Furthermore, it should be noted that, in the setting of Definition 3.1, the 2-regularity condition in direction reduces to Robinson’s constraint qualification, see [25, Proposition 2.97]. Observe that, since , , and are cones, 2-regularity in a nonzero direction u is equivalent to 2-regularity in direction for arbitrary . Hence, it is reasonable to consider merely directions from in Definition 3.1. In Proposition 3.1 below, we derive a dual characterization of 2-regularity in direction u, which states that the conditions
can be satisfied only for . Note that (C) can be stated in a -free manner by means of
which is why we did not include in the abbreviation (C).
Second, we will compare our findings with the ones from [37]. Again, we just consider the situation where D is a convex polyhedral set. In [37, Theorem 2 (2)], pseudo-subregularity of the feasibility mapping of order 2 at in some direction which satisfies (for other directions, the concept is trivial) was shown to be present under the following condition:(C)
| 3.16 |
We will now derive alternative representations of (3.12) and (3.15), which are sufficient for directional pseudo-regularity of of order 2, as well as (3.13) and (3.16), being sufficient for directional pseudo-subregularity of of order 2, which allow for a comparison of all these conditions.
To start, let us present a technical lemma, collecting some consequences of having with , see (3.7) for the definition of and .
Lemma 3.2
Set , let D be convex and polyhedral, and fix as well as such that . The existence of with is equivalent to the existence of with , and these conditions imply for arbitrary . If, additionally, (C) holds, then we even have .
Proof
Let us start to prove the first assertion. Note that holds due to polyhedrality of D yielding polyhedrality of . Hence, if satisfies , then for some satisfies . The converse relation is trivial due to .
The second assertion is a consequence of the definition of .
To show the final assertion, note that (C) gives
as and .
Now, we are in position to state the central result of this subsection.
Proposition 3.1
Set , let D be convex and polyhedral, and fix as well as such that . Then the following statements hold.
Proof
Let us start to prove (a). If the 2-regularity condition holds at in direction u, then computing the polar cone on both sides of (3.15) while respecting [23, Exercises 3.4(d) and 3.5] gives
Relying on [23, Exercise 3.5] again while taking convexity and polyhedrality of D (and, thus, of ) into account, we find
| 3.20 |
Hence, (3.17) holds. Conversely, if (3.17) is valid, then (3.20) holds as well. Computing the polar cone on both sides, we can exploit [23, Exercises 3.4(d) and 3.5] once again in order to obtain
Finally, one has to observe that the set within the closure operator is a convex polyhedral cone and, thus, closed in order to find validity of the 2-regularity condition at in direction u.
Statement (b) follows immediately from Lemma 2.2 (b).
Finally, let us turn to the proof of statement (c). In order to show the equivalence between conditions (3.16) and (3.19), it suffices to prove that (3.16) is equivalent to
| 3.21 |
since the latter is equivalent to (3.19) by Lemma 3.2. The maximization problem appearing in (3.16) is a linear program whose feasible set is a nonempty, convex polyhedral cone. Furthermore, is a maximizer if and only if
Here, we made use of [23, Exercise 3.4(d)] to compute the polar cone of the appearing intersection, and the latter is a polyhedral cone and, thus, closed. This inclusion, in turn, is equivalent to the existence of such that
showing the claimed equivalence between (3.16) and (3.21) as is already included in (C).
Clearly, (3.19) implies (3.13) by Lemma 2.2 (b) and Remark 3.3, so we only need to verify the converse implication. Thus, let us prove the premise of (3.13) assuming that (C) holds while there exists some with . Particularly, from these two we infer with the help of Lemma 3.2, so the premise of (3.18) is valid. Taking into account Remark 3.1, this means that u is a solution of the linear program ( where we used
for some parameter .
For arbitrary , we claim that whether () has a solution depends only on its feasibility since, for feasible problems, the issue of boundedness is independent of q. This follows from [17, Lemma 4], stating that, whenever () is feasible, then it possesses a solution if and only if there does not exist satisfying and
and these conditions are, indeed, independent of q. Above, we have used [71, Exercises 3.12 and 6.34(c)]. Since ( has a solution, () has a solution for each for which it is feasible. Particularly, Lemma 3.2 thus yields that ( has a solution for .
Finally, we claim that is also a solution of the (feasible) linear program
whose feasible set equals the set from (3.8). As explained just below (3.8), this will confirm the premise of (3.13) and thus conclude the proof. Suppose that is not a solution of this problem, i.e., there exists with and
Then is a feasible point of ( for some , while
follows from which holds by Lemma 3.2. The latter, however, means that is not optimal for ( - a contradiction.
Let us mention that the first assertion of Proposition 3.1 generalizes [40, Proposition 2].
As a corollary of Proposition 3.1, we now can easily interrelate the different sufficient conditions for pseudo-(sub)regularity.
Corollary 3.2
Set , let D be convex and polyhedral, and fix as well as such that . Then the following implications hold:
Particularly, (3.15) implies that is metrically pseudo-regular of order 2 at in direction (u, 0). Moreover, if there exists with , all four conditions are equivalent.
Proof
The first implication and the equivalence are immediately clear by Proposition 3.1. In order to show the second implication, we first make use of Proposition 3.1 in order to see that it suffices to verify that (3.18) implies (3.19). This, however, is clear since (C) and the existence of such that imply , see Lemma 3.2, and follows by (C).
The fact that (3.15) is sufficient for directional pseudo-regularity of now follows from Corollary 3.1. The final statement is obvious from Proposition 3.1.
The following example shows that our sufficient condition (3.12) for directional pseudo-regularity is strictly milder than directional 2-regularity from (3.15).
Example 3.1
Let and , , be given by , , and
Observe that is a convex polyhedral set for . We consider the constraint mappings given by , , for and fix and . Note that for .
Let us start with the investigation of the mapping . Due to and
one can easily check that (3.17) and (3.18) are both satisfied. Consequently, due to Proposition 3.1, (3.12) and (3.15) hold in parallel.
Let us now consider the mapping . Clearly, (3.18) remains valid since the appearing variable has to be chosen from the set . Hence, due to Proposition 3.1, (3.12) holds (and, thus, pseudo-regularity of order 2 of in direction u at ). However, we have , so that choosing and yields a violation of (3.17) in this situation. Consulting Proposition 3.1 once again, (3.15) is violated as well. Let us also note that, for each , we have
see Corollary 3.2. Hence, (3.12) is strictly milder than (3.15).
Let us take a closer look at the particular situation where .
Remark 3.5
Set , , and fix as well as such that . Let us consider the sufficient conditions for directional metric pseudo-(sub)regularity discussed in Proposition 3.1. The constraint qualification (3.17) obviously reduces to
| 3.22 |
and the latter is equivalent to the 2-regularity condition (3.15) at in direction u by Proposition 3.1. One can easily check that (3.12) also reduces to (3.22). Furthermore, due to Proposition 3.1, (3.13) and (3.16) reduce to
and the latter is strictly milder than (3.22) as we will illustrate in Example 3.2 below.
To close the remark, let us mention that whenever (3.22) has to hold for all (this implies metric pseudo-subregularity of order 2 of at for all unit directions), then either is surjective or the zero operator, see [34, Remark 2.1], i.e., this situation is rather special. We believe, however, that this is mainly because D is trivial and partially due to the precise definition of 2-regularity. Let us point the interested reader to [37, Example 2], which suggests that metric pseudo-subregularity of order 2 in all unit directions might be a reasonable assumption.
The following example, which has been motivated by Remark 3.5, indicates that (3.16) is strictly milder than (3.12).
Example 3.2
Let and be given by , , and . We consider the point . As vanishes while we have , each direction satisfies , and we pick any such u. Due to Remark 3.5, (3.12) and (3.15) reduce to
and since three vectors in are always linearly dependent, this condition is trivially violated. On the other hand, (3.13) and (3.16) can be stated as
and this condition holds as the premise regarding u cannot be satisfied by any .
We close this subsection with some more general remarks about (directional) 2-regularity and Gfrerer’s sufficient condition for metric pseudo-(sub)regularity from [37, Theorem 2].
In this subsection, for simplicity, we restricted ourselves to the convex polyhedral case, but neither our approach nor the other results are limited to this case. The original definition of directional 2-regularity in [9] is stated for merely convex sets D (no polyhedrality is assumed in the latter paper), but involves the radial cone to D which is not necessarily closed for curved sets D. Interestingly, [37, Example 2], already mentioned in Remark 3.5, provides a mapping which is metrically pseudo-regular of order 2 in every direction (u, 0) with , particularly metrically pseudo-subregular of order 2 in every unit direction, but the 2-regularity condition is violated for every direction; the chosen set D in this example is the Euclidean unit ball in which is not polyhedral.
Let us mention that [37, Theorem 2] is stated in the general polyhedral case (no convexity is assumed), and it yields the existence of several elements corresponding to the active components of the set D. Looking into the proof of Theorem 3.2, it seems like we could get a similar result with only minor adjustments, but since we do not need such a result here, we did not develop this approach for the purpose of brevity.
Let us also note that the conditions from statements (a) and (b) of Corollary 3.1 are not covered by [9] (since D does not need to be convex for our findings) or by [37, Theorem 2] (since D does not need to be polyhedral).
Finally, let us point out that the concept of 2-regularity is useful for the design and the convergence analysis of Newton-type methods, aiming to solve smooth and nonsmooth equations, see e.g. [33, 49] and the references therein.
Directional asymptotic stationarity in nonsmooth optimization
This section is devoted to directional asymptotic stationarity conditions and related results. It contains the foundation of our research, Theorem 4.1, which also motivates our considerations in Sect. 5.
For a locally Lipschitz continuous function , a set-valued mapping with a closed graph, and , we investigate the rather abstract optimization problem
| P |
Throughout the section, the feasible set of (P) will be denoted by . Clearly, we have from . Note that the model (P) covers numerous classes of optimization problems from the literature including standard nonlinear problems, problems with geometric (particularly, disjunctive or conic) constraints, problems with (quasi) variational inequality constraints, and bilevel optimization problems. Furthermore, we would like to mention that choosing would not be restrictive since one could simply consider given by , , in the case where does not vanish. Optimality conditions and constraint qualifications for problems of this type can be found, e.g., in [36, 63, 65, 76]. A standard notion of stationarity, which applies to (P) and is based on the tools of limiting variational analysis, is the one of M-stationarity.
Definition 4.1
A feasible point of (P) is called M-stationary whenever there is a multiplier such that
Later in Corollary 4.3, we will show that directional metric subregularity of serves as a constraint qualification for M-stationarity. In the following lemma, whose proof is analogous to the one of [14, Lemma 3.1], we point out that directional metric subregularity of implies that penalizing the constraint in (P) with the aid of the distance function yields a directionally exact penalty function.
Lemma 4.1
Let be a local minimizer of (P), and assume that is metrically subregular at in direction . Then there are constants , , and such that is a global minimizer of
| 4.1 |
Let us note that this result refines well-known findings about classical exact penalization in the presence of metric subregularity, see e.g. [27, 28, 56].
Approaching mixed-order stationarity conditions
To start, let us introduce a quite general notion of critical directions associated with (P).
Definition 4.2
For some feasible point and a pair such that as well as , a direction is called critical of order for (P) at whenever there are sequences , , , and satisfying , , , , and, for all ,
| 4.2 |
If , we simply call u a critical direction for (P) at .
Clearly, is critical of every order. Moreover, the set of all critical directions of any fixed order is a cone. The most standard case corresponds to [36, Definition 5]. If is directionally differentiable at , it is easily seen that is critical for (P) at if and only if and , see [72, Proposition 3.5] as well. Let us note that whenever is a feasible point of (P) such that no critical direction for (P) at exists, then is a strict local minimizer of (P). Conversely, there may exist strict local minimizers of (P) such that a critical direction for (P) at this point exists.
While in this paper, we will not go beyond the case (the case is briefly mentioned in Lemma 4.3), the situation (particularly ) will be very important. For and arbitrary , a critical direction still satisfies and , and the converse is valid whenever is continuously differentiable at . In the next lemma, we show that if is metrically pseudo-subregular of order at , then u is actually critical of order for each .
Lemma 4.2
Fix a feasible point of (P), , and a critical direction of order for (P) at . If is metrically pseudo-subregular of order in direction u at , then u is critical of order for (P) at for each .
Proof
Let , , , and be sequences satisfying , , , , as well as (4.2) for all . By metric pseudo-subregularity of order of at , there is a constant such that, for sufficiently large , we get the existence of with
Particularly, we find from and . Moreover, Lipschitzianity of yields
for some constant and sufficiently large . Thus, setting , , and for large enough yields , , , as well as
for large enough , and so u is critical of order for (P) at for each .
The following result, inspired by and based on [37, Proposition 2], provides an important interpretation of the notion from Definition 4.2 in terms of the so-called epigraphical map associated with and given by , . The proof follows simply from the fact that together with Remark 2.1.
Proposition 4.1
Given a feasible point and a pair such that as well as , a direction is critical of order for (P) at if and only if there exist sequences and such that , , and
| 4.3 |
Moreover, if , this is further equivalent to the condition
for the mapping given by , .
Interestingly, Gfrerer used the conditions (4.3) as a basis of his optimality conditions in [37, Proposition 2], but he did not notice, or at least did not mention, that these conditions actually provide a natural extension of his own notion of a critical direction from [36, Definition 5]. This observation enables us to formulate an extension of the common pattern “for every critical direction there is a multiplier satisfying an FJ-type optimality condition” in Corollary 4.1 below.
Remark 4.1
Gfrerer recognized the importance of considering Cartesian product mappings , given by
for the component maps , , and Euclidean spaces , and to allow different orders of pseudo-(sub)regularity of these component mappings, see [37, Definition 1]. In the same manner, he defined his pseudo-coderivative [37, Definition 2]. This was essential for his approach to optimality conditions. For brevity of presentation, we avoid these definitions and bypass explicitly using these notions by applying [37, Proposition 2] in combination with the sufficient conditions for pseudo-subregularity from [37, Theorem 1(2)] to prove Corollary 4.1.
Corollary 4.1
Let be a local minimizer of (P) and let be a critical direction of order for (P) at with . Then there exist multipliers satisfying
If the sufficient condition (2.12) for metric pseudo-subregularity of order of in direction u at holds, then the above condition holds with .
Proof
Applying Proposition 4.1 and then [37, Proposition 2 and Theorem 1(2)] yields an element and sequences , , , and satisfying (among other things) , , , , as well as , such that, for each , and
| 4.4 |
where we used as well as the mapping defined by , , with the perturbed epigraphical mapping given by
Note that we have , where the permutation mapping just swaps the last two components. After replacing the regular by the larger limiting normal cone in (4.4) and noting that is locally Lipschitzian, we can apply the intersection rule for limiting normals from [71, Theorem 6.42]. The latter yields, for each , with and
Now, local Lipschitzness of together with boundedness of implies boundedness of . This, in turn, gives boundedness of . Since is also bounded, taking the limit along a suitable subsequence yields some , , and satisfying as well as
Here, we used the robustness of the directional limiting coderivative, see Lemma 2.1, as well as Lemma 2.8. Taking into account that is smooth with its gradient vanishing at and using Lemma 3.1 (c) as well as [18, Proposition 5.1], we get and . This proves the first statement.
Finally, (2.12) clearly implies , and by rescaling, we can set .
Mixed-order and asymptotic stationarity conditions
The following result provides asymptotic necessary optimality conditions for (P) which hold in the absence of constraint qualifications. The derived conditions depend on a certain order . Furthermore, our result specifies how the asymptotic case (d) can be ruled out by metric pseudo-subregularity of of order at the reference point.
Theorem 4.1
Let be a local minimizer of (P) and consider . Then one of the following conditions holds.
The point is M-stationary for (P).
- There exists a critical direction for (P) at such that
4.5 - There exist a critical direction for (P) at , a nonvanishing multiplier , and such that, for , we have
4.6 - There exist a critical direction of order for (P) at for each , some , and sequences as well as such that and for all , satisfying the convergence properties
where we used
as well as4.7 4.8
Moreover, if is metrically pseudo-subregular of order at in each direction , satisfies one of the alternatives (a), (b), or (c).
Proof
Let be chosen such that holds for all and, for each , consider the optimization problem
For each , the objective function of (P(k)) is bounded from below, continuous on the closed feasible set of this problem, and coercive in the variable y, so (P(k)) possesses a global minimizer . By feasibility of for (P(k)), we find
| 4.9 |
By boundedness of , we may assume for some . Observing that is bounded by continuity of , easily follows from (4.9). Furthermore, the closedness of guarantees , i.e., leading to . From (4.9), we find
and follows. Thus, we have .
Let us assume that there is some such that is feasible to (P). By (4.9), we find
i.e., and . Applying [66, Theorem 6.1], the subdifferential sum rule [66, Theorem 2.19], and the definition of the limiting coderivative to find stationarity conditions of (P(k)) at yields , which is covered by (a).
Thus, we may assume that holds for all . Particularly, and is valid for all in this situation. Assume without loss of generality that belongs to the interior of .
We can apply Fermat’s rule, see [66, Proposition 1.30 (i)], the semi-Lipschitzian sum rule for limiting subgradients from [66, Corollary 2.20], and the definition of the limiting coderivative in order to find
| 4.10 |
Setting for each , we find . Since , we may assume for some .
Next, we claim that , given by for each , is bounded. Rearranging (4.9), leaving a nonnegative term away, and division by give us
| 4.11 |
Lipschitzianity of yields boundedness of the first fraction, so that the sequence must be bounded and, consequently, as well. Thus, we may assume for some .
Suppose that does not converge to zero. This, along a subsequence (without relabeling), yields boundedness of the sequence , and taking the limit in (4.10) along yet another subsequence while respecting robustness of the limiting subdifferential and the limiting coderivative yields (a).
Thus, we may assume for the remainder of the proof. Observe that we have
for all . Additionally, (4.11) yields
so u is a critical direction of order for each for (P) at .
In the remainder of the proof, we are going to exploit the sequences given as in (4.7). Observe that , i.e., is valid for each . Note that the optimality condition (4.10) can be rewritten as
| 4.12 |
Now, we need to distinguish three options.
Let us assume that . Using , we can reformulate (4.12) as
Taking the limit while respecting robustness of the directional limiting subdifferential as well as Lemma 2.8 yields (b) since and u has already been shown to be critical for (P) at .
If remains bounded but, along a subsequence (without relabeling), stays away from zero, we also get boundedness of from boundedness of , and taking the limit along a convergent subsequence (without relabeling) in (4.12) while respecting robustness of the directional limiting subdifferential and Lemma 2.8 yields precisely (4.6), where with satisfy and , respectively, and using for all as well as (4.7), we find for all , , and . Criticality of u for (P) at has been shown above. Thus, situation (c) has been verified.
If is not bounded, we pass to a subsequence (without relabeling) such that and so we also get along this subsequence by boundedness of . This means that u is actually critical of order for (P) at and so all conditions stated in (d) have been verified since (4.8) follows from (4.12).
Finally, let us argue that option (d) can be avoided, i.e., that the sequence from above remains bounded if we assume that is metrically pseudo-subregular of order in direction u at . By boundedness of , we immediately obtain the boundedness of unless we have . Thus, let us assume the latter. By metric pseudo-subregularity of , there is a constant such that, for sufficiently large , we get the existence of with
| 4.13 |
Particularly, we find from , and follows. Since is a global minimizer of (P(k)), we get
for all sufficiently large . Due to for all , rearranging the above estimate and using (4.7) as well as (4.13) yield
Boundedness of thus follows from Lipschitzianity of and the estimate
This completes the proof.
Let us note that for the price of some more technicalities in the proof, involving the fuzzy sum rule for the regular subdifferential, see e.g. [66, Exercise 2.26], it is possible to formulate statement (d) in terms of the regular tools of variational analysis, see [21, Theorem 4.3] which is a preprint version of this paper. This more involved approach then allows for an easier comparison to available results in the literature which are partially stated in infinite dimensions, see e.g. [37], where the limiting tools are of limited use and sequential characterizations in terms of the regular tools are, thus, preferred. However, for our purposes, the way Theorem 4.1 has been formulated will be enough to proceed.
In the rest of this subsection, we discuss some applications of Theorem 4.1, which are then further developed in the rest of the paper. First, we focus on mixed-order stationarity conditions, involving first-order generalized derivatives of the objective function and pseudo-coderivatives of order , and enhance the result of Corollary 4.1 as follows.
Corollary 4.2
Let be a local minimizer of (P) and consider . Then the following assertions hold.
If is metrically pseudo-subregular of order at in each unit direction, then one of the alternatives (a), (b), or (c) of Theorem 4.1 holds.
Proof
The first assertion follows directly from Theorem 4.1. Let us now prove the second assertion. Theorem 4.1 says that either one of the alternatives (a), (b), or (c) holds, or there exists a critical direction of order for (P) at (with certain properties). If among these critical directions, there is one that satisfies (2.12), Corollary 4.1 yields (4.14).
We conjecture that the sufficient condition (2.12) can be weakened to just pseudo-subregularity of in Corollary 4.2 (b). However, it would require a different proof to show this, so we will not explore this option. For , such a result is known to hold, see [36, Theorem 7].
Note that (4.14) is covered by the alternative (b) (if , see (2.7)) or (c) (if ) of Theorem 4.1. Hence, the optimality conditions from Corollary 4.2 give either M-stationarity of the underlying local minimizer or validity of alternative (b) or (c) of Theorem 4.1 for some critical direction (of order (1, 1) or ).
Remark 4.2
Corollary 4.2 offers two distinct paths to an optimality condition of type “M-stationarity or (4.14)”, both with some advantages and disadvantages.
Assuming pseudo-subregularity in each unit direction yields this type of condition by ruling out the alternative (d) of Theorem 4.1. However, this can sometimes be an undesirable type of assumption as pointed out in Remark 3.5.
The refined assumptions in Corollary 4.2 (b) are clearly milder, but they depend on a critical direction (of order ), which in turn depends also on the objective function, not just on . These assumptions do not rule out the alternative (d). Instead, they just secure that (a), (b), or (c) from Theorem 4.1 holds.
These two types of assumptions will be prevalent throughout this section.
Recall that all the assumptions in Corollary 4.2 become less restrictive as increases, see Sect. 2.3.4 as well. On the contrary, with increasing , the involved pseudo-coderivatives become more difficult to handle which, exemplary, can be seen for constraint mappings when comparing the cases and from Sect. 3. In this regard, in Corollary 4.2, should be chosen as small as possible such that the exploited qualification condition is valid.
In Sect. 4.3, we work out the conditions from Corollary 4.2 for in the setting where is a constraint mapping as the appearing pseudo-coderivatives actually can be computed, see Sect. 3, and, hence, we obtain conditions in terms of initial problem data. In Sect. 4.4, we further apply these results to two specific problem classes and compare them with similar results based on 2-regularity.
Theorem 4.1 also opens a way to the identification of new conditions which guarantee that local minimizers of (P) are M-stationary. One of the most prominent conditions that implies this is metric subregularity, and the corresponding result, which we state next, can be obtained simply by setting in Corollary 4.2, taking also into account [36, Theorem 7]. For us, this result serves as a basis for comparison. Later on, we will derive new conditions, which are independent of (directional) metric subregularity, but which are milder than various known sufficient conditions for metric subregularity.
Corollary 4.3
A local minimizer of (P) is M-stationary if one of the following conditions holds.
The mapping is metrically subregular at in each unit direction.
- There are no critical directions for (P) at , or there is a critical direction for (P) at and is metrically subregular at in direction u, in which case there is a multiplier such that
Let us now discuss two novel approaches to M-stationarity. The first approach corresponds to using Corollary 4.2 with and then making sure that the derived mixed-order conditions in terms of pseudo-coderivatives actually yield M-stationarity. To formalize the idea, we introduce the following assumption.
Assumption 4.1
Given and , we say that holds if (2.12) is satisfied and
| 4.15 |
is valid for all .
Let us mention that
| 4.16 |
is a sufficient condition for (4.15) due to (2.7). Assumption leads to the problem of how to compute or estimate the appearing pseudo-coderivatives. As mentioned above, for and in the setting where is a constraint mapping, these objects can be computed and assumption can be made explicit. We discuss this case in detail in Sect. 5.3.2, where we show that is (strictly) weaker than FOSCMS(u) as well as its refinement SOSCMS(u) in the polyhedral case. Here, we just explain how can be used to secure M-stationarity and how to compare it with sufficient conditions for metric subregularity.
To proceed, let be a local minimizer of (P) and consider . Assuming that holds in every unit direction u implies that options (b) or (c) from Theorem 4.1 yield M-stationarity of , and that option (d) cannot occur. Thus, we end up with being M-stationary. Similarly, if holds in a critical direction of order for (P) at , (4.14) is satisfied. Due to (4.15), this also shows M-stationarity of . Thus, we obtain the following from Corollary 4.2.
Corollary 4.4
Let be a local minimizer of (P) and consider . Then each of the following conditions implies that is M-stationary.
Condition holds in each unit direction u.
There are no critical directions for (P) at , or there is a critical direction of order for (P) at such that holds.
In the following remark, we compare our approach from Corollary 4.4 with the results from Corollary 4.3 in the presence of any sufficient condition for directional metric subregularity.
Remark 4.3
Due to Corollary 4.3, directional metric subregularity serves as a constraint qualification guaranteeing M-stationarity of local minimizers. However, given , metric subregularity in direction u is difficult to verify, so it is often replaced by some stronger condition which is easier to check - exemplary, FOSCMS(u). Let us label such a sufficient condition as SCMS(u). Clearly, Corollary 4.3 can be restated in terms of SCMS(u). Suppose that we can show that is milder than SCMS(u) for every (even strictly milder for some u). Naturally, option (a) from Corollary 4.4 then provides a (strictly) milder assumption than requiring SCMS(u) to hold for all unit directions. However, does an analogous relationship hold for the more complicated option (b) from Corollary 4.4? Both approaches yield M-stationarity if there are no critical directions. If there is a critical direction such that SCMS(u) holds, then Lemma 4.2 yields that u is actually critical of order and, thus, the milder assumption from the case (b) of Corollary 4.4 can be applied. This means that our approach via Corollary 4.4 is indeed better than an approach via any sufficient condition for metric subregularity in direction u which is stronger that .
The second approach to M-stationarity can be called “asymptotic” and is based on the following result, a generalization of [63, Theorem 3.9], which reinspects Theorem 4.1 in the situation . Particularly, we exploit that, in this case, both notions of a pseudo-coderivative from Definition 2.3 coincide with the directional limiting coderivative.
Corollary 4.5
Let be a local minimizer of (P). Then is M-stationary or there exist a critical direction for (P) at , some , and sequences as well as such that and for all , satisfying the convergence properties
| 4.17a |
| 4.17b |
| 4.17c |
and
| 4.18 |
The above result shows that each local minimizer of (P) either is M-stationary or satisfies asymptotic stationarity conditions w.r.t. a certain critical direction and an unbounded sequence of multiplier estimates given by
| 4.19 |
Note that in the case where would be bounded, one could simply take the limit in (4.18) along a suitable subsequence and, respecting the convergences from (4.17a), would end up with M-stationarity again taking into account robustness of the limiting subdifferential and coderivative. Thus, divergence of the multiplier estimates is natural since not all local minimizers of (P) are M-stationary in general, see [63, Lemma 3.4] as well. Related results in nondirectional form can be found in [58, 63]. The story of asymptotic stationarity conditions in variational analysis, however, can be traced back to [57, 59]. This concept has been rediscovered as a valuable tool for the analysis of convergence properties for solution algorithms associated with standard nonlinear optimization problems in [3, 7], and extensions were made to disjunctive, conic, and even infinite-dimensional optimization, see e.g. [2, 4, 26, 70] and the references therein.
The sequential information from (4.17) describes in great detail what must “go wrong” if M-stationarity fails. We will refer to (4.17a), (4.17b), and (4.17c) as basic, directional, and multiplier (sequential) information, respectively. Clearly, one can secure M-stationarity of a local minimizer by ruling out the second alternative in Corollary 4.5 and, as we will show, various known constraint qualifications for M-stationarity indeed do precisely that. Let us mention here two such conditions. Rescaling (4.18) by , for as given in (4.19), and taking the limit leads to a contradiction with the Mordukhovich criterion (2.10a), i.e., metric regularity of at . Respecting also the directional information (4.17b) yields a contradiction with FOSCMS(u) at .
In both cases, we have essentially discarded the multiplier information (4.17c) which deserves some remarks. We have used , but this information is not really very important since, as we already explained, if the multipliers remain bounded, we end up with M-stationarity anyway. The fact that converges tells us how fast the multipliers blow up. We note that the concept of super-coderivatives from Definition 2.4 collects this information, and we will come back to it in Sect. 5.3, where it is used to design constraint qualifications for M-stationarity. As we will show in Sect. 5.3, this approach is closely related to the hypothesis which we formulated in Assumption 4.1, and its role as a constraint qualification has already been illustrated in Corollary 4.4.
Finally, note that means that the multipliers precisely capture the direction from which converges to . Particularly, we find , which is clearly more restrictive than the condition . The latter convergence, which is used in the sufficient condition for metric subregularity in [37, Corollary 1], can be recast as . This information is respected by the new constraint qualifications which we are going to suggest in Sect. 5.
Mixed-order necessary optimality conditions for optimization problems with geometric constraints in the case
In this part, we apply Corollary 4.2 with to the case where is given in the form of a constraint mapping, i.e., , , holds where is twice continuously differentiable and is a closed set. Since, in Sect. 3, we computed the pseudo-coderivative and the graphical pseudo-derivative of order 2 of , we are able to derive explicit conditions in terms of initial problem data. For that purpose, we assume in (P) throughout the section which can be done without loss of generality.
We start with a description of critical directions of order (1, 2) and (2, 2).
Lemma 4.3
Fix and let be a critical direction of order (1, 2) of (P) at . Suppose that and D is locally polyhedral around . Then
where and are defined in (3.7). If is continuously differentiable, corresponds precisely to the set of critical directions of order (1, 2) of (P) at . Moreover, if is even twice continuously differentiable at , the set of all critical directions of order (2, 2) of (P) at equals
| 4.20 |
Proof
A critical direction u of order (1, 2) of (P) at satisfies and , with equivalence being valid if is continuously differentiable at . Hence, the first statement follows from Theorem 3.2.
By Proposition 4.1, a direction u is critical of order (2, 2) of (P) at if and only if for given by , . Hence, Theorem 3.2 can be applied again, yielding the second statement.
Remark 4.4
Note that Lemma 4.3 shows that the set of directions from [13, Theorem 3] and its extension labeled second-order tightened critical cone in [9, Theorem 3] actually correspond to , while the set of directions used in [37, Theorem 3(2)] corresponds to the one in (4.20). We believe that interpreting these directions as critical (of some order) is very natural. Moreover, our approach justifies the name. Indeed, as already mentioned, our definition of criticality is an extension of the one stated in [36, Definition 5]. More importantly, we have shown in Corollary 4.2 that in the absence of nonzero critical directions (of order for some ), the corresponding mixed-order optimality conditions (involving a pseudo-coderivative of order ) are satisfied without any additional assumptions.
Based on Theorems 3.1 and 3.2 as well as Corollary 4.2, we obtain the following result.
Proposition 4.2
Let be a local minimizer of (P).
- If (3.9), as well as (3.10) or, in the case , (3.11) hold for every unit direction, then is M-stationary or there exist a critical direction and
such that4.21
If there exists a critical direction of order (1, 2) of (P) at satisfying (3.9), as well as (3.10) or, in the case , (3.11), then there exist satisfying (4.21) and (4.22) for this u.4.22 - Let and D be locally polyhedral around . If either or if (3.13) holds for every unit direction, then is M-stationary or there exist a critical direction , , for , and , satisfying ,
and (4.22) (with ), where , and and have been defined in (3.7). If there exists satisfying (3.13), then there exist and
satisfying (4.22) (with ) as well as .
Proof
For the proof of (a), in the first alternative, we apply Corollary 3.1 in order to verify that (2.12) holds for every unit direction. Corollary 4.2 in turn yields that is M-stationary or one of the cases (b) and (c) from Theorem 4.1 holds. In the case of Theorem 4.1 (b), however, from Theorem 3.1 (a) we get with
see Lemma 2.5, and M-stationarity of follows. In the case of Theorem 4.1 (c), from (2.7) and Theorem 3.1 (a) we precisely obtain and as stated. Similarly, the second alternative follows from successively applying Corollaries 3.1 and 4.2, (2.7), and Theorem 3.1 (a).
For the proof of (b), we first would like to hint to Lemma 4.3. In the first alternative, taking into account Corollary 3.1, Corollary 4.2 yields that is M-stationary or one of the cases (b) and (c) from Theorem 4.1 holds. As before, in the case of Theorem 4.1 (b), from Theorem 3.1 (b) we get with , see Lemma 2.2, and M-stationarity of follows. In the case of Theorem 4.1 (c), from Theorem 3.2 we precisely obtain , and as stated. The second alternative follows from Corollaries 3.1 and 4.2 as well as Theorem 3.2.
Similar optimality conditions involving a mixture of first- and second-order derivatives were proposed e.g. in [9, 11–13, 37]. Let us now explain that in the convex polyhedral case, where holds while D is convex and polyhedral, all these optimality conditions are the same and can be stated simply as follows: If there exists satisfying (3.17), then there are satisfying
| 4.23 |
(for a fair comparison, we assume that is continuously differentiable).
In Examples 3.1 and 3.2, we have shown that the 2-regularity assumption (3.17) used in [9] is, in general, strictly stronger than our condition (3.12), which is, in turn, strictly stronger than the mutually equivalent conditions (3.16) from [37] and (3.13) from Corollary 3.1. However, as shown in Corollary 3.2, all these assumptions are equivalent if applied to a critical direction u of order (1, 2), i.e, , as this yields the existence of with .
Clearly, although the aforementioned qualification conditions are equivalent, the optimality conditions may differ due to the additional information regarding the multipliers. However, this is also not the case, and it can be shown following the proof of Proposition 3.1 (c). First, as mentioned above, we automatically have with from , which can be added to (4.23). Now, we are in the same situation as when proving Proposition 3.1 (c), but we have to work with (4.23) instead of (C). From we also get , while and Lemma 3.2 yield , and follows from and , which is implicitly required due to . Thus, multiplying the essential equation of (4.23) by u, the three nonpositive terms sum up to zero, so they all must vanish. Hence, the arguments which we used to prove Proposition 3.1 (c) also work with (C) replaced by (4.23).
Applications
In this subsection, we highlight some aspects of our results from Sect. 4.3 in two popular settings of optimization theory. More precisely, we focus on the feasible regions of complementarity-constrained and nonlinear semidefinite problems. As mentioned at the end of Sect. 4.3, we do not obtain any new insights for standard nonlinear programs as these can be reformulated with the aid of a constraint mapping where the involved set is convex and polyhedral. Hence, we do not specify our findings for this elementary setting for brevity of presentation but refer the interested reader to [12, 13] where the associated mixed-order optimality conditions and constraint qualifications are worked out.
Mathematical programs with complementarity constraints
Let us introduce
the so-called complementarity angle. For twice continuously differentiable functions with components and , we address the constraint region given by
| MPCC |
where . The latter is distinctive for so called mathematical programs with complementarity constraints which have been studied intensively throughout the last decades, see e.g. [62, 68] for some classical references. We observe that (MPCC) can be formulated via a constraint map using . Note that standard inequality and equality constraints can be added without any difficulties due to Lemmas 2.3 and 2.7 when taking the findings from [12, 13] into account. Here, we omit them for brevity of presentation.
Fix some feasible point of (MPCC). A critical direction of the associated problem (P) necessarily needs to satisfy
| 4.24 |
where we used the well-known index sets
We start with an illustration of Proposition 4.2 (a). Thanks to Remark 3.4, we need to check the constraint qualifications (3.9) and (3.14), and these can be specified to the present setting with the aid of Lemmas 2.2, 2.3 and 2.7. For brevity of presentation, we abstain from a discussion of the case where critical directions of order (1, 2) are involved. Based on the representation
some elementary calculations show
| 4.25 |
for arbitrary and . Consequently, for satisfying (4.24), (3.9) reduces to
| 4.26 |
while (3.14) reads as
| 4.27 |
Above, for each , we used , , , and for brevity as well as the index sets
The first assertion of Proposition 4.2 (a) now yields that whenever is a local minimizer for the associated problem (P) and for each satisfying (4.24), (4.26) and (4.27) hold, then is either M-stationary, i.e., there are multipliers satisfying
or we find satisfying (4.24) and as well as multipliers such that
| 4.28 |
For brevity, we present the results from Proposition 4.2 (b) only in simplified form, where is replaced by 0, see Remark 3.3 as well, and we do not comment on the cases where critical directions of order (1, 2) are involved, but this would clearly yield further refinements.
In order to characterize (3.13), we observe that
is valid for each . For each pair , elementary calculations and a comparison with (4.25) show
Thus, validity of (4.26) for each satisfying (4.24) is already enough to infer that whenever is a local minimizer, then it is either M-stationary or there are satisfying (4.24) as well as and multipliers solving the stationarity conditions (4.28).
Let us further note that Proposition 4.2 (b) also allows for the consideration of a qualification and stationarity condition where simply has to hold for all , see Remark 3.3 again. One can easily check that there is no general inclusion between and , i.e., this procedure leads to conditions not related to (4.26) and (4.28) which are, however, easier to evaluate.
The following example illustrates a situation where (4.26) is valid while (4.27) is violated, i.e., where Proposition 4.2 (b) is applicable while Proposition 4.2 (a) is not. This provides yet another justification of a separate consideration of the polyhedral situation.
Example 4.1
Let us consider (MPCC) with , , and as well as for all . We are interested in the unique feasible point of this system. The only direction from the unit sphere that satisfies (4.24) is . Hence, (4.26) reduces to
Let the premise be valid and assume . This gives due to (4.25), i.e., , and, thus, which yields a contradiction. Hence, this constraint qualification holds. However, (4.27) is given by
and one can easily check with the aid of (4.25) that the premise holds for , i.e., this condition is violated.
Finally, we would like to refer the interested reader to [51, Section 6] and [50] where the theory of 2–regularity is first extended to mappings which are once but not twice differentiable and then applied to a suitable reformulation of complementarity constraints as a system of once but not twice differentiable equations. We abstain from a detailed comparison of our findings with the ones from [50, 51] for the following reasons. First, in these papers, a different way of stating the system of complementarity constraints is used, and it would be laborious to transfer the results to the formulation (MPCC). Second, at least in [51], some additional assumptions are used to simplify the calculations while we do not need to assume anything artificial to make the calculus accessible. Third, the final characterization of 2-regularity obtained in these papers does not comprise any second-order derivatives of the involved data functions and, thus, is anyhow clearly different from (4.26). Let us, however, close with the remark that the system of necessary optimality conditions derived in [50, Theorem 4.2] is closely related to (4.28).
Semidefinite programming
Let us consider the Hilbert space of all real symmetric matrices equipped with the standard (Frobenius) inner product. We denote by and the cone of all positive and negative semidefinite matrices in , respectively. The foundations of variational analysis in this space can be found, e.g., in [25, Section 5.3]. For some twice continuously differentiable mapping , we investigate the constraint system
| NLSD |
It is well known that the closed, convex cone is not polyhedral. Nevertheless, the constraint (NLSD), associated with so-called nonlinear semidefinite programming, can be encoded via a constraint map. Subsequently, we merely illustrate the first assertion of Proposition 4.2 (a). As is not polyhedral, Lemma 4.3 cannot be used for a characterization of critical directions of order (1, 2).
Let be feasible to (NLSD) and, for some , fix . For later use, fix an orthogonal matrix and a diagonal matrix whose diagonal elements are ordered nonincreasingly such that . The index sets corresponding to the positive, zero, and negative entries on the main diagonal of are denoted by , , and , respectively. We emphasize that, here and throughout the subsection, is a constant index set while and depend on the precise choice of . Subsequently, we use and for each matrix and index sets where is the submatrix of which possesses only those rows and columns of whose indices can be found in I and J, respectively.
The above constructions yield
where and have to be understood in entrywise fashion and is an all-zero matrix of appropriate dimensions. Due to
we find
which directly gives us , , and . Furthermore, we note
Finally, let be the matrix given by
It is well known that the projection onto is directionally differentiable. With the aid of Lemma 2.4 and [75, Corollary 3.1], we find
and if , we obtain
Above, represents the Hadamard, i.e., entrywise product. Note that validity of the final orthogonality condition in the estimate for the graphical subderivative follows from Lemma 2.4 since and yield
due to , , , , , , and . Thus, for each , (3.9) takes the form
while (3.10) and (3.11) (the latter in the case ) are both implied by
In the case where is a local minimizer of the associated problem (P), validity of these conditions for each guarantees that is either M-stationary (we omit stating this well-known system here) or we find and such that
Directional asymptotic regularity in nonsmooth optimization
In this section, we focus on (directional) asymptotic regularity conditions, which essentially correspond to conditions ensuring that (directional) asymptotic stationarity from Corollary 4.5, which serves as a necessary optimality condition for (P) even in the absence of constraint qualifications, translates into M-stationarity. We provide a comprehensive comparison of (directional) asymptotic regularity with various known constraint qualifications. Throughout the section, we consider a set-valued mapping with a closed graph.
On the concept of directional asymptotic regularity
Based on Corollary 4.5, the following definition introduces concepts which may serve as (directional) qualification conditions for the model problem (P).
Definition 5.1
Let be fixed.
The map is said to be asymptotically regular at whenever the following condition holds: for every sequences , , and as well as satisfying , , , and for all , we find .
- For the fixed direction , is said to be asymptotically regular at in direction u whenever the following condition holds: for every sequences , , and as well as and satisfying , , and for each as well as the convergences
we find .5.1 For the fixed direction , is said to be strongly asymptotically regular at in direction u whenever the following condition holds: for every sequences , , and as well as and satisfying , , and for each as well as the convergences (5.1), we have .
Before commenting in detail on these conditions, we would like to emphasize that they can be equivalently formulated in terms of limiting coderivatives completely. The mainly technical proof of this result can be found in Appendix A.
Proposition 5.1
Definition 5.1 can equivalently be formulated in terms of limiting normals.
Having Proposition 5.1 available, let us briefly note that asymptotic regularity of a set-valued mapping at some point in the sense of Definition 5.1 equals AM-regularity of the set at mentioned in [63, Remark 3.17]. The concepts of directional asymptotic regularity from Definition 5.1 (c) and (c) are new.
In the subsequent remark, we summarize some obvious relations between the different concepts from Definition 5.1.
Remark 5.1
Let be fixed. Then the following assertions hold.
Let be arbitrarily chosen. If is strongly asymptotically regular at in direction u, it is asymptotically regular at in direction u.
If is asymptotically regular at , then it is asymptotically regular at in each direction from .
We note that strong asymptotic regularity in each unit direction is indeed not related to asymptotic regularity. On the one hand, the subsequently stated example, taken from [63, Example 3.15], shows that asymptotic regularity does not imply strong asymptotic regularity in each unit direction. On the other hand, Example 5.2 from below illustrates that strong asymptotic regularity in each unit direction does not yield asymptotic regularity.
Example 5.1
We consider given by
at . It is demonstrated in [63, Example 3.15] that is asymptotically regular at . We find so . Let us consider . Then we find . Taking , , as well as
we have for all as well as the convergences (5.1). However, due to , is not strongly asymptotically regular at in direction u.
Combining Corollary 4.5 with the concepts from Definition 5.1, we immediately obtain the following result which motivates our interest in directional asymptotic regularity.
Corollary 5.1
Let be a local minimizer of (P) such that, for each critical direction for (P) at , is asymptotically regular at in direction u. Then is M-stationary.
Proof
Due to Corollary 4.5, it suffices to consider the situation where there are a critical direction for (P) at and as well as sequences and such that , , , and
for all as well as the convergences (4.17) are valid.
Since is a locally Lipschitz continuous function, is bounded, see e.g. [66, Theorem 1.22], and, thus, converges (along a subsequence), to some point which belongs to by robustness of the limiting subdifferential.
We can set for each and obtain and from (4.17c) as well as for each by construction. Additionally, is valid for each .
Now, asymptotic regularity of at in direction u, Proposition 5.1, and the remaining convergences from (4.17) yield , i.e., there exists such that . Recalling shows the claim.
In the light of Remark 5.1 (b), our result from Corollary 5.1 improves [63, Theorem 3.9] by a directional refinement of the constraint qualification since it suffices to check asymptotic regularity w.r.t. particular directions.
We point out that, unlike typical constraint qualifications, (directional) asymptotic regularity allows the existence of sequences satisfying (5.1) as long as the limit is included in which is enough for M-stationarity.
Remark 5.2
Corollary 5.1 requires asymptotic regularity in every (critical) unit direction. Taking into account Remark 4.2, we could also consider an alternative approach to secure M-stationarity, demanding either that there does not exist a critical direction together with the sequences from Definition 5.1 (c), or, in the case of existence, that is asymptotically regular at least in one of these critical directions. For brevity of presentation, we abstain from developing this approach further.
Since (directional) asymptotic regularity (w.r.t. all critical unit directions) yields M-stationarity of a local minimizer by Corollary 5.1, in the remaining part of the paper, we put it into context of other common assumptions that work as a constraint qualification for M-stationarity associated with problem (P). Let us clarify here some rather simple or known connections.
A polyhedral mapping is asymptotically regular at each point of its graph.
Metric regularity implies asymptotic regularity.
Strong metric subregularity implies asymptotic regularity.
FOSCMS does not imply asymptotic regularity, but it implies strong asymptotic regularity in each unit direction.
Metric subregularity does not imply asymptotic regularity in each unit direction. However, if the map of interest is metrically subregular at every point of its graph near the reference point with a uniform constant, then strong asymptotic regularity in each unit direction follows.
Neither asymptotic regularity nor strong directional asymptotic regularity yields the directional exact penalty property of Lemma 4.1.
Statements (a) and (b) were shown in [63, Theorems 3.10 and 3.12]. Let us now argue that strong metric subregularity (the “inverse” property associated with isolated calmness), see [31], also implies asymptotic regularity at the point. This follows easily from the discussion above [20, Corollary 4.6], which yields that the domain of the limiting coderivative, at the point where the mapping is isolatedly calm, is the whole space. Equivalently, the range of the limiting coderivative, at the point where the mapping is strongly metrically subregular, is the whole space and asymptotic regularity thus follows trivially. Thus, statement (c) follows.
Regarding (d), the fact that FOSCMS implies strong asymptotic regularity in each unit direction easily follows by similar arguments that show that metric regularity implies asymptotic regularity, see [63, Lemma 3.11, Theorem 3.12]. Actually, it can be proved that validity of FOSCMS(u) for some unit direction u implies strong asymptotic regularity in direction u. For constraint mappings, this also follows from Corollary 5.3 from below.
The following example shows that FOSCMS does not imply asymptotic regularity.
Example 5.2
Let be given by
Then converges to and
is valid showing that holds for all . On the other hand, we have
and, thus, . This means that is not asymptotically regular at .
On the other hand, we find
Each pair with satisfies , i.e., the direction (u, 0) points into the interior of . Thus, we have which shows that FOSCMS is valid.
Regarding (e), let us fix and note that metric subregularity of on a neighborhood of (restricted to ) with a uniform constant is clearly milder than metric regularity at since it is automatically satisfied, e.g., for polyhedral mappings. To see that it implies asymptotic regularity, consider sequences , , and as well as and satisfying for each and the convergences (5.1) for some unit direction . Due to [20, Theorem 3.2] and , we find for each . Furthermore, [20, Theorem 3.2] also gives the existence of with and . Noting that converges, this shows that there is an accumulation point of which satisfies by robustness of the directional limiting coderivative, see Lemma 2.1. Hence, is strongly asymptotically regular at in direction u. Note that for the above arguments to work, we only need uniform metric subregularity along all sequences converging to from direction (u, 0).
The following example shows that metric subregularity in the neighborhood of the point of interest does not imply asymptotic regularity in each unit direction.
Example 5.3
We consider the mapping given by
Due to , is metrically subregular at all points (x, 0) where is arbitrary. Furthermore, at all points where holds, the Mordukhovich criterion (2.10a) shows that is metrically regular. Thus, is metrically subregular at each point of its graph. Note that the moduli of metric subregularity tend to along the points as or .
Let us consider the point where we have and, thus, . Choosing , , as well as
we have for all as well as the convergences (5.1) for . Due to , is not asymptotically regular at in direction u.
Finally, let us address item (f) with the aid of an example.
Example 5.4
Let us define and by means of
Furthermore, we fix . One can easily check that is the uniquely determined global minimizer of the associated problem (P). Furthermore, we have which shows that is asymptotically regular at as well as strongly asymptotically regular at in direction 1. Furthermore, it is obvious that is strongly asymptotically regular at in direction . Finally, let us mention that fails to be metrically subregular at in direction 1.
Now, define for each and observe that for each constant and sufficiently large , we have , i.e., is not a minimizer of (4.1) for any choice of , , , and .
Directional pseudo- and quasi-normality
In this section, we connect asymptotic regularity with the notions of pseudo- and quasi-normality. Note that the latter concepts have been introduced for standard nonlinear programs in [24, 46], and extensions to more general geometric constraints have been established in [43]. Furthermore, problem-tailored notions of these conditions have been coined e.g. for so-called cardinality-, complementarity-, and switching-constrained optimization problems, see [52, 54, 61]. Let us point out that these conditions are comparatively mild constraint qualifications and sufficient for the presence of metric subregularity of the associated constraint mapping, see e.g. [43, Theorem 5.2]. Here, we extend pseudo- and quasi-normality from the common setting of geometric constraint systems to arbitrary set-valued mappings and comment on the qualitative properties of these conditions. Naturally, we aim for directional versions of these concepts, which, in the setting of geometric constraints, were recently introduced in [15] and further explored in [16].
On the general concept of directional pseudo- and quasi-normality
The definition below introduces the notions of our interest.
Definition 5.2
Fix and a direction .
- We say that pseudo-normality in direction u holds at if there does not exist a nonzero vector satisfying the following condition: there are sequences with for all and , , such that
and as well as for all .5.2 Let be an orthonormal basis of . We say that quasi-normality in direction u holds at w.r.t. if there does not exist a nonzero vector satisfying the following condition: there are sequences with for all and , , such that we have the convergences from (5.2) and, for all and , as well as if .
In the case where the canonical basis is chosen in , the above concept of quasi-normality is a direct generalization of the original notion from [24] which was coined for standard nonlinear problems and neglected directional information. Let us just mention that a reasonable, basis-independent definition of quasi-normality would require that there exists some basis w.r.t. which the mapping of interest is quasi-normal, see also Theorem 5.1.
Note that the sequence in the definition of directional pseudo- and quasi-normality needs to satisfy for all . In the definition of directional pseudo-normality, this is clear from for all . Furthermore, in the definition of directional quasi-normality, observe that implies the existence of such that holds, so that is necessary for each .
In the following lemma, we show the precise relation between directional pseudo- and quasi-normality.
Lemma 5.1
Fix and some direction . Then is pseudo-normal at in direction u if and only if is quasi-normal at in direction u w.r.t. each orthonormal basis of .
Proof
Let be pseudo-normal at in direction u, let be an orthonormal basis of , and pick as well as sequences with for all and , , satisfying the convergences (5.2) and, for all and , as well as if . Observing that we have
validity of pseudo-normality at in direction u gives , i.e., is quasi-normal at in direction u w.r.t. .
Assume that is quasi-normal at in direction u w.r.t. each orthonormal basis of . Suppose that is not pseudo-normal at in direction u. Then we find some nonzero as well as sequences with for all and , , satisfying the convergences (5.2) and as well as for all . Noting that does not vanish, we can construct an orthonormal basis of with . Note that, for , we have if and only if by construction of . Furthermore, we find
This, however, contradicts quasi-normality of at in direction u w.r.t. .
Let us note that [24, Example 1] shows in the nondirectional situation of standard nonlinear programming that pseudo-normality might be more restrictive than quasi-normality w.r.t. the canonical basis in . On the other hand, due to Lemma 5.1, there must exist another basis such that quasi-normality w.r.t. this basis fails since pseudo-normality fails. This depicts that validity of quasi-normality indeed may depend on the chosen basis. In [15], the authors define directional quasi-normality for geometric constraints in Euclidean spaces in componentwise fashion although this is somehow unclear in situations where the image space is different from . Exemplary, in the -dimensional space of all real symmetric -matrices, the canonical basis, which seems to be associated with a componentwise calculus, comprises precisely matrices with precisely two nonzero entries. Our definition of quasi-normality from Definition 5.2 gives some more freedom since the choice of the underlying basis allows to rotate the coordinate system.
Following the arguments in [16, Section 3.2], it also might be reasonable to define intermediate conditions bridging pseudo- and quasi-normality. In the light of this paper, however, the concepts from Definition 5.2 are sufficient for our purposes.
As the following theorem shows, directional quasi- and, thus, pseudo-normality also serve as sufficient conditions for strong directional asymptotic regularity and directional metric subregularity which explains our interest in these conditions. Both statements follow once we clarify that pseudo- and quasi-normality are in fact specifications of the multiplier sequential information in (5.1), namely the convergence .
Theorem 5.1
If is quasi-normal in direction at w.r.t. some orthonormal basis of , then it is also strongly asymptotically regular as well as metrically subregular in direction u at .
Proof
Fix arbitrary sequences , , and as well as and satisfying , , and for each as well as the convergences (5.1). Let us define and for each . The requirements from (5.1) imply that and converge, along a subsequence (without relabeling), to the same nonvanishing limit which we will call . Moreover, given with , for sufficiently large , we get and
Observing that we have from (5.1), we find by definition of the directional limiting coderivative. This contradicts validity of quasi-normality of at in direction u w.r.t. . Particularly, such sequences , , and cannot exist which means that is strongly asymptotically regular in direction u at .
The claim about metric subregularity now follows from [37, Corollary 1], since the only difference from quasi-normality is the requirement
which is the same as as mentioned in the comments after Corollary 4.5.
Relying on this result, [36, Theorem 7] yields that directional pseudo- and quasi-normality provide constraint qualifications for (P) which ensure validity of directional M-stationarity at local minimizers.
We would like to point the reader’s attention to the fact that nondirectional versions of pseudo- and quasi-normality are not comparable with the nondirectional version of asymptotic regularity. This has been observed in the context of standard nonlinear programming, see [5, Sections 4.3, 4.4]. The reason is that the standard version of asymptotic regularity makes no use of the multiplier information (4.17c).
In [22, Section 4.2], which is a preprint version of this paper, our new notions of directional pseudo- and quasi-normality from Definition 5.2 are worked out for so-called optimization problem with equilibrium constraints which cover models with variational inequality constraints, see e.g. [32, 62, 68], or bilevel optimization problems, see e.g. [29, 30].
Directional pseudo- and quasi-normality for geometric constraint systems
Let us now also justify the terminology by showing that the new notions from Definition 5.2 coincide with directional pseudo- and quasi-normality in the case of standard constraint mappings as studied in [16].
We start with a general result relying on calmness of the constraint function. Note that we consider for simplicity of notation. Furthermore, we only focus on the concept of directional quasi-normality in our subsequently stated analysis. Analogous results hold for directional pseudo-normality.
Proposition 5.2
A constraint mapping given by , , where is a continuous function which is calm in direction at such that and is closed, is quasi-normal in direction u at w.r.t. some orthonormal basis of provided there do not exist a direction and a nonzero vector with satisfying the following condition: there are sequences with for all , , , and satisfying , , , ,
| 5.3 |
and, for all and , , , as well as if .
Moreover, if g is even calm near , the two conditions are equivalent.
Proof
Choose and sequences with for all and , satisfying (5.2) with and, for all and , as well as if . Applying Lemma 3.1 (a) yields and for each . The assumed calmness of g at in direction u yields boundedness of the sequence , i.e., along a subsequence (without relabeling) it converges to some . Note also that , i.e., , and that converges to from direction (u, v). Setting for each , we get by continuity of g as well as and if for each and . Moreover, we have
and follows as well. Finally, taking the limit yields and , so that the assumptions of the proposition imply . Consequently, is quasi-normal in direction u at w.r.t. .
Assume that quasi-normality in direction u holds at w.r.t. and that g is calm around . Suppose that there are some , with , and sequences with for all and , , with , , , , (5.3), and, for all and , , , as well as as soon as . Set for each . Then we have ,
and, for all and , as well as if . Since , calmness of g at implies due to Lemma 3.1 (a), and taking the limit yields . Thus, the assumed quasi-normality of at in direction u w.r.t. yields and the claim follows.
If g is continuously differentiable, the situation becomes a bit simpler and we precisely recover the notion of directional quasi-normality for geometric constraint systems as discussed in [16, Definition 3.4].
Corollary 5.2
A constraint mapping given by , , where is continuously differentiable and is closed, is quasi-normal in direction at w.r.t. some orthonormal basis of if and only if there does not exist a nonzero vector with satisfying the following condition: there are sequences with for all , , and satisfying , , ,
| 5.4 |
and, for all and , and if .
In [16, Section 3.3], it has been reported that under additional conditions on the set D, we can drop the sequences and from the characterization of directional quasi-normality in Corollary 5.2. Particularly, this can be done for so-called ortho-disjunctive programs which cover, e.g., standard nonlinear, complementarity-, cardinality-, or switching-constrained optimization problems. In this regard, Corollary 5.2 reveals that some results from [24, 46, 52, 54, 61] are covered by our general concept from Definition 5.2.
Let us briefly compare our results with the approach from [15].
Remark 5.3
Let us consider the setting discussed in Proposition 5.2. The directional versions of pseudo- and quasi-normality from [15] operate with all nonzero pairs of directions (u, v), rather than just a fixed u. The advantage is that calmness of g plays no role. The reason is, however, that the authors in [15] only derive statements regarding metric subregularity, but not metric subregularity in some fixed direction. Calmness of g is needed precisely for preservation of directional information. We believe that it is useful to know how to verify if a mapping is metrically subregular in a specific direction since only some directions play a role in many situations. We could drop the calmness assumption from Proposition 5.2, but, similarly as in [18, Theorem 3.1], additional directions of the type (0, v) for a nonzero v would appear. Clearly, such directions are included among all nonzero pairs (u, v), but the connection to the original direction u would have been lost.
Sufficient conditions for asymptotic regularity via pseudo-coderivatives
The role of super-coderivatives
We start this section by interrelating the concept of super-coderivatives from Definition 2.4 and asymptotic regularity. Fix and choose , , and as well as and satisfying , , and for all as well as the convergences (5.1). For each , we set , ,
and find as well as
Along a subsequence (without relabeling), holds for some . Thus, taking the limit , we have by definition of the super-coderivative. Moreover, from (5.1) we also know that . Consequently, we come up with the following lemma.
Lemma 5.2
Let and be fixed. If
holds for all , then is asymptotically regular at in direction u. If the above estimate holds for all with replaced by , then is strongly asymptotically regular at in direction u.
The next result, which is based on hypothesis , see Assumption 4.1, follows as a corollary of Lemmas 2.9 and 5.2, and gives new sufficient conditions for directional asymptotic regularity. Note that strong directional asymptotic regularity can be handled analogously by employing an adjusted version of where in the right-hand side of (4.15) is replaced by .
Theorem 5.2
Let , , and be fixed. If holds, then is asymptotically regular at in direction u.
In the case where the pseudo-coderivatives involved in the construction of can be computed or estimated from above, new applicable sufficient conditions for (strong) directional asymptotic regularity are provided by Theorem 5.2. Particularly, in situations where is given in form of a constraint mapping and is fixed, we can rely on the results obtained in Sect. 3 in order to make the findings of Theorem 5.2 more specific. This will be done in the next subsection.
The case of constraint mappings
Throughout the section, we assume that is given by , , where is a twice continuously differentiable function and is a closed set. Furthermore, for simplicity of notation, we fix which is not restrictive as already mentioned earlier.
We start with a general result which does not rely on any additional structure of the set D.
Theorem 5.3
Let as well as be fixed. Assume that (3.9) holds, as well as (3.10) or, in the case , (3.11). If, for each and satisfying
| 5.5a |
| 5.5b |
| 5.5c |
there is some such that , then is asymptotically regular at in direction u. Moreover, is even strongly asymptotically regular at in direction u if can be chosen from .
Proof
Theorem 3.1 (a) implies (and so, due to (2.7), also ) as well as that for , we find satisfying (5.5). The assumptions guarantee that we can find such that where we used Lemma 3.1 (b). It follows . Thus, Theorem 5.2 shows that is asymptotically regular at in direction u. The statement regarding strong asymptotic regularity follows in analogous way while respecting Lemma 3.1 (c).
We note that (3.10) is stronger than (3.11) when holds, see (2.3). Naturally, this means that it is sufficient to check (3.10) regardless whether vanishes or not. In the case , however, it is already sufficient to check the milder condition (3.11). This will be important later on, see Proposition 5.3 and Remark 5.4 below.
Note also that we implicitly relied on condition (4.16) (with and ) in the proof of Theorem 5.3, and not on the milder refined condition (4.15) (again with and ) which appears in the statement of . This happened due to the generality of the setting in Theorem 5.3. In the polyhedral situation, (4.15) can be employed to obtain the following improved result.
Theorem 5.4
Let as well as be fixed. Let and let D be polyhedral locally around . Assume that condition (3.13) holds for each . If, for each , , and satisfying (5.5a) and
| 5.6 |
where , and as well as have been defined in (3.7), there is some such that , then is asymptotically regular at in direction u. Moreover, is even strongly asymptotically regular at in direction u if can be chosen from .
Proof
Due to Theorem 3.2, (3.13) yields in the present situation. Now, fix . Then Theorem 3.1 (b) shows the existence of such that . Let us now consider the case for some and . If holds, we can employ (2.7) to find and, thus, the above argumentation applies. Thus, let us consider and set . Then we have for with and . Theorem 3.2 implies the existence of such that (5.5a) and (5.6) hold with . Now, the postulated assumptions guarantee the existence of such that . Respecting Lemma 3.1 (b), this shows (4.15) with and . Thus, Theorem 5.2 yields that is asymptotically regular at in direction u. The statement regarding strong asymptotic regularity follows analogously.
Due to Corollary 5.1, Theorems 5.3 and 5.4 provide constraint qualifications for M-stationarity. Interestingly, one can easily check that the same conditions can also be obtained from Proposition 4.2 by demanding that any mixed-order stationary point is already M-stationary.
In the remaining part of the section, we prove that the assumptions of Theorem 5.3 are not stronger than FOSCMS(u) while the assumptions of Theorem 5.4 are strictly weaker than the so-called Second-Order Sufficient Condition for Metric Subregularity (SOSCMS) in direction u.
Given a point with , Lemma 3.1 (c) shows that the condition
equals FOSCMS in the current setting. In the case where D is locally polyhedral around , the refined condition
is referred to as SOSCMS in the literature. As these names suggest, both conditions are sufficient for metric subregularity of at , see [39, Corollary 1]. Particularly, they provide constraint qualifications for M-stationarity of local minimizers. Again, with the aid of Lemma 3.1 (c), one can easily check that
equals FOSCMS(u) in the present setting, and
will be denoted by SOSCMS(u). Each of the conditions FOSCMS(u) and SOSCMS(u) is sufficient for metric subregularity of at in direction u.
Proposition 5.3
Consider and . Under FOSCMS(u) all assumptions of Theorem 5.3 are satisfied.
Proof
Let be such that . Then FOSCMS(u) yields and so (3.9) is satisfied. Moreover, we only need to show the remaining assertions for .
Assume that holds. Suppose now that (3.11) is violated, i.e., there exists for with . By Lemma 2.5 and FOSCMS(u), we thus get which is a contradition since by Definition 2.2. Similarly, in the case , we can verify (3.10) which reduces to
Applying Lemma 2.5 again, we get which implies since FOSCMS(u) corresponds to the Mordukhovich criterion due to . Thus, we have shown that (3.10) or, in the case , (3.11) holds.
Validity of the last assumption follows immediately since is obtained from Lemma 2.5, and so we can just take due to .
Remark 5.4
Note that for satisfying , we have the trivial upper estimate . Hence, in Theorem 5.3, it is possible to replace validity of (3.10) or, in the case , (3.11) by the slightly stronger assumption that (3.10) has to hold (even in the case ). However, we cannot show anymore that FOSCMS(u) is sufficient for this stronger assumption to hold, i.e., dropping directional information comes for a price.
Proposition 5.4
Let as well as be fixed, let , and let D be polyhedral locally around . If SOSCMS(u) is valid, then the assumptions of Theorem 5.4 are satisfied.
Proof
The key step is to realize that if for some and , then we get
by Remark 3.3 and , and also holds, again by Remark 3.3.
Then (3.13) follows because for , the relation is obtained, and SOSCMS(u) yields .
Next, for arbitrary with and for some , we get , so SOSCMS(u) can still be applied to give . Now, we can always take since .
We immediately arrive at the following corollary.
Corollary 5.3
The constraint mapping is strongly asymptotically regular at in direction if FOSCMS(u) holds or if , D is locally polyhedral around , and SOSCMS(u) holds.
The following example shows that our new conditions from Theorem 5.4 are in fact strictly milder than SOSCMS.
Example 5.5
Let and be given by , , and . Observe that D is a polyhedral set. We consider the constraint map given by , . We note that holds. Hence, fixing , we can easily check that is metrically subregular at in direction 1 but not in direction , i.e., FOSCMS and SOSCMS must be violated.
First, we claim that all the assumptions from Theorem 5.4 are satisfied for . Taking into account Remark 3.3, it suffices to verify these assumptions for replaced by 0. Let us fix , such that and for . We have , , and
Thus, for , we have regardless of . Hence, condition (3.13) holds trivially and we can choose to find as well as . For , we get and . Thus, if , from we deduce , and (3.13) follows. For arbitrary , we get and we can choose to obtain . Note, however, that unless .
Regarding the assumptions of Theorem 5.3, let us just mention, without providing the details, that (3.10) and (3.11) fail since the graphical (sub)derivative is too large. Particularly, this clarifies that these assumptions are not necessary e.g. in the polyhedral setting, but not because they would be satisfied automatically.
Concluding remarks
In this paper, we enriched the general concepts of asymptotic stationarity and regularity with the aid of tools from directional limiting variational analysis. Our central result Theorem 4.1 states that, even in the absence of any constraint qualification, local minimizers of a rather general optimization problem are M-stationary, mixed-order stationary in terms of a suitable pseudo-coderivative, or asymptotically stationary in a critical direction (of a certain order). By ruling out the last option, we were in position to distill new mixed-order necessary optimality conditions. Some novel upper estimates for the second-order directional pseudo-coderivative of constraint mappings were successfully employed to make these results fully explicit in the presence of geometric constraints. Our findings also gave rise to the formulation of directional notions of asymptotic regularity for set-valued mappings. These conditions have been shown to serve as constraint qualifications guaranteeing M-stationarity of local minimizers in nonsmooth optimization. We embedded these new qualification conditions into the landscape of constraint qualifications which are already known from the literature, showing that these conditions are comparatively mild. Noting that directional asymptotic regularity might be difficult to check in practice, we then focused on the derivation of applicable sufficient conditions for its validity. First, we suggested directional notions of pseudo- and quasi-normality for that purpose which have been shown to generalize related concepts for geometric constraint systems to arbitrary set-valued mappings. Second, with the aid of so-called super- and pseudo-coderivatives, sufficient conditions for the presence of directional asymptotic regularity for geometric constraint systems in terms of first- and second-order derivatives of the associated mapping as well as standard variational objects associated with the underlying set were derived. These sufficient conditions turned out to be not stronger than the First- and Second-Order Sufficient Condition for Metric Subregularity from the literature.
In this paper, we completely neglected to study the potential value of directional asymptotic regularity in numerical optimization which might be a promising topic of future research. Furthermore, it has been shown in [63] that nondirectional asymptotic regularity can be applied nicely as a qualification condition in the limiting variational calculus. Most likely, directional asymptotic regularity may play a similar role in the directional limiting calculus. Finally, it seems desirable to further develop the calculus for pseudo-coderivatives for mappings which possess a more difficult structure than constraint mappings.
Acknowledgements
The authors would like to thank the referees and the associated editor for valuable comments which helped to improve the presentation of the material. Particularly, the authors are grateful to one of the reviewers who pointed out the close relationship with 2-regularity and suggested Example 4.1. Some critical remarks from another reviewer about the presentation of an earlier version of Proposition 4.2, that are thankfully acknowledged, led to improvements which allowed for a better comparison with related results from the literature in Sections 3.2 and 4.3. The research of Matúš Benko was supported by the Austrian Science Fund (FWF) under grant P32832-N as well as by the infrastructure of the Institute of Computational Mathematics, Johannes Kepler University Linz, Austria.
Missing proofs
Proof of Lemma 2.8
We only verify the (more technical) assertion regarding Definition 2.3 (b) as the proof for the assertion which addresses Definition 2.3 (c) follows in similar (but slightly easier) fashion.
Thus, fix and as well as , , and which satisfy , , , , , and
By definition of the limiting normal cone, for each , we find and such that , , , and as and for all .
For each , let us define sequences and by means of
This gives
| A.1 |
Furthermore, we have the convergences , , and as by construction. Thus, for each , we find an index such that
Let us set , , , and for each . The above estimates and , , , as well as give , , , as well as . Additionally, (A.1) guarantees
By definition of the directional pseudo-coderivative, , is obtained and this shows the claim.
Proof of Proposition 5.1
For nondirectional asymptotic regularity, the proof is standard and follows from a simple diagonal sequence argument. The proof for strong directional asymptotic regularity parallels the one for directional asymptotic regularity which is presented below.
Since one implication is clear by definition of the regular and limiting coderivative, we only show the other one. Therefore, let be asymptotically regular at in direction u. Let us fix sequences , , and as well as and satisfying , , and for each as well as the convergences (5.1). For each , we find sequences , , and with , , , and as as well as for each . Observing that is closed, its complement is open so that holds for sufficiently large . Furthermore, since and are valid, we can choose an index so large such that the estimates
and as well as are valid. For each , we set , , , and . Clearly, we have , , , , , and , , as well as for each by construction. Furthermore, we find
for each . With the above estimates at hand, we obtain
and
| A.2 |
so that, with the aid of (5.1), we find as well as . With the aid of (A.2),
is obtained, which gives . Similar as above, we find
and
so that (5.1) gives us
Now, since is asymptotically regular at in direction u, we obtain .
Funding
Open Access funding enabled and organized by Projekt DEAL.
Declarations
Conflict of interest
No potential Conflict of interest was reported by the authors.
Footnotes
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
References
- 1.Adam, L., Červinka, M., Pištěk, M.: Normally admissible stratifications and calculation of normal cones to a finite union of polyhedral sets. Set-Valued Var. Anal. 24, 207–229 (2016). 10.1007/s11228-015-0325-8 [Google Scholar]
- 2.Andreani, R., Gómez, W., Haeser, G., Mito, L.M., Ramos, A.: On optimality conditions for nonlinear conic programming. Math. Oper. Res. 47(3), 2160–2185 (2021). 10.1287/moor.2021.1203 [Google Scholar]
- 3.Andreani, R., Haeser, G., Martínez, J.M.: On sequential optimality conditions for smooth constrained optimization. Optimization 60(5), 627–641 (2011). 10.1080/02331930903578700 [Google Scholar]
- 4.Andreani, R., Haeser, G., Secchin, L.D., Silva, P.J.S.: New sequential optimality conditions for mathematical programs with complementarity constraints and algorithmic consequences. SIAM J. Optim. 29(4), 3201–3230 (2019). 10.1137/18M121040X [Google Scholar]
- 5.Andreani, R., Martínez, J.M., Ramos, A., Silva, P.J.S.: A cone-continuity constraint qualification and algorithmic consequences. SIAM J. Optim. 26(1), 96–110 (2016). 10.1137/15M1008488 [Google Scholar]
- 6.Andreani, R., Martínez, J.M., Ramos, A., Silva, P.J.S.: Strict constraint qualifications and sequential optimality conditions for constrained optimization. Math. Oper. Res. 43(3), 693–717 (2018). 10.1287/moor.2017.0879 [Google Scholar]
- 7.Andreani, R., Martínez, J.M., Svaiter, B.F.: A new sequential optimality condition for constrained optimization and algorithmic consequences. SIAM J. Optim. 20(6), 3533–3554 (2010). 10.1137/090777189
- 8.Arutyunov, A.V., Izmailov, A.F.: Covering on a convex set in the absence of Robinson’s regularity. SIAM J. Optim. 30(1), 604–629 (2020). 10.1137/19M1256634 [Google Scholar]
- 9.Arutyunov, A.V., Avakov, E.R., Izmailov, A.F.: Necessary optimality conditions for constrained optimization problems under relaxed constraint qulifications. Math. Program. 114, 37–68 (2008). 10.1007/s10107-006-0082-4
- 10.Aubin, J.P., Frankowska, H.: Set-valued Analysis. Modern Birkhäuser Classics, Birkhäuser, Boston, (2009). 10.1007/978-0-8176-4848-0, reprint of the 1990 edition
- 11.Avakov, E.R.: Extremum conditions for smooth problems with equality-type constraints. USSR Comput. Math. Math. Phys. 25(3), 24–32 (1985). 10.1016/0041-5553(85)90069-2 [Google Scholar]
- 12.Avakov, E.R.: Necessary extremum conditions for smooth anormal problems with equality- and inequality-type constraints. Math. Notes Acad. Sci. USSR 45, 431–437 (1989). 10.1007/BF01158229 [Google Scholar]
- 13.Avakov, E.R., Arutyunov, A.V., Izmailov, A.F.: Necessary conditions for an extremum in a mathematical programming problem. Proc. Stekalov Inst. Math. 256, 2–25 (2007). 10.1134/S0081543807010014 [Google Scholar]
- 14.Bai, K., Ye, J.J.: Directional necessary optimality conditions for bilevel programs. Math. Oper. Res. 47(2), 1169–1191 (2022). 10.1287/moor.2021.1164 [Google Scholar]
- 15.Bai, K., Ye, J.J., Zhang, J.: Directional quasi-/pseudo-normality as sufficient conditions for metric subregularity. SIAM J. Optim. 29(4), 2625–2649 (2019). 10.1137/18M1232498 [Google Scholar]
- 16.Benko, M., Červinka, M., Hoheisel, T.: Sufficient conditions for metric subregularity of constraint systems with applications to disjunctive and ortho-disjunctive programs. Set-Valued Var. Anal. 30, 1143–177 (2022). 10.1007/s11228-020-00569-7 [Google Scholar]
- 17.Benko, M., Gfrerer, H.: New verifiable stationarity concepts for a class of mathematical programs with disjunctive constraints. Optimization 67(1), 1–23 (2018). 10.1080/02331934.2017.1387547 [DOI] [PMC free article] [PubMed] [Google Scholar]
- 18.Benko, M., Gfrerer, H., Outrata, J.V.: Calculus for directional limiting normal cones and subdifferentials. Set-Valued Var. Anal. 27(3), 713–745 (2019). 10.1007/s11228-018-0492-5 [Google Scholar]
- 19.Benko, M., Gfrerer, H., Ye, J.J., Zhang, J., Zhou, J.C.: Second-order optimality conditions for general nonconvex optimization problems and variational analysis of disjunctive systems. SIAM J. Optim. 33(4), 2625–2653 (2023). 10.1137/22M1484742 [Google Scholar]
- 20.Benko, M., Mehlitz, P.: Calmness and calculus: two basic patterns. Set-Valued Var. Anal. 30, 81–117 (2022a). 10.1007/s11228-021-00589-x
- 21.Benko, M., Mehlitz, P.: On the directional asymptotic approach in optimization theory Part A: approximate, M-, and mixed-order stationarity. Tech. rep., preprint arXiv, (2022b) arxiv:2204.13932
- 22.Benko, M., Mehlitz, P.: On the directional asymptotic approach in optimization theory Part B: constraint qualifications. Tech. rep., preprint arXiv, (2022c) arxiv:2205.00775 [DOI] [PMC free article] [PubMed]
- 23.Bertsekas, D., Nedić, A., Ozdaglar, A.E.: Convex analysis and optimization. Athena Scientific, Belmont (2003) [Google Scholar]
- 24.Bertsekas, D.P., Ozdaglar, A.E.: Pseudonormality and a Lagrange multiplier theory for constrained optimization. J. Optim. Theory Appl. 114, 287–343 (2002). 10.1023/A:1016083601322 [Google Scholar]
- 25.Bonnans, J.F., Shapiro, A.: Perturbation Analysis of Optimization Problems. Springer, New York (2000). 10.1007/978-1-4612-1394-9
- 26.Börgens, E., Kanzow, C., Mehlitz, P., Wachsmuth, G.: New constraint qualifications for optimization problems in Banach spaces based on asymptotic KKT conditions. SIAM J. Optim. 30(4), 2956–2982 (2020). 10.1137/19M1306804 [Google Scholar]
- 27.Burke, J.V.: Calmness and exact penalization. SIAM J. Control. Optim. 29(2), 493–497 (1991). 10.1137/0329027 [Google Scholar]
- 28.Clarke, F.: Optimization and Nonsmooth Analysis. Wiley, New York (1983). 10.1137/1.9781611971309 [Google Scholar]
- 29.Dempe, S.: Foundations of Bilevel Programming. Kluwer, Dordrecht (2002). 10.1007/b101970 [Google Scholar]
- 30.Dempe, S., Kalashnikov, V., Pérez-Valdéz, G., Kalashnykova, N.: Bilevel Programming Problems - Theory. Algorithms and Applications to Energy Networks, Springer, Berlin (2015). 10.1007/978-3-662-45827-3 [Google Scholar]
- 31.Dontchev, A.L., Rockafellar, R.T.: Implicit Functions and Solution Mappings. Springer, Heidelberg (2014). 10.1007/978-0-387-87821-8 [Google Scholar]
- 32.Facchinei, F., Pang, J.S.: Finite-Dimensional Variational Inequalities and Complementarity Problems. Springer, New York (2003). 10.1007/b97543 [Google Scholar]
- 33.Fischer, A., Izmailov, A.F., Jelitte, M.: Newton-type methods near critical solutions of piecewise smooth nonlinear equations. Comput. Optim. Appl. 80, 587–615 (2021). 10.1007/s10589-021-00306-2 [Google Scholar]
- 34.Fischer, A., Izmailov, A.F., Jelitte, M.: Behavior of Newton-type methods near critical solutions of nonlinear equations with semismooth derivatives. J. Optim. Theory Appl. (2023). 10.1007/s10957-023-02350-w [Google Scholar]
- 35.Gfrerer, H.: Second-order necessary conditions for nonlinear optimization problems with abstract constraints: the degenerate case. SIAM J. Optim. 18(2), 589–612 (2007). 10.1137/050641387 [Google Scholar]
- 36.Gfrerer, H.: On directional metric regularity, subregularity and optimality conditions for nonsmooth mathematical programs. Set-Valued Var. Anal. 21(2), 151–176 (2013). 10.1007/s11228-012-0220-5 [Google Scholar]
- 37.Gfrerer, H.: On metric pseudo-(sub)regularity of multifunctions and optimality conditions for degenerated mathematical programs. Set-Valued Var. Anal. 22(1), 79–115 (2014). 10.1007/s11228-013-0266-z [Google Scholar]
- 38.Gfrerer, H.: Optimality conditions for disjunctive programs based on generalized differentiation with application to mathematical programs with equilibrium constraints. SIAM J. Optim. 24(2), 898–931 (2014). 10.1137/130914449 [Google Scholar]
- 39.Gfrerer, H., Klatte, D.: Lipschitz and Hölder stability of optimization problems and generalized equations. Math. Program. 158, 35–75 (2016). 10.1007/s10107-015-0914-1 [Google Scholar]
- 40.Gfrerer, H., Outrata, J.V.: On computation of limiting coderivatives of the normal-cone mapping to inequality systems and their applications. Optimization 65(4), 671–700 (2016). 10.1080/02331934.2015.1066372 [Google Scholar]
- 41.Gfrerer, H., Ye, J.J.: New constraint qualifications for mathematical programs with equilibrium constraints via variational analysis. SIAM J. Optim. 27(2), 842–865 (2017). 10.1137/16M1088752 [Google Scholar]
- 42.Gfrerer, H., Ye, J.J., Zhou, J.: Second-order optimality conditions for nonconvex set-constrained optimization problems. Math. Oper. Res. 47(3), 2344–2365 (2022). 10.1287/moor.2021.1211 [Google Scholar]
- 43.Guo, L., Ye, J.J., Zhang, J.: Mathematical programs with geometric constraints in Banach spaces: enhanced optimality, exact penalty, and sensitivity. SIAM J. Optim. 23(4), 2295–2319 (2013). 10.1137/130910956 [Google Scholar]
- 44.Haraux, A.: How to differentiate the projection on a convex set in Hilbert space. Some applications to variational inequalities. J. Math. Soc. Jpn. 29(4), 615–631 (1977). 10.2969/jmsj/02940615 [Google Scholar]
- 45.Helou, E.S., Santos, S.A., Simões, L.E.A.: A new sequential optimality condition for constrained nonsmooth optimization. SIAM J. Optim. 30(2), 1610–1637 (2020). 10.1137/18M1228608 [Google Scholar]
- 46.Hestenes, M.R.: Optimization Theory - the Finite-Dimensional Case. Wiley, New York (1975) [Google Scholar]
- 47.Ioffe, A.D.: Regular points of Lipschitz functions. Trans. Am. Math. Soc. 251, 61–69 (1979). 10.1090/S0002-9947-1979-0531969-6 [Google Scholar]
- 48.Ioffe, A.D.: Variational Analysis of Regular Mappings. Springer, Cham (2017). 10.1007/978-3-319-64277-2 [Google Scholar]
- 49.Izmailov, A.F., Kurennoy, A.S., Solodov, M.V.: Critical solutions of nonlinear equations: local attraction for Newton-type methods. Math. Program. 167, 355–379 (2018). 10.1007/s10107-017-1128-5 [Google Scholar]
- 50.Izmailov, A.F., Solodov, M.V.: Complementarity constraint qualification via the theory of 2-regularity. SIAM J. Optim. 13(2), 368–385 (2002). 10.1137/S1052623499365292 [Google Scholar]
- 51.Izmailov, A.F., Solodov, M.V.: The theory of 2-regularity for mappings with Lipschitzian derivatives and its applications to optimality conditions. Math. Oper. Res. 27(3), 614–635 (2002). 10.1287/moor.27.3.614.308 [Google Scholar]
- 52.Kanzow, C., Raharja, A.B., Schwartz, A.: An augmented Lagrangian method for cardinality-constrained optimization problems. J. Optim. Theory Appl. 189, 793–813 (2021). 10.1007/s10957-021-01854-7 [Google Scholar]
- 53.Kanzow, C., Raharja, A.B., Schwartz, A.: Sequential optimality conditions for cardinality-constrained optimization problems with applications. Comput. Optim. Appl. 80, 185–211 (2021). 10.1007/s10589-021-00298-z [Google Scholar]
- 54.Kanzow, C., Schwartz, A.: Mathematical programs with equilibrium constraints: enhanced Fritz John-conditions, new constraint qualifications, and improved exact penalty results. SIAM J. Optim. 20(5), 2730–2753 (2010). 10.1137/090774975 [Google Scholar]
- 55.Kanzow, C., Steck, D., Wachsmuth, D.: An augmented Lagrangian method for optimization problems in Banach spaces. SIAM J. Control. Optim. 56(1), 272–291 (2018). 10.1137/16M1107103 [Google Scholar]
- 56.Klatte, D., Kummer, B.: Constrained minima and Lipschitzian penalties in metric spaces. SIAM J. Optim. 13(2), 619–633 (2002). 10.1137/S105262340139625X [Google Scholar]
- 57.Kruger, A.Y.: Generalized differentials of nonsmooth functions and necessary conditions for an extremum. Sibirian Math. J. 26, 370–379 (1985) [Google Scholar]
- 58.Kruger, A.Y., Mehlitz, P.: Optimality conditions, approximate stationarity, and applications-a story beyond Lipschitzness. ESAIM Control Optim. Calc. Var. 28, 42 (2022). 10.1051/cocv/2022024 [Google Scholar]
- 59.Kruger, A.Y., Mordukhovich, B.S.: Extremal points and the Euler equation in nonsmooth optimization problems. Doklady Akademii Nauk BSSR 24(8), 684–687 (1980) [Google Scholar]
- 60.Levy, A.B.: Implicit multifunction theorems for the sensitivity analysis of variational conditions. Math. Program. 74, 333–350 (1996). 10.1007/BF02592203 [Google Scholar]
- 61.Liang, Y.C., Ye, J.J.: Optimality conditions and exact penalty for mathematical programs with switching constraints. J. Optim. Theory Appl. 190, 1–31 (2021). 10.1007/s10957-021-01879-y [Google Scholar]
- 62.Luo, Z.Q., Pang, J.S., Ralph, D.: Mathematical Programs with Equilibrium Constraints. Cambridge University Press, Cambridge (1996). 10.1017/CBO9780511983658 [Google Scholar]
- 63.Mehlitz, P.: Asymptotic stationarity and regularity for nonsmooth optimization problems. J. Nonsmooth Anal. Optim. 1,6575, (2020) 10.46298/jnsao-2020-6575 [DOI]
- 64.Mehlitz, P.: Asymptotic regularity for Lipschitzian nonlinear optimization problems with applications to complementarity constrained and bilevel programming. Optimization 72(1), 277–320 (2023). 10.1080/02331934.2022.2031190 [Google Scholar]
- 65.Mordukhovich, B.S.: Variational Analysis and Generalized Differentiation, Part I: Basic Theory. Applications. Springer, Berlin, Part II (2006). 10.1007/3-540-31247-1
- 66.Mordukhovich, B.S.: Variational Analysis and Applications. Springer, Cham (2018). 10.1007/978-3-319-92775-6
- 67.Mordukhovich, B.S., Outrata, J.V., Ramírez, C.H.: Second-order variational analysis in conic programming with applications to optimality and stability. SIAM J. Optim. 25(1), 76–101 (2015). 10.1137/120903221 [Google Scholar]
- 68.Outrata, J.V., Kočvara, M., Zowe, J.: Nonsmooth Approach to Optimization Problems with Equilibrium Constraints. Kluwer Academic, Dordrecht (1998). 10.1007/978-1-4757-2825-5 [Google Scholar]
- 69.Outrata, J.V., Sun, D.: On the coderivative of the projection operator onto the second-order cone. Set-Valued Anal. 16, 999–1014 (2008). 10.1007/s11228-008-0092-x [Google Scholar]
- 70.Ramos, A.: Mathematical programs with equilibrium constraints: a sequential optimality condition, new constraint qualifications and algorithmic consequences. Optim. Methods Softw. 36, 45–81 (2021). 10.1080/10556788.2019.1702661 [Google Scholar]
- 71.Rockafellar, R.T., Wets, R.J.B.: Variational Analysis, Grundlehren der mathematischen Wissenschaften, vol. 317. Springer, Berlin (1998). 10.1007/978-3-642-02431-3 [Google Scholar]
- 72.Shapiro, A.: On concepts of directional differentiability. J. Optim. Theory Appl. 66, 477–478 (1990). 10.1007/BF00940933 [Google Scholar]
- 73.Sun, D., Sun, J.: Semismooth matrix-valued functions. Math. Oper. Res. 27(1), 150–169 (2002). 10.1287/moor.27.1.150.342 [Google Scholar]
-
74.Tret’ Yakov, A.A.: Necessary and sufficient conditions for optimality of
-th order. USSR Comput. Math. Math. Phys. 24(1), 123–127 (1984). 10.1016/0041-5553(84)90132-0 [Google Scholar] - 75.Wu, J., Zhang, L., Zhang, Y.: Mathematical programs with semidefinite cone complementarity constraints: constraint qualifications and optimality conditions. Set-Valued Var. Anal. 22, 155–187 (2014). 10.1007/s11228-013-0242-7 [Google Scholar]
- 76.Ye, J.J., Ye, X.Y.: Necessary optimality conditions for optimization problems with variational inequality constraints. Math. Oper. Res. 22(4), 977–997 (1997). 10.1287/moor.22.4.977 [Google Scholar]
