Skip to main content
Springer logoLink to Springer
. 2024 Jul 5;209(1-2):859–937. doi: 10.1007/s10107-024-02089-w

On the directional asymptotic approach in optimization theory

Matúš Benko 1,2, Patrick Mehlitz 3,
PMCID: PMC11735583  PMID: 39830447

Abstract

As a starting point of our research, we show that, for a fixed order γ1, 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 γ:=2, and visualized by examples from complementarity-constrained and nonlinear semidefinite optimization. As a byproduct of the particular setting γ:=1, 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, 57], 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. [1416, 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 γ1, 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 γ:=1, 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 γ:=1, we end up with M-stationarity, and metric pseudo-subregularity reduces to metric subregularity, i.e., we obtain results related to [36]. For γ>1, 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 γ:=2 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, 1113, 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 γ:=1) 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 R, R+, and R- denote the real, the nonnegative real, and the nonpositive real numbers, respectively. The sign function sgn:R{-1,0,1} is defined by sgn(t):=-1 for all t<0, sgn(t):=1 for all t>0, and sgn(0):=0. Throughout the paper, X and Y 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 X will be represented by SX. Furthermore, for ε>0 and x¯X, Bε(x¯):={xX|x-x¯ε} is the closed ε-ball around x¯. We are also concerned with so-called (closed) directional neighborhoods of given directions. These are sets of type

Bε,δ(u):={wX|wu-uwδuw,wε},

where uX is a reference direction and ε,δ>0. Clearly, Bε,δ(0)=Bε(0). For a nonempty set QX, the closed convex cone Q:={ηX|xQ:η,x0} is referred to as the polar cone of Q. Furthermore, for some x¯X, [x¯]:={ηX|η,x¯=0} and span(x¯) are the annihilator of x¯ and the smallest subspace of X containing x¯, respectively. By dist(x¯,Q):=infx{x-x¯|xQ}, we denote the distance of x¯ to Q. For simplicity, we use x¯+Q:=Q+x¯:={x+x¯X|xQ}. The closure and the horizon cone of Q are represented by cl(Q) and Q, respectively. For a given linear operator A:XY, A:YX is used to denote its adjoint while ImA:={AxY|xX} is the image of A.

Let g:XY be a continuously differentiable mapping. We use g(x¯):XY to denote the derivative of g at x¯X. Note that g(x¯) is a linear operator. Let us emphasize that, in the special case Y:=R, g(x¯) does not coincide with the standard gradient which would correspond to g(x¯)1. For twice continuously differentiable g and a vector λY, we set λ,g(x):=λ,g(x) for each xX in order to denote the associated scalarization mapping λ,g:XR. By λ,g(x¯) and 2λ,g(x¯) we represent the first- and second-order derivatives of this map at x¯X (w.r.t. the variable which enters g). Furthermore, for u,uX, we make use of

2g(x¯)[u,u]:=i=1mu,2eic,g(x¯)(u)eic

for brevity where mN is the dimension of Y and e1c,,emcY denote the m canonical unit vectors of Y. In the case Y:=R, the second-order derivative 2g(x¯):X×XR is a bilinear mapping, and for each uX, we identify 2g(x¯)u with an element of X.

Fundamentals of variational analysis

Let us fix a closed set QX and some point xQ. We use

TQ(x):=uX{uk}kNX,{tk}kNR+:uku,tk0,x+tkukQkN

to denote the (Bouligand) tangent cone to Q at x. Furthermore, we make use of

graphic file with name 10107_2024_2089_Equ241_HTML.gif

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 x~Q, we set TQ(x~):= and N^Q(x~):=NQ(x~):=. Finally, for some uX, we use

NQ(x;u):=ηX{uk}kNX,{tk}kNR+,{ηk}kNX:uku,tk0,ηkη,ηkN^Q(x+tkuk)kN

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 TQ(x). If Q is convex, we have NQ(x;u)=NQ(x)[u].

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 QX be closed and fix xQ. Then, for each uX, we have

NQ(x;u)=ηX{uk}kNX,{tk}kNR+,{ηk}kNX:uku,tk0,ηkη,ηkNQ(x+tkuk)kN.

In this paper, the concept of polyhedrality will be of essential importance. Let us recall that a set QRm will be called polyhedral if it is the union of finitely many convex polyhedral sets. Similarly, it is referred to as locally polyhedral around xQ whenever Q{zRm|i{1,,m}:|zi-xi|ε} is polyhedral for some ε>0. 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 QRm be a closed set which is locally polyhedral around some fixed point xQ. Then the following statements hold.

  1. There exists a neighborhood URm of x such that (x+TQ(x))U=QU.

  2. For arbitrary uRm, we have
    NQ(x;u)=NTQ(x)(u)NQ(x)[u]. 2.1
    If Q is, additionally, convex, and uTQ(x), then the final inclusion holds as an equality.

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

  1. For closed sets PX and QY as well as xP and yQ, we have TP×Q(x,y)TP(x)×TQ(y).

  2. For closed sets PRn and QRm as well as xP and yQ, such that P and Q are locally polyhedral around x and y, respectively, we have TP×Q(x,y)=TP(x)×TQ(y).

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 Φ:XY, we use domΦ:={xX|Φ(x)}, gphΦ:={(x,y)X×Y|yΦ(x)}, kerΦ:={xX|0Φ(x)}, and ImΦ:=xXΦ(x) in order to represent the domain, graph, kernel, and image of Φ, respectively. Furthermore, the so-called inverse mapping Φ-1:YX is defined via gphΦ-1:={(y,x)Y×X|(x,y)gphΦ}.

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 Φ:XY which has a closed graph locally around (x¯,y¯)gphΦ, a pair of directions (u,v)X×Y, and a constant γ1.

  1. We say that Φ is metrically pseudo-regular of order γ in direction (uv) at (x¯,y¯) if there are constants ε>0, δ>0, and κ>0 such that the estimate
    x-x¯γ-1dist(x,Φ-1(y))κdist(y,Φ(x)) 2.2
    holds for all (x,y)(x¯,y¯)+Bε,δ(u,v) with dist(y,Φ(x))δx-x¯γ. In the case where this is fulfilled for (u,v):=(0,0), we say that Φ is metrically pseudo-regular of order γ at (x¯,y¯).
  2. We say that Φ is metrically pseudo-subregular of order γ in direction u at (x¯,y¯) if there are constants ε>0, δ>0, and κ>0 such that (2.2) holds for y:=y¯ and all xx¯+Bε,δ(u). In the case where this is fulfilled for u:=0, we say that Φ is metrically pseudo-subregular of order γ at (x¯,y¯).

Metric pseudo-regularity of order γ1 in direction (u, 0) at (x¯,y¯) 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 γ1 implies metric pseudo-subregularity of arbitrary order larger than γ in the same direction. For γ:=1, the above definition of (directional) metric pseudo-subregularity recovers the one of (directional) metric subregularity, see [36, Definition 1.2]. On the contrary, for γ:=1, 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 (x,y)(x¯,y¯)+Bε,δ(u,v) such that (u,v)dist((x,y),gphΦ)δ(u,v)(x,y)-(x¯,y¯), see [36, Definition 1.1]. Particularly, for (u,v):=(0,0), 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 γ1, the mapping Φ:RR, given by Φ(x):={|x|γ}, xR, is metrically pseudo-regular of order γ at (0, 0). The case γ:=1 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 y<0 approaching 0 come along with Φ-1(y)=, blowing up the left-hand side of (2.2). These problematic elements y are, however, ruled out by the condition dist(y,Φ(x))δx-x¯γ in the definition of metric pseudo-regularity, which reads |y-|x||δ|x| in the present situation.

Another important case, which we will explore in detail, corresponds to γ:=2. 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 g:XY is called calm in direction uX at xX whenever there are constants ε>0, δ>0, and L>0 such that

xx+Bε,δ(u):g(x)-g(x)Lx-x.

If this holds for u:=0, 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 φ:XR{} and some point x¯domφ:={xX|φ(x)<}. The lower semicontinuous function dφ(x¯):XR{-,} given by

uX:dφ(x¯)(u):=lim inft0,uuφ(x¯+tu)-φ(x¯)t

is referred to as the subderivative of φ at x¯. The regular (or Fréchet) and limiting (or Mordukhovich) subdifferential of φ at x¯ are given by

^φ(x¯):={ηX|(η,-1)N^epiφ(x¯,φ(x¯))},φ(x¯):={ηX|(η,-1)Nepiφ(x¯,φ(x¯))},

respectively, where epiφ:={(x,α)X×R|φ(x)α} is the epigraph of φ. In the case where φ is continuously differentiable at x¯, both sets reduce to the singleton containing only the gradient φ(x¯)1. We note that for any sequences {xk}kNdomφ and {xk}kNX such that xkx¯, φ(xk)φ(x¯), xkx for some xX, and xkφ(xk) for each kN, we also have xφ(x¯), see [71, Proposition 8.7]. This property is referred to as robustness of the limiting subdifferential.

In the case where φ is locally Lipschitzian around x¯, and for some direction uX,

φ(x¯;u):=ηX{uk}kNX,{tk}kNR+,{ηk}kNX:uku,tk0,ηkη,ηk^φ(x¯+tkuk)kN

is referred to as the limiting subdifferential of φ at x¯ in direction u. We note that φ(x¯;0)=φ(x¯) and φ(x¯;u)φ(x¯) for all uX. Furthermore, let us mention that, in the definition of the directional limiting subdifferential, we can equivalently replace the requirement ηk^φ(x¯+tkuk) by ηkφ(x¯+tkuk) for each kN. 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 Φ:XY be a set-valued mapping possessing a closed graph locally around (x¯,y¯)gphΦ.

  1. The graphical derivative of Φ at (x¯,y¯) is the mapping DΦ(x¯,y¯):XY given by
    gphDΦ(x¯,y¯)=TgphΦ(x¯,y¯).
    In the case where Φ is single-valued at x¯, we use DΦ(x¯):XY for brevity.
  2. Given γ1, the graphical pseudo-derivative of order γ of Φ at (x¯,y¯) is the mapping DγΦ(x¯,y¯):XY which assigns to uX the set of all vY such that there are sequences {uk}kNX, {vk}kNY, and {tk}kNR+ which satisfy uku, vkv, tk0, and (x¯+tkuk,y¯+(tkuk)γvk)gphΦ for all kN.

  3. The graphical subderivative of Φ at (x¯,y¯) is the mapping DsubΦ(x¯,y¯):SXSY which assigns to uSX the set of all vSY such that there are sequences {uk}kNX, {vk}kNY, and {tk}kN,{τk}kNR+ which satisfy uku, vkv, tk0, τk0, τk/tk, and (x¯+tkuk,y¯+τkvk)gphΦ for all kN.

Let us note that for every set-valued mapping Φ:XY, whose graph is closed locally around (x¯,y¯)gphΦ, we have D1Φ(x¯,y¯)(u)=DΦ(x¯,y¯)(u) for all uSX. Furthermore, for each γ>1, one obtains the trivial estimates

domDγΦ(x¯,y¯)kerDΦ(x¯,y¯)

and

uSX:DsubΦ(x¯,y¯)(u)DΦ(x¯,y¯)(0) 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 DY be a nonempty, closed, convex set such that the (single-valued) projection operator onto D, denoted by ΠD:YY, is directionally differentiable. Fix y¯D and y¯ND(y¯). Then, for arbitrary uY, we find

DND(y¯,y¯)(u){vY|ΠD(y¯+y¯;u+v)=u},

and for uSY, we find

DsubND(y¯,y¯)(u){vSY|ΠD(y¯+y¯;v)=0,u,v0}.

Above, ΠD(y,v) denotes the directional derivative of ΠD at yY in direction vY.

Proof

By convexity of D, we have the well-known equivalence

y,yY:yND(y)ΠD(y+y)=y.

In the remainder of the proof, we set y~:=y¯+y¯ for brevity. Next, let us fix u,vY as well as {uk}kN,{vk}kNY and {τk}kN,{εk}kNR+ such that uku, vkv, τk0, and y¯+τkvkND(y¯+τkεkuk), i.e., ΠD(y~+τkεkuk+τkvk)=y¯+τkεkuk, for each kN. Using ΠD(y~)=y¯, we find

kN:εkuk=ΠD(y~+τkεkuk+τkvk)-ΠD(y~)τk. 2.4

In the case where vDND(y¯,y¯)(u) holds, we can choose εk=1 for each kN, and taking the limit k in (2.4) while exploiting directional differentiability and Lipschitzness of ΠD yields ΠD(y~;u+v)=u. This shows the first estimate.

Now, assume that vDsubND(y¯,y¯)(u) is valid. Then εk0 and u,vSY can be postulated, and taking the limit k in (2.4) shows ΠD(y~;v)=0. By nature of the projection, we have

y~+τkεkuk+τkvk-ΠD(y~+τkεkuk+τkvk),ΠD(y~)-ΠD(y~+τkεkuk+τkvk)0

for each kN. Exploiting (2.4), this is equivalent to

y~+τkvk-ΠD(y~),ΠD(y~)-ΠD(y~+τkεkuk+τkvk)0

for each kN. Some rearrangements and the characterization of the projection lead to

τkvk,ΠD(y~)-ΠD(y~+τkεkuk+τkvk)y~-ΠD(y~),ΠD(y~+τkεkuk+τkvk)-ΠD(y~)0.

Division by τk2εk and (2.4), thus, give us vk,uk0 for each kN, and taking the limit, we obtain u,v0 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 ND 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 DY be nonempty and closed, and fix y¯D. Then the following assertions hold.

  1. For each uY, we have DND(y¯,0)(u)ND(y¯;u).

  2. For each uSY, we have DsubND(y¯,0)(u)ND(y¯;u).

Proof

We only prove validity of the first assertion. The second one can be shown in analogous fashion.

Fix uY and vDND(y¯,0)(u). Then we find sequences {uk}kN,{vk}kNY and {tk}kNR+ with uku, vkv, tk0, and tkvkND(y¯+tkuk) for each kN. Since, for each kN, ND(y¯+tkuk) is a cone, we find vkND(y¯+tkuk), and vND(y¯;u) follows by robustness of the directional limiting normal cone, see Lemma 2.1.

In the next two results, we investigate the special situation Y:=Rm 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 DRm be a polyhedral set. Then gphND is polyhedral as well, and for arbitrary (y¯,y¯)gphND and u,vRm\{0}, we have

vDND(y¯,y¯)(u)v/vDsubND(y¯,y¯)(u/u).
Proof

It follows from [1, Theorem 2] that there exist finitely many convex polyhedral sets D1,,DRm and closed, convex, polyhedral cones K1,,KRm such that gphND=i=1Di×Ki. Particularly, gphND is polyhedral.

Next, consider some nonzero u,vRm with v/vDsubND(y¯,y¯)(u/u). Then we find {u~k}kN,{v~k}kNRm and {t~k}kN,{τk}kNR+ such that uk:=u~kuu, vk:=v~kvv, tk:=t~k/u0, τk0, τk/tk, as well as (y¯+tkuk,y¯+(τk/v)vk)gphND for all kN. Thus, we can pick j{1,,} and a subsequence (without relabeling) such that (y¯+tkuk,y¯+(τk/v)vk)Dj×Kj and τk/v>tk for all kN. By convexity of Kj, we also have (y¯+tkuk,y¯+tkvk)Dj×Kj which shows vDND(y¯,y¯)(u). 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 N. For each i{1,,}, let DiRmi for some miN be polyhedral. Set D:=i=1Di, m:=i=1mi, and L:={1,,}. Then we have

gphND={((y1,,y),(y1,,y))Rm×Rm|iL:(yi,yi)gphNDi},

and for arbitrary y¯:=(y¯1,,y¯),y¯:=(y¯1,,y¯)Rm satisfying (y¯,y¯)gphND as well as u:=(u1,,u)Rm, we find

DND(y¯,y¯)(u)={v=(v1,,v)Rm|iL:viDNDi(y¯i,y¯i)(ui)}.
Proof

The representation of gphND 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, gphND is, up to a permutation of components, the same as i=1gphNDi. Since, for each iL, gphNDi is polyhedral by Lemma 2.6, the same has to hold for gphND. 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 Φ:XY be a set-valued mapping possessing a closed graph locally around (x¯,y¯)gphΦ. Furthermore, let (u,v)X×Y be a pair of directions.

  1. The regular and limiting coderivative of Φ at (x¯,y¯) are the set-valued mappings D^Φ(x¯,y¯):YX and DΦ(x¯,y¯):YX given, respectively, by
    yY:D^Φ(x¯,y¯)(y):={xX|(x,-y)N^gphΦ(x¯,y¯)},DΦ(x¯,y¯)(y):={xX|(x,-y)NgphΦ(x¯,y¯)}.
    The set-valued mapping DΦ((x¯,y¯);(u,v)):YX given by
    yY:DΦ((x¯,y¯);(u,v))(y):={xX|(x,-y)NgphΦ((x¯,y¯);(u,v))}
    is the limiting coderivative of Φ at (x¯,y¯) in direction (uv). If Φ is single-valued at x¯, we use D^Φ(x¯),DΦ(x¯),DΦ(x¯;(u,v)):YX for brevity.
  2. Given γ1 and uSX, the pseudo-coderivative of order γ of Φ at (x¯,y¯) in direction (u, v) is the mapping DγΦ((x¯,y¯);(u,v)):YX which assigns to yY the set of all xX such that there are sequences {uk}kN,{xk}kNX, {vk}kN,{yk}kNY, and {tk}kNR+ which satisfy uku, vkv, tk0, xkx, yky, and
    kN:xk,-yk(tkuk)γ-1N^gphΦ(x¯+tkuk,y¯+(tkuk)γvk). 2.5
    In the case γ:=1, this definition recovers the one of DΦ((x¯,y¯);(u,v)).
  3. Given γ1 and uSX, Gfrerer’s pseudo-coderivative of order γ of Φ at (x¯,y¯) in direction (u, v) is the mapping D~γΦ((x¯,y¯);(u,v)):YX which assigns to yY the set of all xX such that there are sequences {uk}kN,{xk}kNX, {vk}kN,{yk}kNY, and {tk}kNR+ which satisfy uku, vkv, tk0, xkx, yky, and
    kN:xk,-yk(tkuk)γ-1N^gphΦ(x¯+tkuk,y¯+tkvk). 2.6
    Again, for γ:=1, we recover the definition of DΦ((x¯,y¯);(u,v)).

Let Φ:XY be a set-valued mapping whose graph is closed locally around (x¯,y¯)gphΦ and fix a pair of directions (u,v)SX×Y, (x,y)X×Y, and γ>1. Then we obtain the trivial relations

xDγΦ((x¯,y¯);(u,v))(y)0DΦ(x¯,y¯)(u),0DΦ(x¯,y¯)(y),0DΦ((x¯,y¯);(u,0))(y),vDγΦ(x¯,y¯)(u),xD~γΦ((x¯,y¯);(u,0))(y). 2.7

Note also that the mappings DΦ((x¯,y¯);(u,v)) and D~γΦ((x¯,y¯);(u,v)) have a nonempty graph if and only if vDΦ(x¯,y¯)(u) while the mapping DγΦ((x¯,y¯);(u,v)) has a nonempty graph if and only if vDγΦ(x¯,y¯)(u).

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 γ>1, we consider the mapping Φ:RR, given by Φ(x):={|x|γ}, xR, already discussed in Example 2.1. Set (x¯,y¯):=(0,0) as well as u:=±1 and choose vR arbitrarily. First, vDΦ(x¯,y¯)(u) by definition requires sequences {tk}kNR+ and {uk}kN,{vk}kNR satisfying tk0, uku, vkv, and tkvk=(tk|uk|)γ for all kN, showing v=0. Thus, we fix v:=0 to find DΦ((x¯,y¯);(u,0))(y)={0} for all yR as the defining sequences {xk}kN,{yk}kNR satisfy xkx, yky, and xk=γ(tk|uk|)γ-1sgn(uk)yk for all kN. Furthermore, D~γΦ((x¯,y¯);(u,0))(y)={γsgn(u)y} holds for each yR as the defining sequences {xk}kN,{yk}kNR satisfy xkx, yky, and xk=γsgn(uk)yk for all kN. Using similar arguments as above, one can check that vDγΦ(x¯,y¯)(u) yields v=1, and for v:=1, we get DγΦ((x¯,y¯);(u,1))(y)={γsgn(u)y} for all yR.

Below, we introduce yet another concept of coderivative which will become important in Sect. 5.3.

Definition 2.4

Let Φ:XY be a set-valued mapping with a closed graph and fix (x¯,y¯)gphΦ and (u,v)SX×SY. The super-coderivative of Φ at (x¯,y¯) in direction (uv) is the mapping DsupΦ((x¯,y¯);(u,v)):YX, which assigns to yY the set of all xX such that there are sequences {uk}kN,{xk}kNX, {vk}kN,{yk}kNY, and {tk}kN,{τk}kNR+ which satisfy uku, vkv, xkx, yky, tk0, τk0, and τk/tk0 such that

xkD^Φ(x¯+tkuk,y¯+τkvk)(((tkuk)/(τkvk))yk) 2.8

holds for all kN.

We start with some remarks regarding Definition 2.4. First, observe that we only exploit the super-coderivative w.r.t. unit directions (u,v)SX×SY which also means that {uk}kNX and {vk}kNY can be chosen such that uk0 and vk0 hold for all kN. Particularly, condition (2.8) is reasonable.

Second, we would like to note that xDsupΦ((x¯,y¯);(u,v))(y) implies the existence of {uk}kNX, {vk}kNY, and {tk}kN,{τk}kNR+ which satisfy uku, vkv, tk0, τk0, and τk/tk0 as well as (x¯+tkuk,y¯+τkvk)gphΦ for all kN. Thus, in the light of Definition 2.2 (c) of the graphical subderivative, one might be tempted to say that the pair (uv) belongs to the graph of the graphical super-derivative of Φ at (x¯,y¯). 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 γ>1 and xDγΦ((x¯,y¯);(u,v))(y) for (u,v)SX×SY and yY. Setting τk:=(tkuk)γ for each kN, where {tk}kNR+ and {uk}kNX are the sequences from the definition of the pseudo-coderivative, we get xDsupΦ((x¯,y¯);(u,v))(y) since tkγ-1ukγ0.

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 (x¯,y¯)gphΦ, (u,v)SX×SY, yY, and γ>1 be fixed. Furthermore, assume that kerDγΦ((x¯,y¯);(u,0)){0} holds. Then there exists α>0 such that

DsupΦ((x¯,y¯);(u,v))(y)D~γΦ((x¯,y¯);(u,0))(0)DγΦ((x¯,y¯);(u,αv))(y/α)ImDγΦ((x¯,y¯);(u,0))ImD~γΦ((x¯,y¯);(u,0)).
Proof

Let xDsupΦ((x¯,y¯);(u,v))(y) be arbitrarily chosen. Then we find sequences {uk}kN,{xk}kNX, {vk}kN,{yk}kNY, and {tk}kN,{τk}kNR+ which satisfy uku, vkv, xkx, yky, tk0, τk0, and τk/tk0 as well as (2.8) for all kN. This also gives us

xkD^Φx¯+tkuk,y¯+(tkuk)γτkvk(tkuk)γ(tkuk)1-γ(tkuk)γτkvkyk 2.9

for all kN. Set y~k:=(tkuk)γ/(τkvk)yk for each kN. In the case where {y~k}kN is not bounded, we have (τkvk)/(tkuk)γ0 along a subsequence (without relabeling), and taking the limit in

xk/y~kD^Φx¯+tkuk,y¯+(tkuk)γτkvk(tkuk)γ(tkuk)1-γy~k/y~k

yields that kerDγΦ((x¯,y¯);(u,0)) contains a nonzero element, which is a contradiction. Hence, {y~k}kN is bounded.

For each kN, we set αk:=τkvk/(tkuk)γ. First, suppose that {αk}kN is not bounded. Then, along a subsequence (without relabeling), we may assume αk. By boundedness of {yk}kN, y~k0 follows. Rewriting (2.9) yields

xkD^Φx¯+tkuk,y¯+tkτkvktk(tkuk)1-γy~k

for each kN, and taking the limit k while respecting τk/tk0, thus, gives xD~γΦ((x¯,y¯);(u,0))(0). In the case where {αk}kN converges to some α>0 (along a subsequence without relabeling), we can simply take the limit k in (2.9) in order to find xDγΦ((x¯,y¯);(u,αv))(y/α). Finally, let us consider the case αk0 (along a subsequence without relabeling). Then, by boundedness of {y~k}kN, taking the limit k in (2.9) gives xImDγΦ((x¯,y¯);(u,0)). 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 Φ:XY, metric regularity and strong metric subregularity at some point (x¯,y¯)gphΦ are characterized, respectively, by

kerDΦ(x¯,y¯)={0}, 2.10a
kerDΦ(x¯,y¯)={0}, 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 uSX, we will refer to

kerDΦ((x¯,y¯);(u,0)){0}, 2.11

which implies that Φ is metrically subregular at (x¯,y¯) 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 ukerDΦ(x¯,y¯). Indeed, in this case, Φ is trivially metrically subregular at (x¯,y¯) in direction u. Furthermore, whenever (2.11) holds for all ukerDΦ(x¯,y¯)SX, which we will refer to as FOSCMS, then Φ is already metrically subregular at (x¯,y¯), 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 {tk}kN appears in the domain as well as in the range space, if vDΦ(x¯,y¯)(u) implies that uX and vY are both nonzero, it suggests a proportional (linear) rate of change. Thus, in order to characterize pseudo-(sub)regularity of order γ>1 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 γ>1 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 Φ:XY be a set-valued mapping having a closed graph locally around (x¯,y¯)gphΦ, fix a direction uSX, and some γ1. Assume that

kerDγΦ((x¯,y¯);(u,0)){0} 2.12

holds. Then Φ is metrically pseudo-subregular of order γ at (x¯,y¯) in direction u.

Proof

Suppose that Φ is not metrically pseudo-subregular of order γ at (x¯,y¯) in direction u. Due to [37, Theorem 1(2)], we find sequences {tk}kNR+, {uk}kN,{xk}kNX, and {vk}kN,{yk}kNY satisfying (among other things) tk0, uku, tk1-γvk0, as well as xk0, such that ||yk||=1 and

(xk,-yk/(tkuk)γ-1)N^gphΦ((x¯,y¯)+tk(uk,vk))

for each kN. Let us set v~k:=tk1-γuk-γvk for each kN. Then we have

(xk,-yk/(tkuk)γ-1)N^gphΦ(x¯+tkuk,y¯+(tkuk)γv~k)

for each kN and v~k0 from tk1-γvk0. Observing that {yk}kN possesses a nonvanishing accumulation point yY, taking the limit along a suitable subsequence yields 0DγΦ((x¯,y¯);(u,0))(y) which contradicts the assumptions of the lemma.

Let us remark that due to (2.7), condition

kerD~γΦ((x¯,y¯);(u,0)){0} 2.13

is stronger than (2.12) and, thus, also sufficient for metric pseudo-subregularity of Φ of order γ1 at (x¯,y¯) in direction u. By means of [37, Corollary 2], (2.13) is actually equivalent to Φ being metrically pseudo-regular at (x¯,y¯) in direction (u, 0). Note that in the case γ:=1, 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 γ>1, we consider the mapping Φ:RR given by

gphΦ:={(x,y)||x|γy2|x|γ}kNR×{1/2k}.

Essentially, gphΦ is a closed staircase enclosed by the graphs of the functions x|x|γ and x2|x|γ. Set (x¯,y¯):=(0,0) and u:=1. First, it is easy to see that (2.12) is satisfied, because one can show kerDγΦ((x¯,y¯);(u,0))=. Indeed, the sequences {tk}kNR+ and {uk}kN,{vk}kNR from the definition of the pseudo-coderivative satisfy, among others, tk0, uku, vkv, and (tk|uk|)γ(tk|uk|)γvk2(tk|uk|)γ for each kN. Thus, DγΦ((x¯,y¯);(u,v)) can have a nonempty graph only for v[1,2]. Next, let us argue that (2.13) fails due to 1kerD~γΦ((x¯,y¯);(u,0)). We consider the sequences {tk}kNR+ and {uk}kN,{vk}kNR given by

kN:tk:=32k+21/γ,uk:=1,vk:=12k32k+2-1/γ.

We obviously have tk0, uk1, as well as vk0, and one can easily check that (tkuk,tkvk)gphΦ holds for all kN. By construction, there exist vertical normals to gphΦ at (tkuk,tkvk) for each kN, so we can choose xk:=0 and yk:=1 satisfying (2.6). Taking the limit k shows 1kerD~γΦ((x¯,y¯);(u,0)).

Remark 2.1

Let Φ:XY be a set-valued mapping having locally closed graph around (x¯,y¯)gphΦ, and fix some γ1. Note that if we replace the set Φ-1(y¯) by just the singleton {x¯} in Definition 2.1 of metric pseudo-subregularity, the estimate (2.2) simplifies to

x-x¯γκdist(y¯,Φ(x)).

Asking this to hold for all xBε(x¯) and some ε>0 seems like a natural way to define strong metric pseudo-subregularity of order γ of Φ at (x¯,y¯). It is an easy exercise to verify that this condition is satisfied if and only if kerDγΦ(x¯,y¯)={0}. 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

kerDγ+εΦ((x¯,y¯);(u,0))kerDγΦ((x¯,y¯);(u,0)),kerD~γ+εΦ((x¯,y¯);(u,0))kerD~γΦ((x¯,y¯);(u,0))

for each γ1 and ε>0. 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 Φ:XY which are given by Φ(x):=g(x)-D for all xX, where g:XY is a single-valued continuous function and DY 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 g(x)D.

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 (x,y)gphΦ. Then the following statements hold.

  1. For each yY, we have
    D^Φ(x,y)(y)D^g(x)(y)yN^D(g(x)-y),otherwise,
    and the opposite inclusion holds if g is calm at x.
  2. For each yY, we have
    DΦ(x,y)(y)Dg(x)(y)yND(g(x)-y),otherwise,
    and the opposite inclusion holds whenever g is continuously differentiable at x.
  3. For each pair of directions (u,v)X×Y and each yY, we have
    DΦ((x,y);(u,v))(y)wDg(x)(u)Dg(x;(u,w))(y)yND(g(x)-y;w-v),otherwise
    provided g is calm at x, and the opposite inclusion holds whenever g is continuously differentiable at x.

Proof

  1. For the proof, we observe that gphΦ=gphg+({0}×(-D)) is valid. Now, we exploit the sum rule from [20]. Therefore, let us introduce the surrogate mapping M:X×Y(X×Y)×(X×Y) given by
    M(x,y):=((x1,y1),(x2,y2))gphg×({0}×(-D))x=x1+x2y=y1+y2={((x,g(x)),(0,y-g(x)))}g(x)-yD,otherwise 3.1
    for all (x,y)X×Y, and observe that gphΦ=domM holds while M is single-valued and continuous on gphΦ. Now, we find
    N^gphΦ(x,y)D^M((x,y),((x,g(x)),(0,y-g(x))))((0,0),(0,0))
    for all (x,y)gphΦ 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 gphM via [20, Lemmas 2.1, 2.2] and applying the definition of the regular coderivative yields the claim.
  2. 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 (x,y)gphΦ 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].

  3. 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 gphΦ=gphg+({0}×(-D)). 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 wDg(x)(0)SY.

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 (x¯,0)gphΦ and a direction uSX, let

xD~2Φ((x¯,0);(u,v))(y)

for some v,yY. Then there exists zY such that

x=2y,g(x¯)(u)+g(x¯)z, 3.2a
yND(g(x¯);g(x¯)u-v)kerg(x¯). 3.2b

Further specifications of z satisfying (3.2) are available under additional assumptions.

  1. Each of the following two conditions
    DND(g(x¯),y)(0)kerg(x¯)={0}, 3.3a
    g(x¯)uv,DsubND(g(x¯),y)g(x¯)u-vg(x¯)u-vkerg(x¯)= 3.3b
    implies that we can find zDND(g(x¯),y)(g(x¯)u-v) satisfying (3.2).
  2. If Y:=Rm and D is locally polyhedral around g(x¯), then ND(g(x¯);g(x¯)u-v)=NTD(g(x¯))(g(x¯)u-v), and there are two elements z1,z2Rm satisfying (3.2) (for z:=zi with i=1,2, respectively) with z1NTD(g(x¯))(g(x¯)u-v) and z2TNTD(g(x¯))(g(x¯)u-v)(y).

Proof

Since xD~2Φ((x¯,0);(u,v))(y), we find sequences {tk}kNR+, {uk}kN,{xk}kNX, and {vk}kN,{yk}kNY with tk0, uku, vkv, xkx, yky, as well as

(xk,-yk/τk)N^gphΦ(x¯+tkuk,tkvk)

for all kN where we used τk:=tkuk for brevity of notation. Lemma 3.1 yields xk=g(x¯+tkuk)yk/τk and ykτkN^D(g(x¯+tkuk)-tkvk) for each kN. Taking the limit in τkxk=g(x¯+tkuk)yk, we find ykerg(x¯). Combining this with a Taylor expansion and denoting w~k:=g(x¯+tkuk)-tkvk gives us

graphic file with name 10107_2024_2089_Equ20_HTML.gif 3.4a
graphic file with name 10107_2024_2089_Equ21_HTML.gif 3.4b

for each kN. We readily obtain yND(g(x¯);g(x¯)u-v), i.e., (3.2b), as well as

x-2y,g(x¯)(u)Img(x¯),

i.e., (3.2a), due to the closedness of Img(x¯).

In the general case (a), we will us the identity (3.4a) only with the right-hand side g(x¯)(yk-y)/τk, but in the polyhedral case (b), it is also reasonable to take a closer look at the expression g(x¯)yk/τk.

Let us now prove (a). Using the notation from above, let us first assume that {zk}kN, given by zk:=(yk-y)/τk for each kN, remains bounded. Then we may pass to a subsequence (without relabeling) so that it converges to some zY. We get

graphic file with name 10107_2024_2089_Equ242_HTML.gif

and zDND(g(x¯),y)(g(x¯)u-v) follows. Clearly, taking the limit in (3.4a) yields (3.2a) as well.

On the other hand, if {zk}kN does not remain bounded, we pass to a subsequence (without relabeling) such that τk/yk-y0 and z^kz^ for some z^SY where we used z^k:=(yk-y)/yk-y for each kN. Multiplying (3.4a) by τk/yk-y and taking the limit yields g(x¯)z^=0. Taking into account (w~k-g(x¯))/τkg(x¯)u-v, we get

w~k-g(x¯)yk-y=w~k-g(x¯)τkτkyk-y0. 3.5

Let us assume that g(x¯)uv. Then, for sufficiently large kN, we have w~kg(x¯), so we can set q^k:=(w~k-g(x¯))/w~k-g(x¯) for any such kN and find q^SY such that q^kq^ (along a subsequence without relabeling). Moreover, we have

y+yk-yz^k=ykN^Dg(x¯)+w~k-g(x¯)q^k

from (3.4b), so that (3.5) yields z^DsubND(g(x¯),y)(q^). This contradicts (3.3b). In the case where g(x¯)u=v holds, (3.3b) is not applicable. However, we still have

y+yk-yz^k=ykN^Dg(x¯)+yk-yw~k-g(x¯)yk-y,

so that taking the limit k while respecting (3.5) yields z^DND(g(x¯),y)(0) 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 ykNTD(g(x¯))g(x¯)u-v for all sufficiently large kN. Lemma 2.2 (a) yields the existence of a neighborhood VRm of 0 such that

TD(g(x¯))V=(D-g(x¯))V, 3.6

as well as the fact that TD(g(x¯)) is polyhedral. Thus, from (3.4b) we conclude

graphic file with name 10107_2024_2089_Equ243_HTML.gif

for all sufficiently large kN.

Next, let us set K:=NTD(g(x¯))(g(x¯)u-v) for brevity of notation, and note that K is a polyhedral cone. From above we know that ykK holds for all sufficiently large kN. Then we also get y,yk/τkK and, by Lemma 2.2 (a), (yk-y)/τkTK(y), where TK(y) 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 {z1,k}kNK and {z2,k}kNTK(y) satisfying

graphic file with name 10107_2024_2089_Equ244_HTML.gif

for i=1,2. Thus, accumulation points ziRm of {zi,k}kN for i=1,2 satisfy (3.2a) and z1K and z2TK(y).

Below, we comment on the findings of Theorem 3.1. To start, we illustrate that the additional information on the multiplier z provided in statements (a) and (b) is the same whenever D is a convex polyhedral set in Y:=Rm.

Remark 3.1

We use the notation from Theorem 3.1. Suppose that D is a convex polyhedral set in Y:=Rm. First, we claim that

NTD(g(x¯))(g(x¯)u-v)NTD(g(x¯))(g(x¯)u-v)+span(y)=TNTD(g(x¯))(g(x¯)u-v)(y)=DND(g(x¯),y)(g(x¯)u-v).

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 (z¯,z¯)gphND, we get

(gphND-(z¯,z¯))O={(w,w)|wKD(z¯,z¯),wKD(z¯,z¯),w,w=0}O,

where ORm×Rm is a neighborhood of (0, 0) and KD(z¯,z¯):=TD(z¯)[z¯] represents the critical cone to D at (z¯,z¯). By Lemma 2.2 (a), this simply means

TgphND(z¯,z¯)={(w,w)|wKD(z¯,z¯),wKD(z¯,z¯),w,w=0}.

Thus, zDND(g(x¯),y)(g(x¯)u-v) means g(x¯)u-vTD(g(x¯))[y], which gives us

yND(g(x¯))[g(x¯)u-v]=NTD(g(x¯))(g(x¯)u-v),

and

zNKD(g(x¯),y)(g(x¯)u-v)=(TD(g(x¯))[y])[g(x¯)u-v]=(ND(g(x¯))+span(y))[g(x¯)u-v]=ND(g(x¯))[g(x¯)u-v]+span(y)=NTD(g(x¯))(g(x¯)u-v)+span(y)=TNTD(g(x¯))(g(x¯)u-v)(y)

by the basic properties of convex polyhedral cones and Lemma 2.2 (b).

Hence, in the convex polyhedral case, the information on y and z from statements (a) and (b) (case z2) of Theorem 3.1 is the same, while the information from statement (b) (case z1) 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 yND(g(x¯))[v]kerg(x¯) due to Lemma 2.2 (b) and [g(x¯)s-v]kerg(x¯)=[v]kerg(x¯) for all sX. This also means that, for any such y, the sets

A1(y,v):={sX|g(x¯)s-vTD(g(x¯))},A2(y,v):={sX|g(x¯)s-vKD(g(x¯),y)}

coincide, and viewing x, y, u, and v as parameters, the linear programs graphic file with name 10107_2024_2089_Figa_HTML.jpg are the same for i=1,2. On the other hand, (3.2a) with zNTD(g(x¯))(g(x¯)u-v) and zNKD(g(x¯),y)(g(x¯)u-v), respectively, precisely characterizes the fact that u is a minimizer of LP(1) and LP(2). Hence, this information on z is the same.

Some additional comments on Theorem 3.1 are stated subsequently.

Remark 3.2

We use the notation from Theorem 3.1.

  1. Note that, in the case g(x¯)uv, 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 g(x¯)u-v. Let us also note that the case g(x¯)u=v is, anyhow, special since this would annihilate the directional information in (3.2b) completely.

  2. If Y:=Rm and D is locally polyhedral around g(x¯), conditions (3.3) reduce to
    DND(g(x¯),y)(g(x¯)u-v)kerg(x¯){0}
    thanks to Lemma 2.6.

In the polyhedral case, we can derive yet sharper information on z 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 (x¯,0)gphΦ, assume that Y:=Rm and D is locally polyhedral around g(x¯). For a direction uSX, let

xD2Φ((x¯,0);(u,v))(y)

for some v,yRm. Then there exists sX satisfying yNT(u)(ws(u,v))kerg(x¯) where

T(u):=TTD(g(x¯))(g(x¯)u),ws(u,v):=g(x¯)s+1/22g(x¯)[u,u]-v, 3.7

together with two elements z1NT(u)(ws(u,v)) and z2TNT(u)(ws(u,v))(y) satisfying x=2y,g(x¯)(u)+g(x¯)zi for i=1,2. Moreover, vD2Φ(x¯,0)(u) is equivalent to the existence of sX with ws(u,v)T(u).

Proof

Similar arguments as in the proof of Theorem 3.1 yield (3.4a) together with ykN^D(wk) for each kN where

graphic file with name 10107_2024_2089_Equ245_HTML.gif

As in the final part of the proof of Theorem 3.1, all we need to show is ykNT(u)(ws(u,v)) for all sufficiently large kN and some appropriately chosen sX.

Noting that D is polyhedral while T(u) is a polyhedral cone, we can apply Lemma 2.2 (a) to find neighborhoods V,WRm of 0 such that (3.6) and

T(u)W=TTD(g(x¯))(g(x¯)u)W=(TD(g(x¯))-g(x¯)u)W.

Consequently, we have wk-g(x¯)TD(g(x¯)) and, hence, also (wk-g(x¯))/tkTD(g(x¯)) for sufficiently large kN. Similarly, we conclude that zkT(u). Taking into account that for each cone K, qK, and α>0, one has TK(q)=TK(αq), we find

TD(wk)=Tg(x¯)+TD(g(x¯))(wk)=TTD(g(x¯))((wk-g(x¯))/tk)=TTD(g(x¯))g(x¯)u+tkzk=TTD(g(x¯))-g(x¯)uzk=TT(u)zk

for all sufficiently large kN, and we obtain ykN^D(wk)=N^T(u)(zk).

Since T(u) is polyhedral, so is gphNT(u), see Lemma 2.6, and it can be written as the union of finitely many convex polyhedral sets, say C1,,CRm×Rm. Thus, we have

(zk,yk)gphN^T(u)gphNT(u)=j=1Cj

for sufficiently large kN. We may pick an index j¯{1,,} such that (zk,yk)Cj¯ holds for infinitely many kN and suppose that Cj¯ can be represented as Cj¯={(z,y)|Az+Byc} for some matrices A, B, as well as c of appropriate dimensions. Hence, by passing to a subsequence (without relabeling), we get

graphic file with name 10107_2024_2089_Equ246_HTML.gif

For each kN, a generalized version of Hoffman’s lemma, see [47, Theorem 3], now yields the existence of skX with

graphic file with name 10107_2024_2089_Equ247_HTML.gif

for some constant β>0 not depending on k. Thus, {sk}kN is bounded and satisfies

graphic file with name 10107_2024_2089_Equ248_HTML.gif

We may assume that {sk}kN converges to some sX. Exploiting (3.7), we infer

graphic file with name 10107_2024_2089_Equ249_HTML.gif

for all sufficiently large kN from polyhedrality of T(u) and the definition of the limiting normal cone.

To show the second statement, note that vD2Φ(x¯,0)(u) is equivalent to 0D2Φ((x¯,0);(u,v))(0), so that any of these two conditions readily yields the existence of sX with ws(u,v)T(u). Conversely, suppose that there exists sX with ws(u,v)T(u). Let {tk}kNR+ be an arbitrary sequence with tk0, and define the sequences {uk}kNX and {vk}kN,{w^k}kNY by uk:=u+tks and

vk:=(g(x¯+tkuk)-w^k)/(tkuk)2,w^k:=g(x¯)+tkg(x¯)u+tk2ws(u,v)

for all kN. First, a second-order Taylor expansion together with uk1 yields vkv. Next, using similar arguments as before, polyhedrality of TD(g(x¯)) and, locally around g(x¯), D, together with ws(u,v)T(u), yields g(x¯+tkuk)-(tkuk)2vk=w^kD, i.e., (x¯+tkuk,(tkuk)2vk)gphΦ, for sufficiently large kN. Taking the limit k gives vD2Φ(x¯,0)(u), and this completes the proof.

Remark 3.3

Let us mention that if Y:=Rm and D is locally polyhedral around g(x¯), we get the relations

NT(u)(ws(u,v))=NTD(g(x¯))(g(x¯)u;ws(u,v))NTD(g(x¯))(g(x¯)u)[ws(u,v)]NTD(g(x¯))(g(x¯)u)=ND(g(x¯);g(x¯)u)=NT(u)(0)

from Lemma 2.2 (b). This also yields TNT(u)(ws(u,v))(y)TNTD(g(x¯))(g(x¯)u)(y).

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

A~1(y,u,v):=s~X|ws~(u,v)T(u),A~2(y,u,v):=s~X|ws~(u,v)KTD(g(x¯))(g(x¯)u,y) 3.8

which coincide because the required existence of sX with yNT(u)(ws(u,v))kerg(x¯)=(T(u))[ws(u,v)]kerg(x¯) obviously yields the inclusion y[1/22g(x¯)[u,u]-v] and, thus, y,ws~(u,v)=0 for all s~X. This means that our conditions from Theorem 3.2 precisely state that the associated linear programs (LP(i)), i=1,2, with Ai(y,v) replaced by A~i(y,u,v), 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 (x¯,0)gphΦ and a direction uSX. The characterization (2.13) of metric pseudo-regularity of order 2 of Φ in direction (u, 0) at (x¯,0) 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 (x¯,0) is valid also under (d).

  1. One has
    g(x¯)y=0,2y,g(x¯)(u)+g(x¯)z=0,yND(g(x¯);g(x¯)u)y=0.
  2. One has
    g(x¯)y=0,2y,g(x¯)(u)+g(x¯)z=0,yND(g(x¯);g(x¯)u),zDND(g(x¯),y)(g(x¯)u)y=0. 3.9
    Furthermore, we either have
    g(x¯)y=0,g(x¯)z^=0,yND(g(x¯);g(x¯)u),z^DND(g(x¯),y)(0)z^=0 3.10
    or g(x¯)u0 and
    g(x¯)y=0,g(x¯)z^=0,yND(g(x¯);g(x¯)u)z^DsubND(g(x¯),y)g(x¯)ug(x¯)u. 3.11
  3. It holds Y:=Rm, D is locally polyhedral around g(x¯), and
    g(x¯)y=0,2y,g(x¯)(u)+g(x¯)z=0,yNTD(g(x¯))(g(x¯)u),zNTD(g(x¯))(g(x¯)u)(orzTNTD(g(x¯))(g(x¯)u)(y))y=0. 3.12
  4. It holds Y:=Rm, D is locally polyhedral around g(x¯), and for each sX one has
    g(x¯)y=0,2y,g(x¯)(u)+g(x¯)z=0,yNT(u)(ws(u,0)),zNT(u)(ws(u,0))(orzTNT(u)(ws(u,0))(y))y=0 3.13
    where T(u) and ws(u,0) are given as in (3.7).

Due to Remark 3.3, (3.12) indeed implies validity of (3.13) for arbitrarily chosen sX.

Remark 3.4

Let us note that if Y:=Rm and D is locally polyhedral around g(x¯), then (3.10) and (3.11) appearing in Corollary 3.1 (b) reduce to

g(x¯)y=0,g(x¯)z^=0,yND(g(x¯);g(x¯)u),z^DND(g(x¯),y)(g(x¯)u)z^=0 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 Y:=Rm, 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 Y:=Rm, let D be convex and polyhedral, and fix (x¯,0)gphΦ as well as uX. Then the 2-regularity condition is said to hold at x¯ in direction u if the following is valid:

Img(x¯)+2g(x¯)[u,g(x¯)-1TD(g(x¯))]-TD(g(x¯))=Rm. 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 u:=0 reduces to Robinson’s constraint qualification, see [25, Proposition 2.97]. Observe that, since Img(x¯), g(x¯)-1TD(g(x¯)), and TD(g(x¯)) are cones, 2-regularity in a nonzero direction u is equivalent to 2-regularity in direction αu for arbitrary α>0. Hence, it is reasonable to consider merely directions from SX 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 graphic file with name 10107_2024_2089_Figb_HTML.jpg can be satisfied only for y=0. Note that (C(u,y)) can be stated in a z-free manner by means of

g(x¯)y=0,02y,g(x¯)(u)+g(x¯)ND(g(x¯)),yND(g(x¯))

which is why we did not include z in the abbreviation (C(u,y)).

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 (x¯,0)gphΦ in some direction uSX which satisfies g(x¯)uTD(g(x¯)) (for other directions, the concept is trivial) was shown to be present under the following condition:(C(u,y))

(C(u,y)),yargmaxy^ND(g(x¯))kerg(x¯)1/22y^,g(x¯)[u,u]y=0. 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 sX with ws(u,0)T(u), see (3.7) for the definition of ws(u,0) and T(u).

Lemma 3.2

Set Y:=Rm, let D be convex and polyhedral, and fix (x¯,0)gphΦ as well as uSX such that g(x¯)uTD(g(x¯)). The existence of sX with ws(u,0)T(u) is equivalent to the existence of s~X with ws~(u,0)TD(g(x¯)), and these conditions imply 2y,g(x¯)[u,u]0 for arbitrary yND(g(x¯))kerg(x¯). If, additionally, (C(u,y)) holds, then we even have 2y,g(x¯)[u,u]=0.

Proof

Let us start to prove the first assertion. Note that T(u)=TD(g(x¯))+span(g(x¯)u) holds due to polyhedrality of D yielding polyhedrality of TD(g(x¯)). Hence, if sX satisfies ws(u,0)T(u), then s~:=s+αu for some αR satisfies ws~(u,0)=ws(u,0)+αg(x¯)uTD(g(x¯)). The converse relation is trivial due to TD(g(x¯))T(u).

The second assertion is a consequence of the definition of ws(u,0).

To show the final assertion, note that (C(u,y)) gives

2y,g(x¯)[u,u]=-z,g(x¯)u0

as zND(g(x¯)) and g(x¯)uTD(g(x¯)).

Now, we are in position to state the central result of this subsection.

Proposition 3.1

Set Y:=Rm, let D be convex and polyhedral, and fix (x¯,0)gphΦ as well as uSX such that g(x¯)uTD(g(x¯)). Then the following statements hold.

  1. The 2-regularity condition (3.15) is equivalent to the implication
    (C(u,y))y=0. 3.17
  2. Condition (3.12) is equivalent to
    (C(u,y)),z,g(x¯)u=0y=0. 3.18
  3. Gfrerer’s condition (3.16) and condition (3.13) are both equivalent to
    (C(u,y)),ws(u,0)T(u)y=0. 3.19

Proof

Let us start to prove (a). If the 2-regularity condition holds at x¯ 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

{0}=ND(g(x¯))kerg(x¯){yRm|-2y,g(x¯)(u)(g(x¯)-1TD(g(x¯)))}.

Relying on [23, Exercise 3.5] again while taking convexity and polyhedrality of D (and, thus, of ND(g(x¯))) into account, we find

{0}=ND(g(x¯))kerg(x¯){yRm|-2y,g(x¯)(u)g(x¯)ND(g(x¯))}. 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

clImg(x¯)+2g(x¯)[u,g(x¯)-1TD(g(x¯))]-TD(g(x¯))=Rm.

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 x¯ 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

(C(u,y)),2y,g(x¯)[u,u]=0,ws~(u,0)TD(g(x¯))y=0, 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, yND(g(x¯))kerg(x¯) is a maximizer if and only if

1/22g(x¯)[u,u]NND(g(x¯))kerg(x¯)(y)=ND(g(x¯))kerg(x¯)[y]=TD(g(x¯))+Img(x¯)[y].

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 s~X such that

2y,g(x¯)[u,u]=0,ws~(u,0)TD(g(x¯)),

showing the claimed equivalence between (3.16) and (3.21) as yND(g(x¯))kerg(x¯) is already included in (C(u,y)).

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(u,y)) holds while there exists some sX with ws(u,0)T(u). Particularly, from these two we infer z,g(x¯)u=0 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 (LP^(0)) where we used graphic file with name 10107_2024_2089_Figc_HTML.jpg for some parameter qRm.

For arbitrary qRm, we claim that whether (LP^(q)) 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 (LP^(q)) is feasible, then it possesses a solution if and only if there does not exist sX satisfying 2y,g(x¯)[u,s]<0 and

g(x¯)s(TD(g(x¯))-q)=(TD(g(x¯)))=TD(g(x¯)),

and these conditions are, indeed, independent of q. Above, we have used [71, Exercises 3.12 and 6.34(c)]. Since (LP^(0)) has a solution, (LP^(q)) has a solution for each qRm for which it is feasible. Particularly, Lemma 3.2 thus yields that (LP^(q¯)) has a solution s¯X for q¯:=2g(x¯)[u,u].

Finally, we claim that s¯ is also a solution of the (feasible) linear program

mins~{2y,g(x¯)[u,s~]|ws~(u,0)T(u)},

whose feasible set equals the set A~1(y,u,0) from (3.8). As explained just below (3.8), this will confirm the premise of (3.13) and thus conclude the proof. Suppose that s¯ is not a solution of this problem, i.e., there exists s^ with 2y,g(x¯)[u,s^-s¯]<0 and

ws^(u,0)T(u)=TD(g(x¯))+span(g(x¯)u).

Then s^+αu is a feasible point of (LP^(q¯)) for some αR, while

2y,g(x¯)[u,(s^+αu)-s¯]=2y,g(x¯)[u,s^-s¯]<0

follows from 2y,g(x¯)[u,u]=0 which holds by Lemma 3.2. The latter, however, means that s¯ is not optimal for (LP^(q¯)) - 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 Y:=Rm, let D be convex and polyhedral, and fix (x¯,0)gphΦ as well as uSX such that g(x¯)uTD(g(x¯)). Then the following implications hold:

(3.15)(3.12)(3.16)(3.13).

Particularly, (3.15) implies that Φ is metrically pseudo-regular of order 2 at (x¯,0) in direction (u, 0). Moreover, if there exists sX with ws(u,0)T(u), 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(u,y)) and the existence of sX such that ws(u,0)T(u) imply 2y,g(x¯)[u,u]=0, see Lemma 3.2, and z,g(x¯)u=0 follows by (C(u,y)).

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 g:RR2 and DiR2, i=1,2, be given by g(x):=(x,-x2), xR, and

D1:=R×R+,D2:=R-×R+.

Observe that Di is a convex polyhedral set for i=1,2. We consider the constraint mappings Φi:RR2 given by Φi(x):=g(x)-Di, xR, for i=1,2 and fix x¯:=0 and u:=-1. Note that (x¯,0)gphΦi for i=1,2.

Let us start with the investigation of the mapping Φ1. Due to ND1(g(x¯))={0}×R- and

g(x¯)y=y1,2y,g(x¯)(u)+g(x¯)z=2y2+z1,

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 Φ2. Clearly, (3.18) remains valid since the appearing variable z has to be chosen from the set ND2(g(x¯))[g(x¯)u]={0}×R-. Hence, due to Proposition 3.1, (3.12) holds (and, thus, pseudo-regularity of order 2 of Φ2 in direction u at (x¯,0)). However, we have ND2(g(x¯))=R+×R-, so that choosing y:=(0,-1) and z:=(2,0) 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 sR, we have

ws(u,0)=g(x¯)s+1/22g(x¯)[u,u]=(s,-1)R-×R+=TD2(g(x¯)),

see Corollary 3.2. Hence, (3.12) is strictly milder than (3.15).

Let us take a closer look at the particular situation where D:={0}.

Remark 3.5

Set Y:=Rm, D:={0}, and fix (x¯,0)gphΦ as well as uSX such that ukerg(x¯). 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

g(x¯)y=0,2y,g(x¯)(u)+g(x¯)z=0y=0, 3.22

and the latter is equivalent to the 2-regularity condition (3.15) at x¯ 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

g(x¯)y=0,2y,g(x¯)(u)+g(x¯)z=0,ws(u,0)=0y=0,

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 uSX (this implies metric pseudo-subregularity of order 2 of Φ at (x¯,0) for all unit directions), then either g(x¯) 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 g:R2R3 and DR3 be given by g(x):=(x12,x22,x1x2), xR2, and D:={0}. We consider the point x¯:=0. As g(x¯) vanishes while we have TD(g(x¯))={0}, each direction uSR2 satisfies g(x¯)uTD(g(x¯)), and we pick any such u. Due to Remark 3.5, (3.12) and (3.15) reduce to

y1(2u1,0)+y2(0,2u2)+y3(u2,u1)=(0,0)y=0,

and since three vectors in R2 are always linearly dependent, this condition is trivially violated. On the other hand, (3.13) and (3.16) can be stated as

y1(2u1,0)+y2(0,2u2)+y3(u2,u1)=(0,0),(u12,u22,u1u2)=(0,0,0)y=0,

and this condition holds as the premise regarding u cannot be satisfied by any uSR2.

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 u0, 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 R2 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 sX 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 φ:XR, a set-valued mapping Φ:XY with a closed graph, and y¯ImΦ, we investigate the rather abstract optimization problem

minx{φ(x)|y¯Φ(x)}. P

Throughout the section, the feasible set of (P) will be denoted by FX. Clearly, we have F from y¯ImΦ. 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 y¯:=0 would not be restrictive since one could simply consider Φ~:XY given by Φ~(x):=Φ(x)-y¯, xX, in the case where y¯ 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 x¯F of (P) is called M-stationary whenever there is a multiplier λY such that

0φ(x¯)+DΦ(x¯,y¯)(λ).

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 x¯F be a local minimizer of (P), and assume that Φ is metrically subregular at (x¯,y¯) in direction uSX. Then there are constants ε>0, δ>0, and C>0 such that x¯ is a global minimizer of

minx{φ(x)+Cdist(y¯,Φ(x))|xx¯+Bε,δ(u)}. 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 x¯F and a pair (γ0,γ)R×R such that γ01 as well as γ1, a direction uX is called critical of order (γ0,γ) for (P) at x¯ whenever there are sequences {uk}kNX, {αk}kNR, {vk}kNY, and {tk}kNR+ satisfying uku, tk0, αk0, vk0, and, for all kN,

(x¯+tkuk,φ(x¯)+(tkuk)γ0αk)epiφ,(x¯+tkuk,y¯+(tkuk)γvk)gphΦ. 4.2

If (γ0,γ):=(1,1), we simply call u a critical direction for (P) at x¯.

Clearly, u:=0 is critical of every order. Moreover, the set of all critical directions of any fixed order is a cone. The most standard case (γ0,γ):=(1,1) corresponds to [36, Definition 5]. If φ is directionally differentiable at x¯, it is easily seen that uX is critical for (P) at x¯ if and only if φ(x¯;u)0 and ukerDΦ(x¯,y¯), see [72, Proposition 3.5] as well. Let us note that whenever x¯F is a feasible point of (P) such that no critical direction for (P) at x¯ exists, then x¯ 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 γ0:=1 (the case γ0:=2 is briefly mentioned in Lemma 4.3), the situation γ>1 (particularly γ:=2) will be very important. For γ0:=1 and arbitrary γ1, a critical direction uX still satisfies dφ(x¯)(u)0 and ukerDγΦ(x¯,y¯), and the converse is valid whenever φ is continuously differentiable at x¯. In the next lemma, we show that if Φ is metrically pseudo-subregular of order γ at (x¯,y¯), then u is actually critical of order (1,γ) for each γ1.

Lemma 4.2

Fix a feasible point x¯F of (P), γ1, and a critical direction uX of order (1,γ) for (P) at x¯. If Φ is metrically pseudo-subregular of order γ in direction u at (x¯,y¯), then u is critical of order (1,γ) for (P) at x¯ for each γ1.

Proof

Let {uk}kNX, {αk}kNR, {vk}kNY, and {tk}kNR+ be sequences satisfying uku, tk0, αk0, vk0, as well as (4.2) for all kN. By metric pseudo-subregularity of order γ of Φ at (x¯,y¯), there is a constant κ>0 such that, for sufficiently large kN, we get the existence of x~kΦ-1(y¯) with

x~k-(x¯+tkuk)κdist(y¯,Φ(x¯+tkuk))(tkuk)γ-1κ(tkuk)γvk(tkuk)γ-1=κtkukvk.

Particularly, we find (x~k-x¯)/tk-uk0 from uku and vk0. Moreover, Lipschitzianity of φ yields

φ(x~k)φ(x~k)-φ(x¯+tkuk)+φ(x¯)+tkukαkLκtkukvk+φ(x¯)+tkukαk=φ(x¯)+tkuk(Lκvk+αk)

for some constant L>0 and sufficiently large kN. Thus, setting u~k:=(x~k-x¯)/tk, α~k:=Lκvk+αk, and t~k:=tk for large enough kN yields u~ku, t~k0, α~k0, as well as

(x¯+t~ku~k,φ(x¯)+t~ku~kα~k)epiφ,(x¯+t~ku~k,y¯)gphΦ

for large enough kN, and so u is critical of order (1,γ) for (P) at x¯ for each γ1

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 M0:XR associated with φ and given by M0(x):=φ(x)+R+, xX. The proof follows simply from the fact that gphM0=epiφ together with Remark 2.1.

Proposition 4.1

Given a feasible point x¯F and a pair (γ0,γ)R×R such that γ01 as well as γ1, a direction uSX is critical of order (γ0,γ) for (P) at x¯ if and only if there exist sequences {uk}kNX and {tk}kNR+ such that uku, tk0, and

dist(φ(x¯),M0(x¯+tkuk))(tkuk)γ00,dist(y¯,Φ(x¯+tkuk))(tkuk)γ0. 4.3

Moreover, if γ0=γ, this is further equivalent to the condition

ukerDγM(x¯,(φ(x¯),y¯))

for the mapping M:XR×Y given by M(x):=M0(x)×Φ(x), xX.

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 M:XY0×Y1××Ys, given by

xX:M(x):=M0(x)×M1(x)××Ms(x)

for the component maps Mi:XYi, i=0,1,,s, and Euclidean spaces Y0,Y1,,Ys, and to allow different orders γi1 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 x¯F be a local minimizer of (P) and let uSX be a critical direction of order (1,γ) for (P) at x¯ with γ1. Then there exist multipliers (0,0)(α,λ)R+×Y satisfying

0αφ(x¯;u)+DγΦ((x¯,y¯);(u,0))(λ).

If the sufficient condition (2.12) for metric pseudo-subregularity of order γ of Φ in direction u at (x¯,y¯) holds, then the above condition holds with α:=1.

Proof

Applying Proposition 4.1 and then [37, Proposition 2 and Theorem 1(2)] yields an element zX and sequences {tk}kNR+, {uk}kN,{xk}kNX, {αk}kN,{αk}kNR, and {vk}kN,{λk}kNY satisfying (among other things) tk0, uku, αk0, tk1-γvk0, as well as xk0, such that, for each kN, (αk,λk)=1 and

(xk,-αk,-λk/(tkuk)γ-1)N^gphM(x¯+tkuk,φ(x¯)+tkαk,y¯+tkγv~k), 4.4

where we used v~k:=tk1-γvk as well as the mapping M:XR×Y defined by M(x):=M0(x)×Φ(x), xX, with the perturbed epigraphical mapping M0:XR given by

xX:M0(x):=φ(x)+|z,x-x¯|3+R+.

Note that we have gphM=(gphM0×Y)P(gphΦ×R), where the permutation mapping P:X×Y×RX×R×Y just swaps the last two components. After replacing the regular by the larger limiting normal cone in (4.4) and noting that xφ(x)+|z,x-x¯|3 is locally Lipschitzian, we can apply the intersection rule for limiting normals from [71, Theorem 6.42]. The latter yields, for each kN, xk,1,xk,2X with xk=xk,1+xk,2 and

(xk,1,-αk)NgphM0(x¯+tkuk,φ(x¯)+tkαk),(xk,2,-λk/(tkuk)γ-1)NgphΦ(x¯+tkuk,y¯+tkγv~k).

Now, local Lipschitzness of xφ(x)+|z,x-x¯|3 together with boundedness of {αk}kN implies boundedness of {xk,1}kN. This, in turn, gives boundedness of {xk,2}kN. Since {λk}kN is also bounded, taking the limit along a suitable subsequence yields some xX, αR, and λY satisfying (α,λ)(0,0) as well as

xDM0((x¯,φ(x¯));(u,0))(α),-xDγΦ((x¯,y¯);(u,0))(λ).

Here, we used the robustness of the directional limiting coderivative, see Lemma 2.1, as well as Lemma 2.8. Taking into account that x|z,x-x¯|3 is smooth with its gradient vanishing at x¯ and using Lemma 3.1 (c) as well as [18, Proposition 5.1], we get α0 and DM0((x¯,φ(x¯));(u,0))(α)αφ(x¯;u). This proves the first statement.

Finally, (2.12) clearly implies α>0, and by rescaling, we can set α:=1.

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 γ1. 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 x¯F be a local minimizer of (P) and consider γ1. Then one of the following conditions holds.

  1. The point x¯ is M-stationary for (P).

  2. There exists a critical direction uSX for (P) at x¯ such that
    0φ(x¯;u)+D~γΦ((x¯,y¯);(u,0))(0). 4.5
  3. There exist a critical direction uSX for (P) at x¯, a nonvanishing multiplier λY, and α0 such that, for v:=αλ, we have
    0φ(x¯;u)+DγΦ((x¯,y¯);(u,v))(λ). 4.6
  4. There exist a critical direction uSX of order (γ0,γ) for (P) at x¯ for each γ01, some yY, and sequences {xk}kN,{ηk}kNX as well as {yk}kNY such that xkΦ-1(y¯) and yky¯ for all kN, satisfying the convergence properties
    xkx¯,yky¯,ηk0,xk-x¯xk-x¯u,vkγ0,λkγ,vkγλkγy,
    where we used
    kN:vkγ:=yk-y¯xk-x¯γ,λkγ:=kxk-x¯γ-1(yk-y¯), 4.7
    as well as
    kN:ηkφ(xk)+DΦ(xk,yk)λkγxk-x¯γ-1. 4.8

Moreover, if Φ is metrically pseudo-subregular of order γ at (x¯,y¯) in each direction ukerDΦ(x¯,y¯)SX, x¯ satisfies one of the alternatives (a), (b), or (c).

Proof

Let ε>0 be chosen such that φ(x)φ(x¯) holds for all xFBε(x¯) and, for each kN, consider the optimization problem graphic file with name 10107_2024_2089_Figd_HTML.jpg For each kN, 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 (xk,yk)X×Y. By feasibility of (x¯,y¯) for (P(k)), we find

kN:φ(xk)+k2yk-y¯2+12xk-x¯2φ(x¯). 4.9

By boundedness of {xk}kNBε(x¯), we may assume xkx~ for some x~Bε(x¯). Observing that {φ(xk)}kN is bounded by continuity of φ, yky¯ easily follows from (4.9). Furthermore, the closedness of gphΦ guarantees (x~,y¯)gphΦ, i.e., x~FBε(x¯) leading to φ(x¯)φ(x~). From (4.9), we find

φ(x¯)φ(x~)φ(x~)+12x~-x¯2=limkφ(xk)+12xk-x¯2φ(x¯),

and x~=x¯ follows. Thus, we have xkx¯.

Let us assume that there is some k0N such that xk0 is feasible to (P). By (4.9), we find

φ(x¯)+k02yk0-y¯2+12xk0-x¯2φ(xk0)+k02yk0-y¯2+12xk0-x¯2φ(x¯),

i.e., xk0=x¯ and yk0=y¯. 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 (x¯,y¯) yields 0φ(x¯)+DΦ(x¯,y¯)(0), which is covered by (a).

Thus, we may assume that xkF=Φ-1(y¯) holds for all kN. Particularly, xkx¯ and yky¯ is valid for all kN in this situation. Assume without loss of generality that {xk}kN belongs to the interior of Bε(x¯).

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

kN:x¯-xkφ(xk)+DΦ(xk,yk)(k(yk-y¯)). 4.10

Setting ηk:=x¯-xk for each kN, we find ηk0. Since {(xk-x¯)/xk-x¯}kNSX, we may assume (xk-x¯)/xk-x¯u for some uSX.

Next, we claim that {yk}kNY, given by yk:=k(yk-y¯)yk-y¯/xk-x¯ for each kN, is bounded. Rearranging (4.9), leaving a nonnegative term away, and division by xk-x¯ give us

kN:φ(xk)-φ(x¯)xk-x¯+k2yk-y¯2xk-x¯0. 4.11

Lipschitzianity of φ yields boundedness of the first fraction, so that the sequence {kyk-y¯2/xk-x¯}kN must be bounded and, consequently, {yk}kN as well. Thus, we may assume yky for some yY.

Suppose that {(yk-y¯)/xk-x¯}kN does not converge to zero. This, along a subsequence (without relabeling), yields boundedness of the sequence {k(yk-y¯)}kN, and taking the limit k in (4.10) along yet another subsequence while respecting robustness of the limiting subdifferential and the limiting coderivative yields (a).

Thus, we may assume (yk-y¯)/xk-x¯0 for the remainder of the proof. Observe that we have

(x¯+xk-x¯(xk-x¯)/xk-x¯,y¯+xk-x¯(yk-y¯)/xk-x¯)gphΦ

for all kN. Additionally, (4.11) yields

φ(x¯+xk-x¯(xk-x¯)/xk-x¯)-φ(x¯)0,

so u is a critical direction of order (γ0,1) for each γ01 for (P) at x¯.

In the remainder of the proof, we are going to exploit the sequences {vkγ}kN,{λkγ}kNY given as in (4.7). Observe that yk=vkγλkγ, i.e., λkγ=ykxk-x¯γ/yk-y¯ is valid for each kN. Note that the optimality condition (4.10) can be rewritten as

kN:ηkφ(xk)+DΦ(xk,y¯+xk-x¯γvkγ)λkγxk-x¯γ-1. 4.12

Now, we need to distinguish three options.

Let us assume that λkγ0. Using tk:=xk-x¯, we can reformulate (4.12) as

kN:ηkφ(xk)+DΦx¯+tkxk-x¯xk-x¯,y¯+tkyk-y¯xk-x¯λkγtkγ-1.

Taking the limit k while respecting robustness of the directional limiting subdifferential as well as Lemma 2.8 yields (b) since (yk-y¯)/xk-x¯0 and u has already been shown to be critical for (P) at x¯.

If {λkγ}kN remains bounded but, along a subsequence (without relabeling), stays away from zero, we also get boundedness of {vkγ}kN from boundedness of {yk}kN, 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 λ,vY with λ0 satisfy λkγλ and vkγv, respectively, and using αk:=(kxk-x¯2γ-1)-1 for all kN as well as (4.7), we find vkγ=αkλkγ for all kN, αkv/λ=:α, and v=αλ. Criticality of u for (P) at x¯ has been shown above. Thus, situation (c) has been verified.

If {λkγ}kN is not bounded, we pass to a subsequence (without relabeling) such that λkγ and so we also get vkγ0 along this subsequence by boundedness of {yk}kN. This means that u is actually critical of order (γ0,γ) for (P) at x¯ 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 {λkγ}kN from above remains bounded if we assume that Φ is metrically pseudo-subregular of order γ in direction u at (x¯,y¯). By boundedness of {yk}kN, we immediately obtain the boundedness of {λkγ}kN unless we have vkγ0. Thus, let us assume the latter. By metric pseudo-subregularity of Φ, there is a constant κ>0 such that, for sufficiently large kN, we get the existence of x~kΦ-1(y¯) with

xk-x~kκdist(y¯,Φ(xk))xk-x¯γ-1κyk-y¯xk-x¯γ-1=κxk-x¯vkγ. 4.13

Particularly, we find xk-x~k0 from vkγ0, and x~kx¯ follows. Since (xk,yk) is a global minimizer of (P(k)), we get

φ(xk)-φ(x~k)xk-x¯+k2yk-y¯2xk-x¯+12xk-x¯2-x~k-x¯2xk-x¯0

for all sufficiently large kN. Due to vkγ0 for all kN, rearranging the above estimate and using (4.7) as well as (4.13) yield

λkγ=kyk-y¯2xk-x¯vkγ2κ|φ(xk)-φ(x~k)|xk-x~k+κ|xk-x¯2-x~k-x¯2|xk-x~k.

Boundedness of {λkγ}kN thus follows from Lipschitzianity of φ and the estimate

|xk-x¯2-x~k-x¯2|xk-x~k(x~k-x¯+xk-x¯).

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 x¯F be a local minimizer of (P) and consider γ1. Then the following assertions hold.

  1. If Φ is metrically pseudo-subregular of order γ at (x¯,y¯) in each unit direction, then one of the alternatives (a), (b), or (c) of Theorem 4.1 holds.

  2. If there are no critical directions of order (1,γ) for (P) at x¯, then one of the alternatives (a), (b), or (c) from Theorem 4.1 is valid. If there exists a critical directions uSX of order (1,γ) for (P) at x¯ satisfying (2.12), then even
    0φ(x¯;u)+DγΦ((x¯,y¯);(u,0))(λ) 4.14
    holds for some λY.

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 uSX of order (1,γ) for (P) at x¯ (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 γ:=1, such a result is known to hold, see [36, Theorem 7].

Note that (4.14) is covered by the alternative (b) (if λ=0, see (2.7)) or (c) (if λ0) 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 (1,γ)).

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.

  1. 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.

  2. The refined assumptions in Corollary 4.2 (b) are clearly milder, but they depend on a critical direction (of order (1,γ)), 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 γ:=1 and γ:=2 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 γ:=2 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 γ:=1 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 x¯F of (P) is M-stationary if one of the following conditions holds.

  1. The mapping Φ is metrically subregular at (x¯,y¯) in each unit direction.

  2. There are no critical directions for (P) at x¯, or there is a critical direction uSX for (P) at x¯ and Φ is metrically subregular at (x¯,y¯) in direction u, in which case there is a multiplier λY such that
    0φ(x¯;u)+DΦ((x¯,y¯);(u,0))(λ).

Let us now discuss two novel approaches to M-stationarity. The first approach corresponds to using Corollary 4.2 with γ>1 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 uSX and γ1, we say that Aγ(u) holds if (2.12) is satisfied and

D~γΦ((x¯,y¯);(u,0))(0)wSYDγΦ((x¯,y¯);(u,αw))(βw)ImDΦ(x¯,y¯) 4.15

is valid for all α,β0.

Let us mention that

ImD~γΦ((x¯,y¯);(u,0))ImDΦ(x¯,y¯) 4.16

is a sufficient condition for (4.15) due to (2.7). Assumption Aγ(u) leads to the problem of how to compute or estimate the appearing pseudo-coderivatives. As mentioned above, for γ:=2 and in the setting where Φ is a constraint mapping, these objects can be computed and assumption Aγ(u) can be made explicit. We discuss this case in detail in Sect. 5.3.2, where we show that A2(u) is (strictly) weaker than FOSCMS(u) as well as its refinement SOSCMS(u) in the polyhedral case. Here, we just explain how Aγ(u) can be used to secure M-stationarity and how to compare it with sufficient conditions for metric subregularity.

To proceed, let x¯F be a local minimizer of (P) and consider γ1. Assuming that Aγ(u) holds in every unit direction u implies that options (b) or (c) from Theorem 4.1 yield M-stationarity of x¯, and that option (d) cannot occur. Thus, we end up with x¯ being M-stationary. Similarly, if Aγ(u) holds in a critical direction uSX of order (1,γ) for (P) at x¯, (4.14) is satisfied. Due to (4.15), this also shows M-stationarity of x¯. Thus, we obtain the following from Corollary 4.2.

Corollary 4.4

Let x¯F be a local minimizer of (P) and consider γ1. Then each of the following conditions implies that x¯ is M-stationary.

  1. Condition Aγ(u) holds in each unit direction u.

  2. There are no critical directions for (P) at x¯, or there is a critical direction uSX of order (1,γ) for (P) at x¯ such that Aγ(u) 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 uSX, 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 Aγ(u) is milder than SCMS(u) for every uSX (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 uSX such that SCMS(u) holds, then Lemma 4.2 yields that u is actually critical of order (1,γ) and, thus, the milder assumption Aγ(u) 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 Aγ(u).

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 γ:=1. 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 x¯F be a local minimizer of (P). Then x¯ is M-stationary or there exist a critical direction uSX for (P) at x¯, some yY, and sequences {xk}kN,{ηk}kNX as well as {yk}kNY such that xkΦ-1(y¯) and yky¯ for all kN, satisfying the convergence properties

xkx¯,yky¯,ηk0, 4.17a
xk-x¯xk-x¯u,yk-y¯xk-x¯0, 4.17b
kyk-y¯xk-x¯(yk-y¯)y,kyk-y¯, 4.17c

and

kN:ηkφ(xk)+DΦ(xk,yk)k(yk-y¯). 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 {λk}kN given by

kN:λk:=k(yk-y¯). 4.19

Note that in the case where {λk}kN 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 λk, for {λk}kN as given in (4.19), and taking the limit k leads to a contradiction with the Mordukhovich criterion (2.10a), i.e., metric regularity of Φ at (x¯,y¯). Respecting also the directional information (4.17b) yields a contradiction with FOSCMS(u) at (x¯,y¯).

In both cases, we have essentially discarded the multiplier information (4.17c) which deserves some remarks. We have used λk, 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 {λkyk-y¯/xk-x¯}kN converges tells us how fast the multipliers {λk}kN 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 Aγ(u) 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 (yk-y¯)/yk-y¯=λk/λk means that the multipliers precisely capture the direction from which {yk}kN converges to y¯. Particularly, we find λk/λk,(yk-y¯)/yk-y¯=1, which is clearly more restrictive than the condition λk/λk,(yk-y¯)/yk-y¯1. The latter convergence, which is used in the sufficient condition for metric subregularity in [37, Corollary 1], can be recast as (yk-y¯)/yk-y¯-λk/λk0. 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 γ:=2

In this part, we apply Corollary 4.2 with γ:=2 to the case where Φ:XY is given in the form of a constraint mapping, i.e., Φ(x):=g(x)-D, xX, holds where g:XY is twice continuously differentiable and DY 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 y¯:=0 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 x¯F and let uSX be a critical direction of order (1, 2) of (P) at x¯. Suppose that Y:=Rm and D is locally polyhedral around g(x¯). Then

uC1,2(x¯):={uX|dφ(x¯)(u)0,sX:ws(u,0)T(u)},

where ws(u,0) and T(u) are defined in (3.7). If φ is continuously differentiable, C1,2(x¯) corresponds precisely to the set of critical directions of order (1, 2) of (P) at x¯. Moreover, if φ is even twice continuously differentiable at x¯, the set of all critical directions of order (2, 2) of (P) at x¯ equals

{uX|sX:φ(x¯)s+1/22φ(x¯)[u,u]TR-(φ(x¯)u),ws(u,0)T(u)}. 4.20

Proof

A critical direction u of order (1, 2) of (P) at x¯ satisfies dφ(x¯)(u)0 and 0D2Φ(x¯,0)(u), with equivalence being valid if φ is continuously differentiable at x¯. 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 x¯ if and only if ukerD2M(x¯,(φ(x¯),0)) for M:XR×Rm given by M(x):=(φ(x),g(x))-(R-×D), xX. 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 C2(x¯) from [13, Theorem 3] and its extension labeled second-order tightened critical cone in [9, Theorem 3] actually correspond to C1,2(x¯), 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 (1,γ) for some γ1), 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 x¯F be a local minimizer of (P).

  1. If (3.9), as well as (3.10) or, in the case g(x¯)u0, (3.11) hold for every unit direction, then x¯ is M-stationary or there exist a critical direction uSX and
    yND(g(x¯);g(x¯)u)kerg(x¯),zDND(g(x¯),y)(g(x¯)u) 4.21
    such that
    0φ(x¯;u)+2y,g(x¯)(u)+g(x¯)z. 4.22
    If there exists a critical direction uSX of order (1, 2) of (P) at x¯ satisfying (3.9), as well as (3.10) or, in the case g(x¯)u0, (3.11), then there exist y,zY satisfying (4.21) and (4.22) for this u.
  2. Let Y:=Rm and D be locally polyhedral around g(x¯). If either C1,2(x¯)={0} or if (3.13) holds for every unit direction, then x¯ is M-stationary or there exist a critical direction uSX, sX, y,ziRm for i=1,2, and α0, satisfying g(x¯)y=0,
    y,z1NT(u)(ws(u,v)),z2TNT(u)(ws(u,v))(y),
    and (4.22) (with z=zi,i=1,2), where v:=αy, and ws(u,v) and T(u) have been defined in (3.7). If there exists uC1,2(x¯)SX satisfying (3.13), then there exist sX and
    y,z1NT(u)(ws(u,0)),z2TNT(u)(ws(u,0))(y)
    satisfying (4.22) (with z=zi,i=1,2) as well as g(x¯)y=0.

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 x¯ 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 0φ(x¯;u)+g(x¯)z with

zDND(g(x¯),0)(g(x¯)u)ND(g(x¯);g(x¯)u)ND(g(x¯)),

see Lemma 2.5, and M-stationarity of x¯ follows. In the case of Theorem 4.1 (c), from (2.7) and Theorem 3.1 (a) we precisely obtain y and z 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 x¯ 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 0φ(x¯;u)+g(x¯)z with zNTD(g(x¯))(g(x¯)u)ND(g(x¯)), see Lemma 2.2, and M-stationarity of x¯ follows. In the case of Theorem 4.1 (c), from Theorem 3.2 we precisely obtain y,z1, and z2 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, 1113, 37]. Let us now explain that in the convex polyhedral case, where Y:=Rm holds while D is convex and polyhedral, all these optimality conditions are the same and can be stated simply as follows: If there exists uC1,2(x¯)SX satisfying (3.17), then there are y,zRm satisfying

φ(x¯)+2y,g(x¯)(u)+g(x¯)z=0,g(x¯)y=0,y,zND(g(x¯)) 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, uC1,2(x¯), as this yields the existence of sX with ws(u,0)T(u).

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 sX with ws(u,0)T(u) from uC1,2(x¯), 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(u,y)). From uC1,2(x¯) we also get φ(x¯)u0, while ws(u,0)T(u) and Lemma 3.2 yield 2y,g(x¯)[u,u]0, and z,g(x¯)u0 follows from zND(g(x¯)) and g(x¯)uTD(g(x¯)), which is implicitly required due to ws(u,0)T(u). 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(u,y)) 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

C:=(R+×{0})({0}×R+),

the so-called complementarity angle. For twice continuously differentiable functions G,H:XRm with components G1,,Gm:XR and H1,,Hm:XR, we address the constraint region given by

(Gi(x),Hi(x))CiI MPCC

where I:={1,,m}. 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 D:=Cm. 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 x¯X of (MPCC). A critical direction uSX of the associated problem (P) necessarily needs to satisfy

Gi(x¯)u=0iI0+(x¯),Hi(x¯)u=0iI+0(x¯),(Gi(x¯)u,Hi(x¯)u)CiI00(x¯), 4.24

where we used the well-known index sets

I0+(x¯):={iI|Gi(x¯)=0,Hi(x¯)>0},I+0(x¯):={iI|Gi(x¯)>0,Hi(x¯)=0},I00(x¯):={iI|Gi(x¯)=0,Hi(x¯)=0}.

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

gphNC=(R+×{0}×{0}×R)({0}×R+×R×{0})({0}×{0}×R-×R-),

some elementary calculations show

DNC((a,b),(μ,ν))(v)={0}×Ra>0,b=μ=0,v2=0,R×{0}a=ν=0,b>0,v1=0,R2a=b=0,μ,ν<0,v=0,{0}×Ra=b=μ=0,ν<0,v1>0,v2=0,R-×Ra=b=μ=0,ν<0,v=0,R×{0}a=b=ν=0,μ<0,v1=0,v2>0,R×R-a=b=ν=0,μ<0,v=0,{0}×Ra=b=μ=0,ν>0,v10,v2=0,R×{0}a=b=ν=0,μ>0,v1=0,v20,{0}×Ra=b=μ=ν=0,v1>0,v2=0,R×{0}a=b=μ=ν=0,v1=0,v2>0,NC(0)a=b=μ=ν=0,v=0,otherwise 4.25

for arbitrary ((a,b),(μ,ν))gphNC and vR2. Consequently, for uSX satisfying (4.24), (3.9) reduces to

G(x¯)μ+H(x¯)ν=0,i=1m(μi2Gi(x¯)+νi2Hi(x¯))u+G(x¯)μ~+H(x¯)ν~=0,iI+0(x¯)I+000(x¯,u):μi=0,iI0+(x¯)I0+00(x¯,u):νi=0,iI0000(x¯,u):μi,νi0orμiνi=0,iI:(μ~i,ν~i)DNC((G¯i,H¯i),(μi,νi))(G¯iu,H¯iu)μ=ν=0, 4.26

while (3.14) reads as

G(x¯)μ+H(x¯)ν=0,G(x¯)μ~+H(x¯)ν~=0,iI+0(x¯)I+000(x¯,u):μi=0,iI0+(x¯)I0+00(x¯,u):νi=0,iI0000(x¯,u):μi,νi0orμiνi=0,iI:(μ~i,ν~i)DNC((G¯i,H¯i),(μi,νi))(G¯iu,H¯iu)μ~=ν~=0. 4.27

Above, for each iI, we used G¯i:=Gi(x¯), H¯i:=Hi(x¯), G¯iu:=Gi(x¯)u, and H¯iu:=Hi(x¯)u for brevity as well as the index sets

I0+00(x¯,u):={iI00(x¯)|G¯iu=0,H¯iu>0},I+000(x¯,u):={iI00(x¯)|G¯iu>0,H¯iu=0},I0000(x¯,u):={iI00(x¯)|G¯iu=0,H¯iu=0}.

The first assertion of Proposition 4.2 (a) now yields that whenever x¯ is a local minimizer for the associated problem (P) and for each uSX satisfying (4.24), (4.26) and (4.27) hold, then x¯ is either M-stationary, i.e., there are multipliers μ,νRm satisfying

0φ(x¯)+G(x¯)μ+H(x¯)ν,iI+0(x¯):μi=0,iI0+(x¯):νi=0,iI00(x¯):μi,νi0orμiνi=0,

or we find uSX satisfying (4.24) and dφ(x¯)(u)0 as well as multipliers μ,ν,μ~,ν~Rm such that

0φ(x¯;u)+i=1m(μi2Gi(x¯)+νi2Hi(x¯))u+G(x¯)μ~+H(x¯)ν~,0=G(x¯)μ+H(x¯)ν,iI+0(x¯)I+000(x¯,u):μi=0,iI0+(x¯)I0+00(x¯,u):νi=0,iI0000(x¯,u):μi,νi0orμiνi=0,iI:(μ~i,ν~i)DNC((G¯i,H¯i),(μi,νi))(G¯iu,H¯iu). 4.28

For brevity, we present the results from Proposition 4.2 (b) only in simplified form, where ws(u,v) 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

NTC(G¯i,H¯i)(G¯iu,H¯iu)={0}×RiI+0(x¯)I+000(x¯,u),R×{0}iI0+(x¯)I0+00(x¯,u),NC(0)iI0000(x¯,u)

is valid for each iI. For each pair (μi,νi)NTC(G¯i,H¯i)(G¯iu,H¯iu), elementary calculations and a comparison with (4.25) show

TNTC(G¯i,H¯i)(G¯iu,H¯iu)(μi,νi)={0}×RiI+0(x¯)I+000(x¯,u),R×{0}iI0+(x¯)I0+00(x¯,u),R2iI0000(x¯,u),μi<0,νi<0,R-×RiI0000(x¯,u),μi=0,νi<0,R×R-iI0000(x¯,u),μi<0,νi=0,{0}×RiI0000(x¯,u),μi=0,νi>0,R×{0}iI0000(x¯,u),μi>0,νi=0,NC(0)iI0000(x¯,u),μi=νi=0=DNC((G¯i,H¯i),(μi,νi))(G¯i,H¯i).

Thus, validity of (4.26) for each uSX satisfying (4.24) is already enough to infer that whenever x¯ is a local minimizer, then it is either M-stationary or there are uSX satisfying (4.24) as well as dφ(x¯)(u)0 and multipliers μ,ν,μ~,ν~Rm 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 (μ~i,ν~i)NTC(G¯i,H¯i)(G¯iu,H¯iu) has to hold for all iI, see Remark 3.3 again. One can easily check that there is no general inclusion between NTC(G¯i,H¯i)(G¯iu,H¯iu) and TNTC(G¯i,H¯i)(G¯iu,H¯iu)(μi,νi), 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 X:=R, m:=1, and G(x):=x as well as H(x):=x2 for all xR. We are interested in the unique feasible point x¯:=0 of this system. The only direction from the unit sphere that satisfies (4.24) is u:=1. Hence, (4.26) reduces to

μ=0,2ν+μ~=0,(μ~,ν~)DNC((0,0),(μ,ν))(1,0)μ=ν=0.

Let the premise be valid and assume ν0. This gives DNC((0,0),(0,ν))(1,0)={0}×R due to (4.25), i.e., μ~=0, and, thus, ν=0 which yields a contradiction. Hence, this constraint qualification holds. However, (4.27) is given by

μ=0,μ~=0,(μ~,ν~)DNC((0,0),(μ,ν))(1,0)μ~=ν~=0,

and one can easily check with the aid of (4.25) that the premise holds for (μ,ν):=(μ~,ν~):=(0,1), 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 Sm of all real symmetric matrices equipped with the standard (Frobenius) inner product. We denote by Sm+ and Sm- the cone of all positive and negative semidefinite matrices in Sm, 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 g:XSm, we investigate the constraint system

g(x)Sm+. NLSD

It is well known that the closed, convex cone Sm+ 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 Sm+ is not polyhedral, Lemma 4.3 cannot be used for a characterization of critical directions of order (1, 2).

Let x¯X be feasible to (NLSD) and, for some uSX, fix ΩNSm+(g(x¯);g(x¯)u). For later use, fix an orthogonal matrix PRm×m and a diagonal matrix ΛRm×m whose diagonal elements λ1,,λm are ordered nonincreasingly such that g(x¯)+Ω=PΛP. 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 QP:=PQP and QIJP:=(QP)IJ for each matrix QSm and index sets I,J{1,,m} where MIJ is the submatrix of MSm which possesses only those rows and columns of M whose indices can be found in I and J, respectively.

The above constructions yield

g(x¯)=Pmax(Λ,O)P,Ω=Pmin(Λ,O)P

where max and min have to be understood in entrywise fashion and O is an all-zero matrix of appropriate dimensions. Due to

g(x¯)uTSm+(g(x¯))=QSm|Qβγ,βγPS|βγ|+,

we find

0=Ω,g(x¯)u=trace(Ωg(x¯)u)=trace(Pmin(Λ,O)PP[g(x¯)u]PP)=trace(min(Λ,O)[g(x¯)u]P)=iγλi<0[g(x¯)u]i,iP0

which directly gives us [g(x¯)u]βγP=O, [g(x¯)u]γγP=O, and [g(x¯)u]ββPS|β|+. Furthermore, we note

NSm+(g(x¯))=Ω~Sm|Ω~ααP=O,Ω~αβP=O,Ω~αγP=O,Ω~βγ,βγPS|βγ|-.

Finally, let ΞαγR|α|×|γ| be the matrix given by

iαjγ:[Ξαγ]ij:=-λjλi.

It is well known that the projection onto Sm+ is directionally differentiable. With the aid of Lemma 2.4 and [75, Corollary 3.1], we find

DNSm+(g(x¯),Ω)(g(x¯)u)=Ω~SmΩ~ααP=O,Ω~αβP=O,Ω~αγP=Ξαγ[g(x¯)u]αγP,Ω~ββPS|β|-,Ω~ββP,[g(x¯)u]ββP=0,

and if g(x¯)uO, we obtain

DsubNSm+(g(x¯),Ω)g(x¯)ug(x¯)uΩ~Sm|Ω~ααP=O,Ω~αβP=O,Ω~αγP=O,Ω~ββPS|β|-,Ω~ββP,[g(x¯)u]ββP=0.

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 Ω~DsubNSm+(g(x¯),Ω)(g(x¯)u/g(x¯)u) and g(x¯)u>0 yield

0Ω~,g(x¯)u=trace(Ω~g(x¯)u)=trace(PΩ~PPP[g(x¯)u]PP)=trace(Ω~P[g(x¯)u]P)=trace(Ω~ββP[g(x¯)u]ββP)0

due to Ω~ααP=O, Ω~αβP=O, Ω~αγP=O, Ω~ββPS|β|-, [g(x¯)u]βγP=O, [g(x¯)u]γγP=O, and [g(x¯)u]ββPS|β|+. Thus, for each uSX, (3.9) takes the form

g(x¯)Ω=0,2Ω,g(x¯)(u)+g(x¯)Ω~=0,ΩααP=O,ΩαβP=O,ΩαγP=O,Ωβγ,βγPS|βγ|-,[g(x¯)u]βγP=O,[g(x¯)u]γγP=O,[g(x¯)u]ββPS|β|+,Ω~ααP=O,Ω~αβP=O,Ω~αγP=Ξαγ[g(x¯)u]αγP,Ω~ββPS|β|-,Ω~ββP,[g(x¯)u]ββP=0Ω=O,

while (3.10) and (3.11) (the latter in the case g(x¯)uO) are both implied by

g(x¯)Ω=0,g(x¯)Ω~=0,ΩααP=O,ΩαβP=O,ΩαγP=O,Ωβγ,βγPS|βγ|-,[g(x¯)u]βγP=O,[g(x¯)u]γγP=O,[g(x¯)u]ββPS|β|+,Ω~ααP=O,Ω~αβP=O,Ω~αγP=O,Ω~ββPS|β|-,Ω~ββP,[g(x¯)u]ββP=0Ω~=O.

In the case where x¯ is a local minimizer of the associated problem (P), validity of these conditions for each uSX guarantees that x¯ is either M-stationary (we omit stating this well-known system here) or we find uSX and Ω,Ω~Sm such that

0φ(x¯;u)+2Ω,g(x¯)(u)+g(x¯)Ω~,g(x¯)Ω=0,ΩααP=O,ΩαβP=O,ΩαγP=O,Ωβγ,βγPS|βγ|-,dφ(x¯)(u)0,[g(x¯)u]βγP=O,[g(x¯)u]γγP=O,[g(x¯)u]ββPS|β|+,Ω~ααP=O,Ω~αβP=O,Ω~αγP=Ξαγ[g(x¯)u]αγP,Ω~ββPS|β|+,Ω~ββP,[g(x¯)u]ββP=0.

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 Φ:XY 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 (x¯,y¯)gphΦ be fixed.

  1. The map Φ is said to be asymptotically regular at (x¯,y¯) whenever the following condition holds: for every sequences {(xk,yk)}kNgphΦ, {xk}kNX, and {λk}kNY as well as xX satisfying xkx¯, yky¯, xkx, and xkD^Φ(xk,yk)(λk) for all kN, we find xImDΦ(x¯,y¯).

  2. For the fixed direction uSX, Φ is said to be asymptotically regular at (x¯,y¯) in direction u whenever the following condition holds: for every sequences {(xk,yk)}kNgphΦ, {xk}kNX, and {λk}kNY as well as xX and yY satisfying xkΦ-1(y¯), yky¯, and xkD^Φ(xk,yk)(λk) for each kN as well as the convergences
    xkx¯,yky¯,xkx,xk-x¯xk-x¯u,yk-y¯xk-x¯0,yk-y¯xk-x¯λky,λk,yk-y¯yk-y¯-λkλk0, 5.1
    we find xImDΦ(x¯,y¯).
  3. For the fixed direction uSX, Φ is said to be strongly asymptotically regular at (x¯,y¯) in direction u whenever the following condition holds: for every sequences {(xk,yk)}kNgphΦ, {xk}kNX, and {λk}kNY as well as xX and yY satisfying xkΦ-1(y¯), yky¯, and xkD^Φ(xk,yk)(λk) for each kN as well as the convergences (5.1), we have xImDΦ((x¯,y¯);(u,0)).

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 Φ:XY at some point (x¯,0)gphΦ in the sense of Definition 5.1 equals AM-regularity of the set Φ-1(0) at x¯ 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 (x¯,y¯)gphΦ be fixed. Then the following assertions hold.

  1. Let uSX be arbitrarily chosen. If Φ is strongly asymptotically regular at (x¯,y¯) in direction u, it is asymptotically regular at (x¯,y¯) in direction u.

  2. If Φ is asymptotically regular at (x¯,y¯), then it is asymptotically regular at (x¯,y¯) in each direction from SX.

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 Φ:RR given by

xR:Φ(x):=Rifx0,[x2,)ifx>0

at (x¯,y¯):=(0,0). It is demonstrated in [63, Example 3.15] that Φ is asymptotically regular at (x¯,y¯). We find TgphΦ(x¯,y¯)={(u,v)R2|u0orv0} so (±1,0)TgphΦ(x¯,y¯). Let us consider u:=1. Then we find ImDΦ((x¯,y¯);(u,0))={0}. Taking x:=1, y:=1/2, as well as

kN:xk:=1k,yk:=1k2,xk:=1,λk:=k2,

we have xkD^Φ(xk,yk)(λk) for all kN as well as the convergences (5.1). However, due to xkxImDΦ((x¯,y¯);(u,0)), Φ is not strongly asymptotically regular at (x¯,y¯) 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 x¯F be a local minimizer of (P) such that, for each critical direction uSX for (P) at x¯, Φ is asymptotically regular at (x¯,y¯) in direction u. Then x¯ is M-stationary.

Proof

Due to Corollary 4.5, it suffices to consider the situation where there are a critical direction uSX for (P) at x¯ and yY as well as sequences {xk}kN,{ηk}kN,{xk}kNX and {yk}kNY such that xkΦ-1(y¯), yky¯, xkφ(xk), and

ηk-xkDΦ(xk,yk)k(yk-y¯)

for all kN as well as the convergences (4.17) are valid.

Since φ is a locally Lipschitz continuous function, {xk}kN is bounded, see e.g. [66, Theorem 1.22], and, thus, converges (along a subsequence), to some point xX which belongs to φ(x¯) by robustness of the limiting subdifferential.

We can set λk:=k(yk-y¯) for each kN and obtain λkyk-y¯/xk-x¯y and λk from (4.17c) as well as (yk-y¯)/yk-y¯=λk/λk for each kN by construction. Additionally, ηk-xkDΦ(xk,yk)(λk) is valid for each kN.

Now, asymptotic regularity of Φ at (x¯,y¯) in direction u, Proposition 5.1, and the remaining convergences from (4.17) yield -xImDΦ(x¯,y¯), i.e., there exists λY such that -xDΦ(x¯,y¯)(λ). Recalling xφ(x¯) 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 x is included in ImDΦ(x¯,y¯) 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.

  1. A polyhedral mapping is asymptotically regular at each point of its graph.

  2. Metric regularity implies asymptotic regularity.

  3. Strong metric subregularity implies asymptotic regularity.

  4. FOSCMS does not imply asymptotic regularity, but it implies strong asymptotic regularity in each unit direction.

  5. 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.

  6. 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 Φ:RR be given by

xR:Φ(x):=[x,)ifx0,1k-1kx-1k,ifx1k+1,1kfor somekN,otherwise.

Then {(1/k,1/k)}kNgphΦ converges to (x¯,y¯):=(0,0) and

NgphΦ(1/k,1/k)={(x,y)R2|y0,ykx}

is valid showing that ImDΦ(1/k,1/k)=R holds for all kN. On the other hand, we have

NgphΦ(0,0)={(x,y)R2|x0,y0},

and, thus, ImDΦ(0,0)=R+. This means that Φ is not asymptotically regular at (x¯,y¯).

On the other hand, we find

TgphΦ(x¯,y¯)={(u,v)R2|uv}.

Each pair (u,0)TgphΦ(x¯,y¯) with u0 satisfies u<0, i.e., the direction (u, 0) points into the interior of gphΦ. Thus, we have NgphΦ((x¯,y¯),(u,0))={(0,0)} which shows that FOSCMS is valid.

Regarding (e), let us fix (x¯,y¯)gphΦ and note that metric subregularity of Φ on a neighborhood of (x¯,y¯) (restricted to gphΦ) with a uniform constant κ>0 is clearly milder than metric regularity at (x¯,y¯) since it is automatically satisfied, e.g., for polyhedral mappings. To see that it implies asymptotic regularity, consider sequences {(xk,yk)}kNgphΦ, {xk}kNX, and {λk}kNY as well as xX and yY satisfying xkD^Φ(xk,yk)(λk) for each kN and the convergences (5.1) for some unit direction uSX. Due to [20, Theorem 3.2] and -xkdomD^Φ-1(yk,xk), we find xkN^Φ-1(yk)(xk)NΦ-1(yk)(xk) for each kN. Furthermore, [20, Theorem 3.2] also gives the existence of λ~kY with λ~kκxk and xkDΦ(xk,yk)(λ~k). Noting that {xk}kN converges, this shows that there is an accumulation point λY of {λ~k}kN which satisfies xDΦ((x¯,y¯);(u,0))(λ) by robustness of the directional limiting coderivative, see Lemma 2.1. Hence, Φ is strongly asymptotically regular at (x¯,y¯) in direction u. Note that for the above arguments to work, we only need uniform metric subregularity along all sequences {(xk,yk)}kNgphΦ converging to (x¯,y¯) 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 Φ:RR given by

xR:Φ(x):={0,x2}.

Due to Φ-1(0)=R, Φ is metrically subregular at all points (x, 0) where xR is arbitrary. Furthermore, at all points (x,x2) where x0 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 (x,x2) as x0 or x0.

Let us consider the point (x¯,y¯):=(0,0) where we have NgphΦ(x¯,y¯)={0}×R and, thus, ImDΦ(x¯,y¯)={0}. Choosing x:=1, y:=1/2, as well as

kN:xk:=1k,yk:=1k2,xk:=1,λk:=k2,

we have xkD^Φ(xk,yk)(λk) for all kN as well as the convergences (5.1) for u:=1. Due to xkxImDΦ(x¯,y¯), Φ is not asymptotically regular at (x¯,y¯) in direction u.

Finally, let us address item (f) with the aid of an example.

Example 5.4

Let us define φ:RR and Φ:RR by means of

xR:φ(x):=-x,Φ(x):=Rifx0,[x2,)ifx=1kfor somekN,otherwise.

Furthermore, we fix y¯:=0. One can easily check that x¯:=0 is the uniquely determined global minimizer of the associated problem (P). Furthermore, we have ImDΦ(x¯,y¯)=ImDΦ((x¯,y¯);(1,0))=R which shows that Φ is asymptotically regular at (x¯,y¯) as well as strongly asymptotically regular at (x¯,y¯) in direction 1. Furthermore, it is obvious that Φ is strongly asymptotically regular at (x¯,y¯) in direction -1. Finally, let us mention that Φ fails to be metrically subregular at (x¯,y¯) in direction 1.

Now, define xk:=1/k for each kN and observe that for each constant C>0 and sufficiently large kN, we have φ(xk)+Cdist(y¯,Φ(xk))=-1/k+C/k2<0=φ(x¯), i.e., x¯ is not a minimizer of (4.1) for any choice of C>0, ε>0, δ>0, and u:=1.

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 (x¯,y¯)gphΦ and a direction uSX.

  1. We say that pseudo-normality in direction u holds at (x¯,y¯) if there does not exist a nonzero vector λkerDΦ((x¯,y¯);(u,0)) satisfying the following condition: there are sequences {(xk,yk)}kNgphΦ with xkx¯ for all kN and {λk}kNY, {ηk}kNX, such that
    xkx¯,yky¯,λkλ,ηk0,xk-x¯xk-x¯u,yk-y¯xk-x¯0, 5.2
    and ηkD^Φ(xk,yk)(λk) as well as λ,yk-y¯>0 for all kN.
  2. Let E:={e1,,em}Y be an orthonormal basis of Y. We say that quasi-normality in direction u holds at (x¯,y¯) w.r.t. E if there does not exist a nonzero vector λkerDΦ((x¯,y¯);(u,0)) satisfying the following condition: there are sequences {(xk,yk)}kNgphΦ with xkx¯ for all kN and {λk}kNY, {ηk}kNX, such that we have the convergences from (5.2) and, for all kN and i{1,,m}, ηkD^Φ(xk,yk)(λk) as well as λ,eiyk-y¯,ei>0 if λ,ei0.

In the case where the canonical basis is chosen in Y:=Rm, 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 {yk}kN in the definition of directional pseudo- and quasi-normality needs to satisfy yky¯ for all kN. In the definition of directional pseudo-normality, this is clear from λ,yk-y¯>0 for all kN. Furthermore, in the definition of directional quasi-normality, observe that λ0 implies the existence of j{1,,m} such that λ,ej0 holds, so that yk-y¯,ej0 is necessary for each kN.

In the following lemma, we show the precise relation between directional pseudo- and quasi-normality.

Lemma 5.1

Fix (x¯,y¯)gphΦ and some direction uSX. Then Φ is pseudo-normal at (x¯,y¯) in direction u if and only if Φ is quasi-normal at (x¯,y¯) in direction u w.r.t. each orthonormal basis of Y.

Proof

[] Let Φ be pseudo-normal at (x¯,y¯) in direction u, let E:={e1,,em}Y be an orthonormal basis of Y, and pick λkerDΦ((x¯,y¯);(u,0)) as well as sequences {(xk,yk)}kNgphΦ with xkx¯ for all kN and {λk}kNY, {ηk}kNX, satisfying the convergences (5.2) and, for all kN and i{1,,m}, ηkD^Φ(xk,yk)(λk) as well as λ,eiyk-y¯,ei>0 if λ,ei0. Observing that we have

λ,yk-y¯=i=1mλ,eieij=1myk-y¯,ejej=i=1mj=1mλ,eiyk-y¯,ejei,ej=i=1mλ,eiyk-y¯,ei,

validity of pseudo-normality at (x¯,y¯) in direction u gives λ=0, i.e., Φ is quasi-normal at (x¯,y¯) in direction u w.r.t. E.

[] Assume that Φ is quasi-normal at (x¯,y¯) in direction u w.r.t. each orthonormal basis of Y. Suppose that Φ is not pseudo-normal at (x¯,y¯) in direction u. Then we find some nonzero λkerDΦ((x¯,y¯);(u,0)) as well as sequences {(xk,yk)}kNgphΦ with xkx¯ for all kN and {λk}kNY, {ηk}kNX, satisfying the convergences (5.2) and ηkD^Φ(xk,yk)(λk) as well as λ,yk-y¯>0 for all kN. Noting that λ does not vanish, we can construct an orthonormal basis Eλ:={e1λ,,emλ} of Y with e1λ:=λ/λ. Note that, for i{1,,m}, we have λ,eiλ0 if and only if i=1 by construction of Eλ. Furthermore, we find

λ,e1λyk-y¯,e1λ=λλ/λ,yk-y¯=λ,yk-y¯>0.

This, however, contradicts quasi-normality of Φ at (x¯,y¯) in direction u w.r.t. Eλ.

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 Rm. 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 Rm. Exemplary, in the 12m(m+1)-dimensional space Sm of all real symmetric m×m-matrices, the canonical basis, which seems to be associated with a componentwise calculus, comprises precisely 12(m-1)m 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 (yk-y¯)/yk-y¯-λk/λk0.

Theorem 5.1

If Φ:XY is quasi-normal in direction uSX at (x¯,y¯)gphΦ w.r.t. some orthonormal basis E:={e1,,em}Y of Y, then it is also strongly asymptotically regular as well as metrically subregular in direction u at (x¯,y¯).

Proof

Fix arbitrary sequences {(xk,yk)}kNgphΦ, {xk}kNX, and {λk}kNY as well as xX and yY satisfying xkΦ-1(y¯), yky¯, and xkD^Φ(xk,yk)(λk) for each kN as well as the convergences (5.1). Let us define wk:=(yk-y¯)/yk-y¯ and λ~k:=λk/λk for each kN. The requirements from (5.1) imply that {wk}kN and {λ~k}kN converge, along a subsequence (without relabeling), to the same nonvanishing limit which we will call λSY. Moreover, given i{1,,m} with λ,ei0, for sufficiently large kN, we get wk,ei0 and

0<λ,eiwk,ei=λ,eiyk-y¯,ei/yk-y¯.

Observing that we have xk/λk0 from (5.1), we find λkerDΦ((x¯,y¯);(u,0)) by definition of the directional limiting coderivative. This contradicts validity of quasi-normality of Φ at (x¯,y¯) in direction u w.r.t. E. Particularly, such sequences {(xk,yk)}kN, {xk}kN, and {λk}kN cannot exist which means that Φ is strongly asymptotically regular in direction u at (x¯,y¯).

The claim about metric subregularity now follows from [37, Corollary 1], since the only difference from quasi-normality is the requirement

λk/λk,(yk-y¯)/yk-y¯1

which is the same as (yk-y¯)/yk-y¯-λk/λk0 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 y¯:=0 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 Φ:XY given by Φ(x):=g(x)-D, xX, where g:XY is a continuous function which is calm in direction uSX at x¯X such that (x¯,0)gphΦ and DY is closed, is quasi-normal in direction u at (x¯,0) w.r.t. some orthonormal basis E:={e1,,em}Y of Y provided there do not exist a direction vY and a nonzero vector λND(g(x¯);v) with 0Dg(x¯;(u,v))(λ) satisfying the following condition: there are sequences {xk}kNX with xkx¯ for all kN, {zk}kND, {λk}kNY, and {ηk}kNX satisfying xkx¯, zkg(x¯), λkλ, ηk0,

xk-x¯xk-x¯u,zk-g(x¯)xk-x¯v,g(xk)-g(x¯)xk-x¯v, 5.3

and, for all kN and i{1,,m}, ηkD^g(xk)(λk), λkN^D(zk), as well as λ,eig(xk)-zk,ei>0 if λ,ei0.

Moreover, if g is even calm near x¯, the two conditions are equivalent.

Proof

[] Choose λkerDΦ((x¯,0);(u,0)) and sequences {(xk,yk)}kNgphΦ with xkx¯ for all kN and {λk}kNY, {ηk}kNX satisfying (5.2) with y¯:=0 and, for all kN and i{1,,m}, ηkD^Φ(xk,yk)(λk) as well as λ,eiyk,ei>0 if λ,ei0. Applying Lemma 3.1 (a) yields ηkD^g(xk)(λk) and λkN^D(g(xk)-yk) for each kN. The assumed calmness of g at x¯ in direction u yields boundedness of the sequence {(g(xk)-g(x¯))/xk-x¯}kN, i.e., along a subsequence (without relabeling) it converges to some vY. Note also that (u,v)Tgphg(x¯,g(x¯)), i.e., vDg(x¯)(u), and that {(xk,g(xk))}kN converges to (x¯,g(x¯)) from direction (uv). Setting zk:=g(xk)-yk for each kN, we get zkg(x¯) by continuity of g as well as λkN^D(zk) and λ,eig(xk)-zk,ei>0 if λ,ei0 for each kN and i{1,,m}. Moreover, we have

zk-g(x¯)xk-x¯=g(xk)-g(x¯)xk-x¯-ykxk-x¯v-0=v

and vTD(g(x¯)) follows as well. Finally, taking the limit yields λND(g(x¯);v) and 0Dg(x¯;(u,v))(λ), so that the assumptions of the proposition imply λ=0. Consequently, Φ is quasi-normal in direction u at (x¯,0) w.r.t. E.

[] Assume that quasi-normality in direction u holds at (x¯,0) w.r.t. E and that g is calm around x¯. Suppose that there are some vY, λND(g(x¯);v) with 0Dg(x¯;(u,v))(λ), and sequences {xk}kNX with xkx¯ for all kN and {zk}kND, {λk}kNY, {ηk}kNX with xkx¯, zkg(x¯), λkλ, ηk0, (5.3), and, for all kN and i{1,,m}, ηkD^g(xk)(λk), λkN^D(zk), as well as λ,eig(xk)-zk,ei>0 as soon as λ,ei0. Set yk:=g(xk)-zk for each kN. Then we have yk0,

ykxk-x¯=g(xk)-zkxk-x¯=g(xk)-g(x¯)xk-x¯-zk-g(x¯)xk-x¯v-v=0,

and, for all kN and i{1,,m}, λkN^D(g(xk)-yk) as well as λ,eiyk,ei>0 if λ,ei0. Since ηkD^g(xk)(λk), calmness of g at xk implies ηkD^Φ(xk,yk)(λk) due to Lemma 3.1 (a), and taking the limit yields λkerDΦ((x¯,y¯);(u,0)). Thus, the assumed quasi-normality of Φ at (x¯,0) in direction u w.r.t. E yields λ=0 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 Φ:XY given by Φ(x)=g(x)-D, xX, where g:XY is continuously differentiable and DY is closed, is quasi-normal in direction uSX at (x¯,0)gphΦ w.r.t. some orthonormal basis {e1,,em}Y of Y if and only if there does not exist a nonzero vector λND(g(x¯);g(x¯)u) with g(x¯)λ=0 satisfying the following condition: there are sequences {xk}kNX with xkx¯ for all kN, {zk}kND, and {λk}kNY satisfying xkx¯, zkg(x¯), λkλ,

xk-x¯xk-x¯u,zk-g(x¯)xk-x¯g(x¯)u, 5.4

and, for all kN and i{1,,m}, λkN^D(zk) and λ,eig(xk)-zk,ei>0 if λ,ei0.

In [16, Section 3.3], it has been reported that under additional conditions on the set D, we can drop the sequences {zk}kN and {λk}kN 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 (uv), 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 (uv), 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 (x¯,y¯)gphΦ and choose {(xk,yk)}kNgphΦ, {xk}kNX, and {λk}kNY as well as xX and yY satisfying xkΦ-1(y¯), yky¯, and xkD^Φ(xk,yk)(λk) for all kN as well as the convergences (5.1). For each kN, we set tk:=xk-x¯, τk:=yk-y¯,

uk:=xk-x¯xk-x¯,vk:=yk-y¯yk-y¯,yk:=yk-y¯xk-x¯λk,

and find τk/tk0 as well as

kN:xkD^Φ(x¯+tkuk,y¯+τkvk)((tk/τk)yk).

Along a subsequence (without relabeling), vkv holds for some vSY. Thus, taking the limit k, we have xDsupΦ((x¯,y¯);(u,v))(y) by definition of the super-coderivative. Moreover, from (5.1) we also know that y=yv. Consequently, we come up with the following lemma.

Lemma 5.2

Let (x¯,y¯)gphΦ and uSX be fixed. If

vSYDsupΦ((x¯,y¯);(u,v))(βv)ImDΦ(x¯,y¯)

holds for all β0, then Φ is asymptotically regular at (x¯,y¯) in direction u. If the above estimate holds for all β0 with ImDΦ(x¯,y¯) replaced by ImDΦ((x¯,y¯);(u,0)), then Φ is strongly asymptotically regular at (x¯,y¯) in direction u.

The next result, which is based on hypothesis Aγ(u), 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 Aγ(u) where ImDΦ(x¯,y¯) in the right-hand side of (4.15) is replaced by ImDΦ((x¯,y¯);(u,0)).

Theorem 5.2

Let (x¯,y¯)gphΦ, uSX, and γ>1 be fixed. If Aγ(u) holds, then Φ is asymptotically regular at (x¯,y¯) in direction u.

In the case where the pseudo-coderivatives involved in the construction of Aγ(u) 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 γ:=2 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 Φ:XY is given by Φ(x):=g(x)-D, xX, where g:XY is a twice continuously differentiable function and DY is a closed set. Furthermore, for simplicity of notation, we fix y¯:=0 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 (x¯,0)gphΦ as well as uSX be fixed. Assume that (3.9) holds, as well as (3.10) or, in the case g(x¯)u0, (3.11). If, for each xX and y,zY satisfying

x=2y,g(x¯)(u)+g(x¯)z, 5.5a
yND(g(x¯);g(x¯)u)kerg(x¯), 5.5b
zDND(g(x¯),y)(g(x¯)u), 5.5c

there is some λND(g(x¯)) such that x=g(x¯)λ, then Φ is asymptotically regular at (x¯,0) in direction u. Moreover, Φ is even strongly asymptotically regular at (x¯,0) in direction u if λ can be chosen from ND(g(x¯);g(x¯)u).

Proof

Theorem 3.1 (a) implies kerD~2Φ((x¯,0);(u,0))={0} (and so, due to (2.7), also kerD2Φ((x¯,0);(u,0))={0}) as well as that for xImD~2Φ((x¯,0);(u,0)), we find y,zY satisfying (5.5). The assumptions guarantee that we can find λND(g(x¯)) such that x=g(x¯)λImDΦ(x¯,0) where we used Lemma 3.1 (b). It follows ImD~2Φ((x¯,0);(u,0))ImDΦ(x¯,0). Thus, Theorem 5.2 shows that Φ is asymptotically regular at (x¯,0) 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 g(x¯)u0 holds, see (2.3). Naturally, this means that it is sufficient to check (3.10) regardless whether g(x¯)u vanishes or not. In the case g(x¯)u0, 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 y¯:=0 and γ:=2) in the proof of Theorem 5.3, and not on the milder refined condition (4.15) (again with y¯:=0 and γ:=2) which appears in the statement of Aγ(u). 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 (x¯,0)gphΦ as well as uSX be fixed. Let Y:=Rm and let D be polyhedral locally around g(x¯). Assume that condition (3.13) holds for each sX. If, for each x,sX, y,zRm, and α0 satisfying (5.5a) and

yNT(u)(ws(u,v))kerg(x¯),zNT(u)(ws(u,v))(orzTNT(u)(ws(u,v))(y)), 5.6

where v:=αy, and T(u) as well as ws(u,v) have been defined in (3.7), there is some λND(g(x¯)) such that x=g(x¯)λ, then Φ is asymptotically regular at (x¯,0) in direction u. Moreover, Φ is even strongly asymptotically regular at (x¯,0) in direction u if λ can be chosen from NTD(g(x¯))(g(x¯)u).

Proof

Due to Theorem 3.2, (3.13) yields kerD2Φ((x¯,0);(u,0)){0} in the present situation. Now, fix xD~2Φ((x¯,0);(u,0))(0). Then Theorem 3.1 (b) shows the existence of zNTD(g(x¯))(g(x¯)u) such that x=g(x¯)z. Let us now consider the case xD2Φ((x¯,0);(u,α¯w))(β¯w) for some wSRm and α¯,β¯0. If β¯=0 holds, we can employ (2.7) to find xD~2Φ((x¯,0);(u,0))(0) and, thus, the above argumentation applies. Thus, let us consider β¯>0 and set α:=α¯/β¯. Then we have xD2Φ((x¯,0);(u,v))(y) for v=αy with v:=α¯w and y:=β¯w. Theorem 3.2 implies the existence of sX such that (5.5a) and (5.6) hold with v=αy. Now, the postulated assumptions guarantee the existence of λND(g(x¯)) such that x=g(x¯)λ. Respecting Lemma 3.1 (b), this shows (4.15) with y¯:=0 and γ:=2. Thus, Theorem 5.2 yields that Φ is asymptotically regular at (x¯,0) 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 x¯X with (x¯,0)gphΦ, Lemma 3.1 (c) shows that the condition

uSX,g(x¯)uTD(g(x¯)),g(x¯)y=0,yND(g(x¯);g(x¯)u)y=0

equals FOSCMS in the current setting. In the case where D is locally polyhedral around g(x¯), the refined condition

uSX,g(x¯)uTD(g(x¯)),g(x¯)y=0,2y,g(x¯)[u,u]0,yND(g(x¯);g(x¯)u)y=0,

is referred to as SOSCMS in the literature. As these names suggest, both conditions are sufficient for metric subregularity of Φ at (x¯,0), 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

g(x¯)y=0,yND(g(x¯);g(x¯)u)y=0

equals FOSCMS(u) in the present setting, and

g(x¯)y=0,2y,g(x¯)[u,u]0,yND(g(x¯);g(x¯)u)y=0

will be denoted by SOSCMS(u). Each of the conditions FOSCMS(u) and SOSCMS(u) is sufficient for metric subregularity of Φ at (x¯,0) in direction u.

Proposition 5.3

Consider (x¯,0)gphΦ and uSX. Under FOSCMS(u) all assumptions of Theorem 5.3 are satisfied.

Proof

Let yND(g(x¯);g(x¯)u) be such that g(x¯)y=0. Then FOSCMS(u) yields y=0 and so (3.9) is satisfied. Moreover, we only need to show the remaining assertions for y=0.

Assume that g(x¯)u0 holds. Suppose now that (3.11) is violated, i.e., there exists z^DsubND(g(x¯),0)(q) for q:=g(x¯)u/g(x¯)u with g(x¯)z^=0. By Lemma 2.5 and FOSCMS(u), we thus get z^=0 which is a contradition since z^SY by Definition 2.2. Similarly, in the case g(x¯)u=0, we can verify (3.10) which reduces to

g(x¯)z^=0,z^DND(g(x¯),0)(0)z^=0.

Applying Lemma 2.5 again, we get z^ND(g(x¯)) which implies z^=0 since FOSCMS(u) corresponds to the Mordukhovich criterion due to g(x¯)u=0. Thus, we have shown that (3.10) or, in the case g(x¯)u0, (3.11) holds.

Validity of the last assumption follows immediately since zND(g(x¯);g(x¯)u) is obtained from Lemma 2.5, and so we can just take λ:=z due to y=0.

Remark 5.4

Note that for uSX satisfying g(x¯)u0, we have the trivial upper estimate DsubND(g(x¯),y)(g(x¯)u/g(x¯)u)DND(g(x¯),y)(0). Hence, in Theorem 5.3, it is possible to replace validity of (3.10) or, in the case g(x¯)u0, (3.11) by the slightly stronger assumption that (3.10) has to hold (even in the case g(x¯)u0). 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 (x¯,0)gphΦ as well as uSX be fixed, let Y:=Rm, and let D be polyhedral locally around g(x¯). If SOSCMS(u) is valid, then the assumptions of Theorem 5.4 are satisfied.

Proof

The key step is to realize that if yNT(u)(ws(u,v))kerg(x¯) for some sX and vRm, then we get

122y,g(x¯)[u,u]=ws(u,v),y+v,y=v,y

by Remark 3.3 and g(x¯)y=0, and yND(g(x¯);g(x¯)u) also holds, again by Remark 3.3.

Then (3.13) follows because for yNT(u)(ws(u,0))kerg(x¯), the relation 2y,g(x¯)[u,u]=0 is obtained, and SOSCMS(u) yields y=0.

Next, for arbitrary yNT(u)(ws(u,v))kerg(x¯) with sX and v:=αy for some α0, we get 2y,g(x¯)[u,u]=2v,y=2αy20, so SOSCMS(u) can still be applied to give y=0. Now, we can always take λ:=z since zNT(u)(ws(u,v))ND(g(x¯);g(x¯)u).

We immediately arrive at the following corollary.

Corollary 5.3

The constraint mapping Φ is strongly asymptotically regular at (x¯,0)gphΦ in direction uSX if FOSCMS(u) holds or if Y:=Rm, D is locally polyhedral around g(x¯), 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 g:RR2 and DR2 be given by g(x):=(x,-x2), xR, and D:=(R+×R)(R×R+). Observe that D is a polyhedral set. We consider the constraint map Φ:RR2 given by Φ(x):=g(x)-D, xR. We note that Φ-1(0)=[0,) holds. Hence, fixing x¯:=0, we can easily check that Φ is metrically subregular at (x¯,0) in direction 1 but not in direction -1, i.e., FOSCMS and SOSCMS must be violated.

First, we claim that all the assumptions from Theorem 5.4 are satisfied for u=±1. Taking into account Remark 3.3, it suffices to verify these assumptions for ws(u,v) replaced by 0. Let us fix u=±1, y,zNTD(g(x¯))(g(x¯)u) such that g(x¯)y=0 and 2y,g(x¯)(u)+g(x¯)z=x for xR. We have g(x¯)u=(u,0), 2y,g(x¯)(u)=-2y2u, and

NTD(g(x¯))(g(x¯)u)={0}×R-u=-1,{(0,0)}u=1.

Thus, for u=1, we have y=0 regardless of x. Hence, condition (3.13) holds trivially and we can choose λ:=z to find x=g(x¯)λ as well as λNTD(g(x¯))(g(x¯)u). For u=-1, we get y1=z1=0 and y20. Thus, if x=0, from -2y2u+z1=0 we deduce y2=0, and (3.13) follows. For arbitrary xR, we get x=-2y2u+z1=2y20 and we can choose λ:=(x,0)ND(g(x¯)) to obtain g(x¯)λ=x. Note, however, that (x,0)NTD(g(x¯))(g(x¯)u)={0}×R- unless x=0.

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 xX and yY as well as {uk}kN,{xk}kNX, {vk}kN,{yk}kNY, and {tk}kNR+ which satisfy uku, vkv, tk0, xkx, yky, and

kN:xk,-yk(tkuk)γ-1NgphΦ(x¯+tkuk,y¯+(tkuk)γvk).

By definition of the limiting normal cone, for each kN, we find {xk,}N,{xk,}NX and {yk,}N,{yk,}NY such that xk,x¯+tkuk, yk,y¯+(tkuk)γvk, xk,xk, and yk,yk/(tkuk)γ-1 as and (xk,,-yk,)N^gphΦ(xk,,yk,) for all N.

For each kN, let us define sequences {uk,}NX and {vk,}N,{y^k,}NY by means of

N:uk,:=xk,-x¯tk,vk,:=yk,-y¯(tkuk,)γ,y^k,:=(tkuk,)γ-1yk,.

This gives

N:xk,,-y^k,(tkuk,)γ-1N^gphΦ(x¯+tkuk,,y¯+(tkuk,)γvk,). A.1

Furthermore, we have the convergences uk,uk, vk,vk, and y^k,yk as by construction. Thus, for each kN, we find an index (k)N such that

uk,(k)-uk1k,vk,(k)-vk1k,xk,(k)-xk1k,y^k,(k)-yk1k.

Let us set u~k:=uk,(k), v~k:=vk,(k), x~k:=xk,(k), and y~k:=y^k,(k) for each kN. The above estimates and uku, vkv, xkx, as well as yky give u~ku, v~kv, x~kx, as well as y~ky. Additionally, (A.1) guarantees

kN:x~k,-y~k(tku~k)γ-1N^gphΦ(x¯+tku~k,y¯+(tku~k)γv~k).

By definition of the directional pseudo-coderivative, xDγΦ((x¯,y¯);(u,v))(y), 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 (x¯,y¯) in direction u. Let us fix sequences {(xk,yk)}kNgphΦ, {xk}kNX, and {λk}kNY as well as xX and yY satisfying xkΦ-1(y¯), yky¯, and xkDΦ(xk,yk)(λk) for each kN as well as the convergences (5.1). For each kN, we find sequences {(xk,,yk,)}NgphΦ, {xk,}NX, and {λk,}NY with xk,xk, xk,xk, yk,yk, and λk,λk as as well as xk,D^Φ(xk,,yk,)(λk,) for each N. Observing that Φ-1(y¯) is closed, its complement is open so that xk,Φ-1(y¯) holds for sufficiently large N. Furthermore, since xk-x¯>0 and yk-y¯>0 are valid, we can choose an index (k)N so large such that the estimates

xk,(k)-xk<1kxk-x¯,xk,(k)-xk<1k,yk,(k)-yk<1kyk-y¯,λk,(k)-λk<1k

and xk,(k)Φ-1(y¯) as well as yk,(k)y¯ are valid. For each kN, we set x~k:=xk,(k), x~k:=xk,(k), y~k:=yk,(k), and λ~k:=λk,(k). Clearly, we have x~kx¯, y~ky¯, x~kx, λ~k, {(x~k,y~k)}kNgphΦ, and x~kΦ-1(y¯), y~ky¯, as well as x~kD^Φ(x~k,y~k)(λ~k) for each kN by construction. Furthermore, we find

x~k-x¯xk-x¯-x~k-xkk-1kxk-x¯

for each kN. With the above estimates at hand, we obtain

xk-x¯xk-x¯-x~k-x¯x~k-x¯=xk-x~kxk-x¯+(x~k-x¯)1xk-x¯-1x~k-x¯xk-x~kxk-x¯+x~k-x¯xk-x~kxk-x¯x~k-x¯2k

and

yk-y¯xk-x¯-y~k-y¯x~k-x¯=yk-y~kxk-x¯+(y~k-y¯)1xk-x¯-1x~k-x¯yk-y~kxk-x¯+y~k-y¯xk-x~kxk-x¯x~k-x¯1kyk-y¯xk-x¯+1k-1y~k-yk+yk-y¯xk-x¯1k+1k(k-1)+1k-1yk-y¯xk-x¯=2k-1yk-y¯xk-x¯, A.2

so that, with the aid of (5.1), we find (x~k-x¯)/x~k-x¯u as well as (y~k-y¯)/x~k-x¯0. With the aid of (A.2),

y~k-y¯x~k-x¯λ~k-yk-y¯xk-x¯λky~k-y¯x~k-x¯λ~k-λk+y~k-y¯x~k-x¯-yk-y¯xk-x¯λk1ky~k-y¯x~k-x¯+2k-1yk-y¯xk-y¯λk

is obtained, which gives λ~ky~k-y¯/x~k-x¯y. Similar as above, we find

y~k-y¯y~k-y¯-yk-y¯yk-y¯2k

and

λ~k/λ~k-λk/λk2λk-λ~k/λk2/(kλk),

so that (5.1) gives us

limky~k-y¯y~k-y¯-λ~kλ~k=limkyk-y¯yk-y¯-λkλk=0.

Now, since Φ is asymptotically regular at (x¯,y¯) in direction u, we obtain xImDΦ(x¯,y¯).

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 Inline graphic-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]

Articles from Mathematical Programming are provided here courtesy of Springer

RESOURCES