On estimating the regular normal cone to constraint systems and stationarity conditions
Mat\'u\v{s} Benko, Helmut Gfrerer

TL;DR
This paper introduces two new methods for estimating the regular normal cone in constraint systems and proposes a stronger stationarity concept, enhancing the derivation of necessary optimality conditions in mathematical programming.
Contribution
It presents novel approaches and a new stationarity concept that improve the analysis of constraint systems in optimization.
Findings
Two novel approaches for estimating the regular normal cone
Introduction of a stronger stationarity concept than M-stationarity
Application to three classes of mathematical programs
Abstract
Estimating the regular normal cone to constraint systems plays an important role for the derivation of sharp necessary optimality conditions. We present two novel approaches and introduce a new stationarity concept which is stronger than M-stationarity. We apply our theory to three classes of mathematical programs frequently arising in the literature.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
On estimating the regular normal cone to constraint systems and stationarity conditions††thanks: This is an Accepted Manuscript of an article published by Taylor & Francis in Optimization on 31 October 2016, available online: http://www.tandfonline.com/10.1080/02331934.2016.1252915
Matúš Benko, Helmut Gfrerer Institute of Computational Mathematics, Johannes Kepler University Linz, A-4040 Linz, Austria, [email protected], [email protected]
Abstract
Estimating the regular normal cone to constraint systems plays an important role for the derivation of sharp necessary optimality conditions. We present two novel approaches and introduce a new stationarity concept which is stronger than M-stationarity. We apply our theory to three classes of mathematical programs frequently arising in the literature.
**Key words. **Regular normal cone; B-, M-, S-stationarity; complementarity constraints; vanishing constraints; generalized equations.
**AMS subject classification. ** 49J53 90C46.
1 Introduction
This paper deals with the computation of the regular normal cone to sets of the form
[TABLE]
at some point , where is a mapping continuously differentiable at and is a closed set.
This task is of particular importance for the development of first order optimality conditions of the nonlinear program
[TABLE]
since the basic optimality condition, see e.g. [27, Theorem 6.12], states that the negative gradient of the objective at a local minimizer belongs to the regular normal cone to the constraints at , i.e.
[TABLE]
When is convex, the computation of the regular normal cone is well understood, see e.g. [2]. Under some constraint qualification condition an exact formula reads as
[TABLE]
Quite more complicated is the situation, when is not convex. This occurs for instance, when among the constraints so-called equilibrium constraints are present. Such programs are usually termed mathematical programs with equilibrium constraints (MPEC). The equilibrium can be often described by a lower-level optimization problem, by variational inequalities or by complementarity constraints. Some of these equilibrium constraints can be written as smooth equalities and inequalities, but these constraints usually do not satisfy the common constraint qualifications of nonlinear programming. Alternative formulations yield either a nonsmooth mapping or the system (1) with nonconvex , the case considered in this paper. Prominent examples are mathematical programs with complementarity constraints (MPCC) or mathematical programs with vanishing constraints (MPVC). We refer the reader to the paper [28] for some more examples on this subject.
In case when is not convex, only inclusions for the regular normal cone are known in general. The lower estimate is given by
[TABLE]
and is known to hold with equality, if the Jacobian has full rank, cf. [27, Example 6.7]. When we have equality in (4), the corresponding optimality conditions are usually called S-stationarity (strong stationarity) conditions in the literature on mathematical programs with equilibrium constraints (MPECs). The main drawback of the S-stationarity conditions is the requirement of strong constraint qualification conditions.
If one weakens the used constraint qualification condition then the inclusion (4) will be strict in general. In this situation one has to consider an upper estimate to the regular normal cone . A commonly used upper estimate is provided by the so-called limiting normal cone to at . The use of the limiting normal cone has the advantage, that a lot of calculus rules are available for its calculation; we refer the readers to the textbooks [22, 23, 27]. Optimality conditions based on this upper estimate involving the limiting normal cone are usually called M-stationarity conditions. A main disadvantage of this approach is, that in general the regular normal cone is strictly included in the limiting normal cone. Therefore, in general M-stationarity does not preclude the existence of feasible descent directions.
The aim of this paper is to provide estimates to the regular normal cone which are valid under very weak constraint qualification conditions and are tighter than the one based on the limiting normal cone.
For this purpose we present two new approaches. The first one is motivated by a result due to Pang and Fukushima [24] and yields an upper bound for the regular normal cone which is exact under some suitable assumptions. This upper estimate for the regular normal cone constitutes a new stationarity concept called -stationarity which is shown to be stronger than M-stationarity. We apply this approach to MPCC and improve the result due to Pang and Fukushima [24]. For MPVC we derive a new qualification condition, which resembles the well known Mangasarian Fromovitz constraint qualification (MFCQ) of nonlinear programming, and allows the exact computation of the regular normal cone for MPVC. The obtained results are much stronger than the known results from literature [1, 3, 18, 19, 20, 21]. Finally we analyze MPECs where the constraints are given by a generalized equation (GE) involving the normal cone mapping to inequalities together with parameter constraints. Again we derive upper bounds for the regular normal cone which can be exact under certain conditions and can be employed to replace the commonly used conditions as in [16, Theorem 3.4].
In the second approach treated in this paper we focus on the lower inclusion (4) for the regular normal cone and state a condition which ensures equality. This new condition is an extension of the recent result [10, Theorem 4] and we apply it also to MPECs with an additional parameter constraint.
The paper is organized as follows. In section 2 we present some basic definitions and results from variational analysis together with the definitions of various stationarity concepts. In section 3 we give the theoretical background for the two approaches presented in this paper for estimating the regular normal cone as well as the new concepts of -stationarity and -stationarity, respectively. In sections 4, 5 and 6 we apply the results from section 3 to MPCC, MPVC and an MPEC, respectively.
Our notation is basically standard. stands for the polar to a cone and stands for the subspace generated by the vectors . By we normally denote the Jacobian of the mapping at , but occasionally we use it like a linear mapping to write
[TABLE]
for a set . To ease the notation the Minkowski sum of a singleton and a set is denoted by .
2 Preliminaries
Let us start with geometric objects. Given a set and a point , define the (Bouligand-Severi) tangent/contingent cone to at by
[TABLE]
Note that one has when is a convex polyhedron.
The (Fréchet) regular normal cone to at can be defined as the polar cone to the tangent cone by
[TABLE]
Further, the (Mordukhovich) limiting/basic normal cone to at is given by
[TABLE]
Note that the tangent/contingent cone and the regular normal cone reduce to the classical tangent cone and normal cone of convex analysis, respectively, when the set is convex. We put , if . Note that we always have
[TABLE]
Next we recall some rules for calculating polar cones. For two closed convex cones and we have
[TABLE]
and for closed convex cones , we have
[TABLE]
Proposition 1**.**
Let be an matrix, let be a cone and assume that either there exists some such that or is polyhedral, i.e. is the union of finitely many convex polyhedral cones . Then
[TABLE]
Proof.
In case when there exists some with , the statement follows from [26, Corollary 16.3.2]. Now consider the case when is polyhedral. Then is a convex polyhedral set by [26, Corollary 19.3.2] and so is its polar by [26, Corollary 19.2.2]. By virtue of [26, Theorem 19.3] the set is again convex and polyhedral and now the statement follows from [26, Corollary 16.3.2] by taking into account that convex polyhedral sets are always closed. ∎
Lemma 1**.**
Let be an matrix and let be two sets. Then
[TABLE]
Proof.
If , then there are , with . Since and , the properties and follow. Conversely, if , then there are , and such that and . It follows that and thus . ∎
We now introduce generalizations of the Abadie constraint qualification condition and the Guignard constraint qualification condition, respectively, as known from nonlinear programming.
Definition 1**.**
Let be given by (1) and let .
We say that the generalized Abadie constraint qualification (GACQ) holds at if
[TABLE]
where denotes the linearized cone. 2. 2.
We say that the generalized Guignard constraint qualification (GGCQ) holds at if
[TABLE]
Obviously GGCQ is weaker than GACQ, but GACQ is easier to verify because several advanced methods from variational analysis are available. To this end we need the concepts of metric regularity and metric subregularity of multifunctions.
Definition 2**.**
Let be a multifunction, and . Then
* is called metrically regular with modulus near if there are neighborhoods of and of such that*
[TABLE] 2. 2.
* is called metrically subregular with modulus at if there is a neighborhood of such that*
[TABLE]
It is well known that metric regularity of the multifunction near is equivalent to the Aubin property (also called Lipschitz-like or pseudo-Lipschitz) of the inverse multifunction and metric subregularity of at is equivalent with the property of calmness of its inverse.
Obviously, metric regularity of near implies metric subregularity of at .
Proposition 2** (cf.[14, Proposition 1]).**
Let belong to the set given by (1). If the perturbation mapping
[TABLE]
associated with the constraint system (1) is metrically subregular at , then holds at .
Metric regularity of the mapping (14) can be verified by the so-called Mordukhovich criterion, see, e.g., [27, Example 9.44]. Tools for verifying metric subregularity of constraint systems can be found e.g. in [9].
The following theorem states some fundamental relations between the regular and the limiting normal cone.
Theorem 1**.**
Let be given by (1) and let . Then
[TABLE]
On the other hand, if the multifunction (14) is metrically subregular at then
[TABLE]
If has full rank, then both inclusions (15) and (16) hold with equality.
Proof.
The inclusion (15) can be found in [27, Theorem 6.14], whereas (16) follows from [15, Theorem 4.1]. For the statement on equality in the inclusions we refer to [27, Exercise 6.7]. ∎
At the end of this section we consider different stationarity concepts.
Definition 3**.**
Let be feasible for the program (2), where is given by (1) and is assumed to be smooth.
We say that is B-stationary (Bouligand stationary) if
[TABLE] 2. 2.
We say that is S-stationary (strongly stationary) if
[TABLE] 3. 3.
We say that is M-stationary (Mordukhovich stationary) if
[TABLE]
By the definition of the regular normal cone we have
[TABLE]
at a B-Stationary point, which expresses that no feasible descent direction exists. Every local minimizer is known to be B-stationary. Conversely, if is B-stationary then there exists some smooth mapping with such that is a global minimizer of the problem , cf. [27, Theorem 6.11].
From (15) it is easy to see that every S-stationary point is also B-stationary, but the reverse statement is not true in general, unless we have equality in (15).
On the other hand, a B-stationary point is also M-stationary provided that the perturbation mapping is metrically subregular at . However, M-stationarity does not preclude the existence of feasible descent directions, unless we have .
Since we have by the definition, we derive from Theorem 1 the inclusion
[TABLE]
under the assumption of metric subregularity of (14) at . This relation can be strengthened by the following proposition.
Proposition 3**.**
Let be given by (1), let and assume that GGCQ is fulfilled, while the mapping is metrically subregular at . Then
[TABLE]
Proof.
By virtue of GGCQ we have and since is assumed to be metrically subregular at , we can apply Theorem 1 to obtain . By [27, Proposition 6.27] we have and this finishes the proof. ∎
If is the union of finitely many convex polyhedral cones, then the mapping is a polyhedral multifunction and consequently metrically subregular at by Robinson’s result [25]. Hence we arrive at the following corollary which slightly improves [6, Theorem 7].
Corollary 1**.**
Let be B-stationary for the program (2), where is given by (1) and is assumed to be smooth. If GGCQ is fulfilled at and is the union of finitely many convex polyhedral cones, then is M-stationary and even the stronger condition
[TABLE]
holds.
3 Estimating the regular normal cone
Throughout this section we assume that the set is given by , where is continuously differentiable at the reference point and is closed. Further we assume that the objective of the program (2) is continuously differentiable at and GGCQ holds.
The main goal of this section is to provide a tight estimate for the regular normal cone , which, thanks to GGCQ, amounts to . To this end we discuss two possibilities, the first one being motivated by the paper of Pang and Fukushima [24] is based on the following observation.
Theorem 2**.**
Let and denote two closed convex cones contained in . If
[TABLE]
then
[TABLE]
Further, if
[TABLE]
then equality holds in (18).
Proof.
Since , we have
[TABLE]
and (18) follows from Lemma 1. To show the sufficiency of condition (19) for equality in (18), note that condition (19) together with (18) implies . Now, equality in (18) follows from (15). ∎
The proper choice of and is crucial in order that (18) provides a good estimate for the regular normal cone. It is obvious that we want to choose the cones , as large as possible in order that the inclusion (18) is tight. Further it is reasonable that a good choice of fulfills
[TABLE]
because then condition (19) holds whenever has full rank.
Since , we have , and consequently, . Hence the inclusion (19) can never be strict.
The following definition is motivated by Theorem 2.
Definition 4**.**
Let denote some collection of pairs of closed convex cones fulfilling
[TABLE]
(i)* Given we say that is -stationary with respect to for the program (2), if*
[TABLE]
(ii)* We say that is -stationary for the program (2), if is -stationary with respect to some pair .*
(iii)* We say that is -stationary, if there exists a pair such that*
[TABLE]
The following corollary follows immediately from the definitions and Theorem 2.
Corollary 2**.**
Assume that is B-stationary for the program (2). Then is -stationary with respect to every pair . Conversely, if is -stationary with respect to some pair fulfilling condition (19), then is S-stationary and consequently, also B-stationary.
The following lemma follows immediately from (18) and the definition of -stationarity.
Lemma 2**.**
Let . Then is -stationary with respect to for the program (2) if and only if , .
Corollary 3**.**
Let be S-stationary for the program (2). Then is -stationary with respect to every .
Proof.
Since , we have , . Hence S-stationarity of implies
[TABLE]
and the assertion follows from Lemma 2.
∎
Remark 1**.**
Note that for the program
[TABLE]
is a convex program and therefore the first-order optimality condition
[TABLE]
is both necessary and sufficient in order that is a solution of . Hence is -stationary with respect to if and only if [math] is a solution for the programs and , respectively.
By the definition, a -stationary point is both M-stationary and -stationary. However, a B-stationary point is -stationary only under some additional condition. This is due to the fact that under the assumptions of Theorem 1 we have
[TABLE]
but in general
[TABLE]
Clearly, equality holds when possesses full row rank, but in this case a B-stationary point is already S-stationary. In the following theorem we state three more sufficient conditions ensuring stationarity of a B-stationary point.
Theorem 3**.**
Assume that is B-stationary for the program (2). Then is -stationary if any of the following three conditions holds:
There exists a pair such that
[TABLE] 2. 2.
* is M-stationary and for every there is some pair with * 3. 3.
* is the union of finitely many convex polyhedral sets and for every there is some pair satisfying .*
Proof.
Under the condition (22), -stationarity of follows immediately from the definition and Corollary 2. Let us prove the second case. Since is M-stationary, there exists some verifying and by the assumption there is some with implying -\nabla f(\bar{x})\in\nabla F(\bar{x})^{T}\big{(}Q_{1}^{\circ}\cap N_{D}(F(\bar{x}))\big{)}. By using that is B-stationary and therefore also -stationary with respect to by Corollary 2, by virtue of Lemmas 2 and 1 we obtain
[TABLE]
showing -stationarity of . Now let us prove the sufficiency of the third condition. By Corollary 1 there is some with and by using [7, Lemma 3.4], we can find some with . Our assumption guarantees that there is some pair with and therefore by convexity of . By [27, Proposition 6.27] we obtain and the same arguments as used just before yield (23) showing -stationarity of . ∎
We summarize the relations between the various stationarity concepts in the following picture.
[TABLE]
Below we will work out the concepts of - and -stationarity for the special cases of mathematical programs with complementarity constraints, vanishing constraints and constraints involving a generalized equation, respectively, and in the first two cases we will present explicit expressions for the pair establishing -stationarity.
Now we consider another possibility to estimate the regular normal cone to , which is an enhancement of the approach used in the recent paper [10]. For every nonempty convex cone we define
[TABLE]
i.e. is the collection of all such that there are and with
[TABLE]
Further we define
[TABLE]
It is easy to see that both and are cones, that is convex and that .
Theorem 4**.**
For every nonempty convex cone satisfying
[TABLE]
there holds
[TABLE]
Proof.
We first show the inclusion . Let be arbitrarily fixed. In order to show we have to prove . Consider any . Since , can be represented as convex combination of elements , with coefficients , . By the definition of the set we can find for each , elements and such that
[TABLE]
By taking into account that by GGCQ, we obtain . Further we have
[TABLE]
and therefore
[TABLE]
Since is assumed to be convex, we conclude and hence, by using (24), we can argue . This yields
[TABLE]
and, since was arbitrary, we derive the claimed inclusion . In order to show the reverse inclusion consider . Then for arbitrary we have
[TABLE]
showing and . Hence, and, because was chosen arbitrarily, we conclude by GGCQ, and follows. ∎
Remark 2**.**
Condition (24) is in particular fulfilled, if .
Of course, in practice it is a difficult task to compute . In practical applications, for given we try to find a cone and then apply Proposition 1 to obtain
[TABLE]
provided there exists some with or is polyhedral. Using (26) we obtain the following corollary from Theorem 4.
Corollary 4**.**
Assume that there exists some convex cone fulfilling (24) and some cone such that and either there is some with or is polyhedral. Then
[TABLE]
Proof.
Using (15), Theorem 4 and (26) together with the assumptions of the corollary we obtain
[TABLE]
and the assertion follows. ∎
4 Application to MPCC
In this section we consider a mathematical program with complementarity constraints (MPCC) of the form
[TABLE]
where , , , and are assumed to be continuously differentiable. There are several possibilities to write the constraints of (4) in the form (1), we use here the formulation with
[TABLE]
where
[TABLE]
In what follows we denote the feasible set of (4) by . Given a feasible point we introduce the following index sets of constraints active at :
[TABLE]
Straightforward calculations yield that
[TABLE]
with ,
[TABLE]
and consequently is the collection of all fulfilling the system
[TABLE]
Further we have
[TABLE]
Note that GACQ for MPCC is equivalent to MPEC-ACQ as introduced by Flegel and Kanzow [4]. Similarly, GGCQ for MPCC ie equivalent to MPEC-GCQ [5].
In order to apply Theorem 2 and the concept of -stationarity we define for every partition of the biactive index set the convex polyhedric cone
[TABLE]
where if and
[TABLE]
Lemma 3**.**
For every partition the pair consists of two closed convex cones fulfilling (21) and (20).
Proof.
It is easy to see that both cones , are closed convex polyhedral cones fulfilling and by using Proposition 1 we conclude that \big{(}\nabla F(\bar{x})^{-1}Q_{j}\big{)}^{\circ}=\nabla F(\bar{x})^{T}(Q_{j})^{\circ}. There remains to show that . Since for every we have and for every we have by the definition, we obtain from (8) that
[TABLE]
and the lemma is proved. ∎
It is easy to see that is the union taken over all partitions of the cones and therefore \widehat{N}_{D}(F(\bar{x}))=\bigcap_{(\beta_{1},\beta_{2})\in{\cal P}(I^{00})}\big{(}Q_{CC}^{\beta_{1},\beta_{2}}\big{)}^{\circ}. We have shown in Lemma 3 that this intersection of many polar cones can be replaced by the intersection of two polar cones . Since
[TABLE]
and under the assumption of GGCQ
[TABLE]
we expect that the replacement of the intersection of the many cones \nabla F(\bar{x})^{T}\big{(}Q_{CC}^{\beta_{1},\beta_{2}}\big{)}^{\circ} by the intersection of two cones can result in a tight inclusion which can be even exact under some reasonable assumptions.
Note that
[TABLE]
In the sequel we will use the sets of multipliers
[TABLE]
and
[TABLE]
Note that
[TABLE]
and
[TABLE]
We now apply Theorem 2 to estimate the regular normal cone of the MPCC (4).
Proposition 4**.**
Let belong to the feasible region of the MPCC (4) and assume that GGCQ is fulfilled at . Then for every partition of the index set we have
[TABLE]
where
[TABLE]
Proof.
We apply (18) with . All we have to show is the equation (38). Obviously we have and the set consists of all such that there exists and some such that
[TABLE]
We proceed with an analysis of the different cases:
Equality constraints: We obtain , , , i.e., . 2. 2.
Inequality constraints: For we have , or equivalently , whereas for we obtain which yields . 3. 3.
: Since , we obtain and consequently also . 4. 4.
: Similarly as in the previous case we obtain . 5. 5.
: Since , we have
[TABLE]
and . This can be written equivalently as , . 6. 6.
: Similarly as in the previous case we obtain , .
We see that and the claimed result follows from (18). ∎
Theorem 5**.**
Let belong to the feasible region of the MPCC (4) and assume that GGCQ is fulfilled at . Further assume that there is some partition of the index set such that for every we have
[TABLE]
Then
[TABLE]
Proof.
Due to (38), (33) and Theorem 2 we only have to show that (19), i.e.
[TABLE]
holds. Consider . Then we have the representation
[TABLE]
with . If for every and for every , then the claimed inclusion follows from (31). Otherwise, either there is some such that or some such that . We consider first the case when for some . Take the element associated with according to (38) and set . Then
[TABLE]
and
[TABLE]
by virtue of (38). Further, since we deduce by the assumptions of the theorem that , and consequently , . Therefore and holds for every and follows. Similar arguments can be applied in the alternative situation when there exists some with . ∎
Let us compare our approach with the results of Pang and Fukushima [24]. In [24] the authors try to detect certain redundancies in the description of the linearized tangent cone and then analyze an equivalent representation of the linearized cone. In this paper we treat only so-called (non)singular inequalities, a more general approach goes beyond the scope of this work.
Given a linear system
[TABLE]
an inequality is said to be nonsingular if there exists a feasible solution of this system which satisfies this inequality strictly. Here denotes the i-th row of the matrix . An inequality is called singular if it is not nonsingular.
Let us denote by the set of all fulfilling the linear system
[TABLE]
which is obtained from (29) by relaxing the complementarity condition. Obviously we have .
Now let denote the set consisting of all indices such that the inequality is nonsingular in the system (39). Similarly, we denote by the nonsingular set pertaining to the inequalities . For notational convenience we introduce also the set .
Using the set we arrive at the following description of the linearized cone:
[TABLE]
This can be seen from the fact that every belonging to the set on the right hand side of (40) also belongs to and therefore for every either the inequality or the inequality is singular and consequently fulfilled with equality, implying that complementarity holds. Now the representation (40) of the linearized cone has the same structure as the original representation (29) and we can apply Theorem 5 to (40) in order to obtain the following corollary.
Corollary 5**.**
Let belong to the feasible region of the MPCC (4) and assume that GGCQ is fulfilled at . Further assume that there is some partition of the index set such that for every there holds
[TABLE]
Then
[TABLE]
Proof.
The representation (40) has the form with
[TABLE]
and from Theorem 5 we obtain . It is easy to see that and thus the assertion follows. ∎
The statement of Corollary 5 was shown in [24, Theorem 2] under the assumption (A3), which reads in our notation that there exists a partition of the index set such that for every one has
[TABLE]
Since and , our assumption (41) is not stronger than assumption (A3) used by Pang and Fukushima [24]. In case when or our assumption (41) is actually weaker, as the following example demonstrates.
Example 1**.**
Consider the system
[TABLE]
at . Since all constraint functions are linear, GACQ is fulfilled, cf. also [4, Theorem 3.2], and consequently GGCQ holds as well. It is easy to see that and and therefore condition (41) amounts to
[TABLE]
Since (43) is equivalent to , , (47) holds with any of the two partitions and and therefore Corollary 5 is applicable. On the other hand, condition (42) reads as
[TABLE]
Taking we obtain that for the partition the condition is violated, whereas in case when the inequality fails to hold. Thus [24, Assumption (A3)] does not hold for this example and therefore the assumption used in our Corollary 5 is strictly weaker.
We introduce now the following stationarity concepts for MPCC which correspond to Definition 4 with , where
[TABLE]
Note that there is a one-to-one correspondence between the sets and partitions of the biactive index set
Definition 5**.**
Let .
We say that is -stationary for the MPCC (4) with respect to the partition of the index set if
[TABLE]
where is given by (33). 2. 2.
*We say that is -stationary for the MPCC (4) * if it is -stationary with respect to some partition of the index set . 3. 3.
We say that is -stationary for the MPCC (4) if there is some partition of such that
[TABLE]
Theorem 6**.**
Assume that GGCQ is fulfilled at the point . If is B-stationary, then is -stationary for the MPCC (4) with respect to every partition of and it is also stationary. Conversely, if is -stationary with respect to a partition of , which fulfills also the assumptions of Theorem 5, then is S-stationary and consequently B-stationary.
Proof.
In view of the definitions of B-stationarity and S-stationarity together with Proposition 4 and Theorem 5 there is only to show the assertion about -stationarity. This follows easily from Theorem 3(3.) because is the union of finitely many convex polyhedral cones generating the collection . ∎
Remark 3**.**
Given a multiplier verifying the M-stationarity condition we can use the partition defined by
[TABLE]
for testing on -stationarity, because this choice ensures \lambda\in\big{(}Q^{\beta_{1},\beta_{2}}_{CC}\big{)}^{\circ}. The computation of such a multiplier can be done by means of the algorithm presented in the proof of [8, Theorem 4.3].
We see that -stationarity is a first order necessary condition for being a local minimizer, provided GGCQ is fullfilled, which is to be considered as a very weak constraint qualification. In order to verify -stationarity, only a system of linear equalities and linear inequalities has to be solved, but the main difference to the usual first-order optimality conditions is, that a second multiplier is involved.
Note that postulating GGCQ in our problem setting is equivalent to MPEC-GCQ as given in [5]. It was shown in [5] that under MPEC-GCQ any B-stationary point of MPCC is M-stationary. Theorem 6 improves this result by stating that even -stationarity holds.
Let us now turn our attention to the case when the gradients of the constraints active at the point ,
[TABLE]
are linearly independent. This constraint qualification is usually named MPEC-LICQ in the literature. Then we obviously have and therefore the assumptions of Theorem 5 hold. Hence, under MPEC-LICQ -stationarity automatically implies S-stationarity and B-stationarity. This is remarkable because M-stationarity does not have this property: Under MPEC-LICQ an M-stationary point is neither S-stationary nor B-stationary in general. However, in case when MPEC-LICQ does not hold, there also exist examples where a -stationary point is not M-stationary and therefore neither M-stationarity implies -stationarity nor vice versa. However, the following example shows that -stationarity is strictly stronger than M-stationarity.
Example 2**.**
(cf.[8, Example 3]) Consider the MPCC
[TABLE]
Then is not a local minimizer because for every the point is feasible and . GACQ is fulfilled because all constraints are linear and the linearized cone amounts to
[TABLE]
Straightforward calculations yield that is M-stationary and is the unique multiplier fulfilling the M-stationarity conditions. However, we will now show that is not -stationary. Assuming that is -stationary, by taking , , there would exist some verifying
[TABLE]
But a solution of this system must fulfill
[TABLE]
which is obviously not possible. On the other hand, if we take , then . Hence is not -stationary and we have demonstrated that -stationarity is a stronger property than M-stationarity.
5 Application to MPVC
In this section we consider a mathematical program with vanishing constraints (MPVC) of the form
[TABLE]
where , , , and are assumed to be at least continuously differentiable. To transform the constraints into the format (1) we use
[TABLE]
where
[TABLE]
Now we denote the feasible region of (53) by and we introduce the following index sets of constraints active at a feasible point :
[TABLE]
Straightforward calculations yield that
[TABLE]
with ,
[TABLE]
and consequently, is the collection of all fulfilling the system
[TABLE]
Further note that , and , .
Similar to MPCC we define for every partition of the set the cone
[TABLE]
where if and
[TABLE]
Lemma 4**.**
For every partition the pair consists of two closed convex cones fulfilling (21) and (20).
Proof.
The proof follows the same lines as the proof of Lemma 3 and is therefore omitted. ∎
Similar to the case of MPCC we have
[TABLE]
Consider the following two sets of multipliers,
[TABLE]
and
[TABLE]
Note that
[TABLE]
and
[TABLE]
Proposition 5**.**
Let belong to the feasible region of the MPVC (53) and assume that GGCQ is fulfilled at . Then for every partition of the index set we have
[TABLE]
where
[TABLE]
Proof.
We can proceed similarly to the proof of Proposition 4. We have and the set consists of all such that there exists and some such that
[TABLE]
Similar as in the proof of Proposition 4 this yields
[TABLE]
Now consider . Then and . Hence
[TABLE]
and , or equivalently
[TABLE]
In case that we have and ,
[TABLE]
and , which is equivalent to
[TABLE]
These arguments show that has the claimed representation and the assertion follows from (18). ∎
In the following theorem we give a sufficient condition for equality in (5).
Theorem 7**.**
Let belong to the feasible region of the MPVC (53) and assume that GGCQ is fulfilled at . Further assume that there is a partition of such that
[TABLE]
Then
[TABLE]
Proof.
Under the assumption of the theorem we conclude that
[TABLE]
Now the claimed result follows from Theorem 2 together with Proposition 5 by taking . ∎
Next we establish an equivalent formulation of condition (58).
Lemma 5**.**
Let be a partition of . Then the following statements are equivalent:
- (i)
Condition (58) is fulfilled. 2. (ii)
For every there exists some such that
[TABLE]
and there is some such that
[TABLE]
Proof.
Condition (58) is fulfilled if and only if for every the linear program
[TABLE]
has a solution and the linear program
[TABLE]
has a solution. Since the feasible regions of these linear programs are not empty, by duality theory of linear programming this is equivalent to the statement that the feasible regions of the corresponding dual programs are not empty. Since the feasible regions of the dual programs to (61) and (62), respectively, are given by (59) and (60), respectively, the two statements (i) and (ii) are equivalent. ∎
The characterization of condition (58) by Lemma 5 resembles the well-known Mangasarian-Fromovitz constraint qualification of nonlinear programming. It appears to be not very restrictive, e.g. in case when , condition (58) is fulfilled when the system
[TABLE]
has a solution. Hence we think that Theorem 7 is likely to be applicable in many situations.
At the end of this section we consider -stationarity for MPVC with respect to , where
[TABLE]
Definition 6**.**
Let .
We say that is -stationary for the MPVC (53) with respect to the partition of the index set if
[TABLE]
where is given by (5). 2. 2.
*We say that is -stationary for the MPVC (53) * if it is -stationary with respect to some partition of the index set . 3. 3.
We say that is -stationary for the MPVC (53) if there is some partition of such that
[TABLE]
It follows from the definition that
[TABLE]
Hence, if is -stationary with respect to , it is automatically -stationary and the following theorem follows from Proposition 5, Theorem 7 and Theorem 3(1.).
Theorem 8**.**
Assume that GGCQ is fulfilled at the point . If is B-stationary, then is -stationary for the MPVC (53) with respect to every partition of and, in particular, it is stationary with respect to the partition implying stationarity. Conversely, if is -stationary with respect to a partition of , which fulfills also the assumptions of Theorem 7, then is S-stationary and consequently B-stationary as well.
Further we have
[TABLE]
It was stated in [1, Theorem 4] that, under some weak constraint qualification, the condition is a necessary condition for a local minimizer. Hence, if is -stationary with respect to , then it fulfills also the necessary conditions of [1, Theorem 5.3]. From Lemma 2 we obtain that is -stationary with respect to , if and only if it -stationary with respect to . Hence we conclude, that -stationarity with respect to implies both -stationary and the necessary optimality conditions of [1, Theorem 4].
Finally note that GGCQ for MPVC is equivalent to the condition MPVC-GCQ introduced in [17], where it is also shown in [17, Theorem 6.1.8] that under MPVC-GCQ any B-stationary point of MPVC is already M-stationary.
6 Application to generalized equations
Now we consider the problem
[TABLE]
where the mappings , are assumed to be continuously differentiable, is a closed subset of and the set is given by inequalities, i.e. , where is twice continuously differentiable. The constraints fit into our general setting (1) with
[TABLE]
We denote the feasible region of (63) by . We consider a point , fixed throughout this section, and we suppose the following assumptions:
Assumption 1**.**
The tangent cone is convex and . 2. 2.
GGCQ holds at . 3. 3.
There is some such that
[TABLE]
i.e. MFCQ holds at .
The first assumption is e.g. fulfilled if is given by -inequalities and MFCQ is fulfilled at . Note that the third assumption, that MFCQ holds at , is only made in order to ease the presentation. We claim that it can be weakened to the weaker assumption of metric regularity in the vicinity of (cf. [10]) or metric subregularity and the bounded extreme point property as used in the recent paper [11].
In what follows we set and we define by
[TABLE]
the set of Lagrange multipliers associated with and by
[TABLE]
the critical cone to at with respect to . Thanks to the assumed MFCQ for the inequalities describing we have , and that is compact. Note that we do not require that the gradients , are linearly independent and hence the set can contain more than one element.
Given a multiplier we introduce the index sets
[TABLE]
Apart from them we will be working with
[TABLE]
By convexity of the set a multiplier verifying exists. Further we have
[TABLE]
Indeed, if there would exist numbers , violating (65), then, by setting
[TABLE]
with sufficiently small, we would obtain the contradiction that is strictly contained in .
Note that , cf. [10, Lemma 2] and therefore .
For a direction we further introduce the directional multiplier set
[TABLE]
Application of [27, Exercise 13.17, Corollary 13.43(a)] (see also [10, Theorem 1]) yields the representation
[TABLE]
A description of the regular normal cone can be found in [10, Theorem 2].
In general the structure of the tangent cone (66) is rather complicated. E.g., it is not known whether it always can be represented as the union of finitely many convex polyhedral cones or whether Assumption 1 is sufficient for M-stationarity of a B-stationary point.
In the following theorem we state a sufficient condition that the formula is valid, i.e., that S-stationarity holds at provided it is B-stationary. We denote by the lineality space of , i.e. the largest linear space contained in . Since is a closed convex cone by our assumption, we have .
Theorem 9**.**
Assume that Assumption 1 holds and that for every , every and every verifying
[TABLE]
one has
[TABLE]
Further suppose that there exist some , , and some reals , such that
[TABLE]
Then one has
[TABLE]
Proof.
By Assumption 1 we obtain that
[TABLE]
and, together with (66), that is a convex cone contained in . We shall apply Corollary 4 with this cone by showing that and that there is some such that . In a first step we show , i.e. we prove that for every there is some and some such that
[TABLE]
Let be arbitrarily fixed and let with and .
Denoting by the matrix, whose rows are given by , , we obtain from (67) that
[TABLE]
Hence there is some and some such that . Setting , , and and taking into account that and that is exactly the lineality space of , we have , and
[TABLE]
Thus
[TABLE]
verifying (70), and therefore holds.
In order to show that there are such that , we observe first that
[TABLE]
where and . Indeed, by Assumption 1 and (66) it can be easily seen that and by convexity of the inclusion
[TABLE]
readily follows. On the other hand we have implying and, together with the fact that is a convex cone, the reverse inclusion
[TABLE]
follows as well and the validity of (73) is shown.
Now consider . Then there are nonnegative coefficients , , and elements such that . Then, by proceeding as before, for every we can find and such that
[TABLE]
By setting , , , , , we obtain
[TABLE]
Since by [26, Theorem 6.6], , and , we conclude
[TABLE]
Further, since , and is a cone, we obtain . Thus, by taking into account [26, Corollary 6.6.2],
[TABLE]
and this finishes the proof. ∎
Remark 4**.**
Theorem 9 improves [10, Theorem 5], where the assumption
[TABLE]
is used. Note that this assumption is equivalent to \{0\}^{m}=(\mathop{\rm span\,}\limits\{\nabla g_{i}(\bar{x})\,|\,i\in\bar{I}^{+}\})^{\perp}\cap\big{(}\nabla_{x}G(\bar{x},\bar{y})({\rm lin\,}T_{C}(\bar{x}))\big{)}^{\perp} and thus the only element with , and is and therefore (67) trivially holds. Further, this assumption also implies (68), because for arbitrary and , , we can find and , with and now (68) follows with , .
Next we consider -stationarity for the problem (63) under an additional assumption which allows a simplified description of the contingent cone as stated in [10, Theorem 3].
Theorem 10**.**
Assume that Assumption 1(3.) holds at . Further assume that and let be an arbitrary multiplier from for some , if and otherwise. Then
[TABLE]
and
[TABLE]
The assumption is for instance fulfilled, if the inequalities fulfill the constant rank constraint qualification at , see e.g. [13, Corollary 3.2].
In what follows we will assume that the assumptions of Theorem 10 hold and that the tangent cone is a convex polyhedral cone. For every index set we define the convex polyhedral cone
[TABLE]
where
[TABLE]
Then we have
[TABLE]
and
[TABLE]
It is easy to see that under the assumptions of Theorem 10 we have
[TABLE]
and thus
[TABLE]
Note that for every pair the cones fulfill (21) because they are convex polyhedral cones.
Proposition 6**.**
Let and assume in addition to Assumption 1 that the contingent cone is polyhedral and . Then for every pair we have
[TABLE]
where
[TABLE]
and is an arbitrarily fixed multiplier from for some , if and otherwise.
Proof.
The statement follows immediately from Theorem 2 if we can show
[TABLE]
Consider an element . Then there are elements and such that
[TABLE]
Since
[TABLE]
we obtain and thus verifying (86e). The relations (86a) and (86b) follow simply from the representation of . By using the representations with , , it follows that
[TABLE]
Since , we have
[TABLE]
where , showing (86d). By taking into account , we obtain together with (89) that (86c) also holds. Hence, belongs to the set and the inclusion follows.
To show the reverse inclusion consider together with according to the definition. By setting , , it follows, by using the same arguments as above, that and . Since we obviously have , we obtain and this finishes the proof. ∎
Theorem 11**.**
Assume that the assumptions of Proposition 6 are fulfilled and assume that we are given a partition of such that the following two conditions are fulfilled:
(i)* For every there are , , and with*
[TABLE]
(ii)* For every there are , , and with*
[TABLE]
Then
[TABLE]
Proof.
In view of Theorem 2 and Proposition 6 the statement follows if we can show . This inclusion holds true if for every , fulfilling the system
[TABLE]
we have , and , because then we have , , and thus the triple with also belongs to .
The first condition , is equivalent to the requirement that for every the optimization problem
[TABLE]
has a solution. Since the tangent cone is assumed to be convex polyhedral, so also is the regular normal cone and therefore this program can be written as a linear program for which obviously the trivial solution is feasible. Hence, by the duality theory of linear programming the program (91) has a solution, if and only if its dual program has a feasible solution, i.e. there are multipliers , , , , , , , , and such that
[TABLE]
Hence and by (65) we obtain , and , . Now it is easy to see that the dual program to (91) is feasible if and only if condition (i) is fulfilled.
The second requirement , is equivalent to the condition that for every the program
[TABLE]
has a solution. Using similar arguments as above we obtain that this is equivalent with the existence of multipliers , , , , , , and verifying
[TABLE]
and it is easy to see that this is equivalent to condition (ii). ∎
In order to introduce a suitable -stationarity concept for generalized equations, let us define
[TABLE]
and
[TABLE]
Note that if a subset does not belong to , then the set fulfills and . It follows that and consequently . Since we want to consider closed convex cones which are as large as possible, we can discard from our analysis.
It follows immediately from the definition that . Further, by [10, Lemma 2] we have .
In contrast to MPCC and MPVC the condition does not hold automatically for every pair , but it holds for instance for the pair .
Definition 7**.**
Let .
We say that is -stationary for the program (63) with respect to the pair satisfying if
[TABLE]
where is given by (85). 2. 2.
We say that is -stationary for the program (63) if it is -stationary with respect to some pair with . 3. 3.
We say that is -stationary for the program (63) if there is some pair with such that
[TABLE]
By using Proposition 6, Theorem 11 and Theorem 3(3.) we obtain the following Theorem.
Theorem 12**.**
Assume that the assumptions of Proposition 6 hold at the B-stationary point . Then is -stationary with respect to every pair with and is also -stationary. Conversely, if is -stationary with respect to some pair fulfilling the assumptions of Theorem 11, then is S-stationary and consequently B-stationary as well.
Acknowledgements
The research was supported by the Austrian Science Fund (FWF) under grant P26132-N25. The authors would like to express their gratitude to the reviewers for their careful reading and numerous important suggestions.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] W. Achtziger, C. Kanzow , Mathematical programs with vanishing constraints: Optimality conditions and constraint qualifications , Math. Program., 114 (2008), pp. 69–99.
- 2[2] J. F. Bonnans, A. Shapiro , Perturbation analysis of optimization problems , Springer, New York, 2000.
- 3[3] D. Dorsch, V. Shikhman, O. Stein , Mathematical programs with vanishing constraints: critical point theory , J. Glob. Optim., 52 (2012), pp. 591–605.
- 4[4] M. L. Flegel, C. Kanzow , An Abadie-type constraint qualification for mathematical programs with equilibrium constraints , J. Optim. Theory Appl., 124 (2005), pp. 595–614.
- 5[5] M. L. Flegel, C. Kanzow , A direct proof for M-stationarity under MPEC-GCQ for mathematical programs with equilibrium constraints, in Optimization with Multivalued Mappings: Theory, Applications and Algorithms, S. Dempe and V. Kalashnikov, eds., Springer, New York, NY, 2006, pp. 111–122.
- 6[6] M. L. Flegel, C. Kanzow, J. V. Outrata , Optimality conditions for disjunctive programs with application to mathematical programs with equilibrium constraints , Set-Valued Anal., 15 (2007), pp. 139–162.
- 7[7] H. Gfrerer , On directional metric subregularity and second-order optimality conditions for a class of nonsmooth mathematical programs , SIAM J. Optim., 23 (2013), pp. 632–665.
- 8[8] H. Gfrerer , Optimality conditions for disjunctive programs based on generalized differentiation with application to mathematical programs with equilibrium constraints , SIAM J. Optim., 24 (2014), pp. 898–931.
