Characterization of tilt stability via subgradient graphical derivative with applications to nonlinear programming
Nguyen Huy Chieu, Le Van Hien, Tran T.A. Nghia

TL;DR
This paper introduces a new way to characterize tilt stability in finite-dimensional optimization problems using the subgradient graphical derivative, providing second-order conditions and applications to nonlinear programming.
Contribution
It offers a novel characterization of tilt stability via the subgradient graphical derivative and applies it to nonlinear programming under metric subregularity.
Findings
Characterization of tilt-stable local minimizers using subgradient graphical derivative.
Second-order conditions for tilt stability in nonlinear programming.
Stationary points satisfying strong second-order conditions are tilt-stable.
Abstract
This paper is devoted to the study of tilt stability in finite dimensional optimization via the approach of using the subgradient graphical derivative. We establish a new characterization of tilt-stable local minimizers for a broad class of unconstrained optimization problems in terms of a uniform positive definiteness of the subgradient graphical derivative of the objective function around the point in question. By applying this result to nonlinear programming under the metric subregularity constraint qualification, we derive a second-order characterization and several new sufficient conditions for tilt stability. In particular, we show that each stationary point of a nonlinear programming problem satisfying the metric subregularity constraint qualification is a tilt-stable local minimizer if the classical strong second-order sufficient condition holds.
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.
CHARACTERIZATION OF TILT STABILITY VIA SUBGRADIENT GRAPHICAL DERIVATIVE WITH APPLICATIONS TO NONLINEAR PROGRAMMING
Nguyen Huy Chieu111Institute of Natural Sciences Education, Vinh University, Nghe An, Vietnam; email: [email protected]. , Le Van Hien222Department of Natural Science Teachers, Ha Tinh University, Ha Tinh, Vietnam; email: [email protected]., Tran T.A. Nghia333Department of Mathematics and Statistics, Oakland University, Rochester, MI 48309, USA; email: [email protected].
Abstract
This paper is devoted to the study of tilt stability in finite dimensional optimization via the approach of using the subgradient graphical derivative. We establish a new characterization of tilt-stable local minimizers for a broad class of unconstrained optimization problems in terms of a uniform positive definiteness of the subgradient graphical derivative of the objective function around the point in question. By applying this result to nonlinear programming under the metric subregularity constraint qualification, we derive a second-order characterization and several new sufficient conditions for tilt stability. In particular, we show that each stationary point of a nonlinear programming problem satisfying the metric subregularity constraint qualification is a tilt-stable local minimizer if the classical strong second-order sufficient condition holds.
Key words. Tilt stability, subgradient graphical derivative, characterization, metric subregularity constraint qualification, nonlinear programming
2010 AMS subject classification. 49J53, 90C31, 90C46
1 Introduction
Tilt stability is a property of local minimizers guaranteeing the minimizing point shifts in a Lipschitzian manner under linear perturbations on the objective function of a optimization problem, which is a desired behavior in optimization from both theoretical and numerical viewpoints. This notion was introduced by Poliquin and Rockafellar [37] for problems of unconstrained optimization with extended-real-valued objective function. As usual, incorporating constraints into the objective function via the indicator function of the feasible set, one can speak of tilt stability for constrained optimization problems. Tilt stability is basically equivalent to uniform second-order growth condition as well as strong metric regularity of the subdifferential [4, 9, 28]. These properties have been intensively studied in the recent years; see [9, 11, 12, 21, 22, 28, 31, 34].
The first characterization of tilt-stability using second-order generalization differentiation was due to Poliquin and Rockafellar [37]. In that paper they proved that for an unconstrained optimization problem, under mild assumptions of prox-regularity, a stationary point is a tilt-stable local minimizer if and only if the second-order limiting subdifferential/generalized Hessian in the sense of Mordukhovich [26] is positive-definite at the point in question. Furthermore, using this result together with a formula of Dontchev and Rockafellar [7] for the second-order limiting subdifferential of the indicator function of polyhedral convex set, they obtained a second-order characterization of tilt-stability for nonlinear programming problems with linear constraints [37, Theorem 4.5]. The main difficulty in applying the tilt-stability characterization of Poliquin and Rockafellar [37] to other nonlinear constrained optimization problems is the computation/estimation of the second-order subdifferential in terms of explicit problem data.
By establishing new second-order subdifferential calculi, Mordukhovich and Rockafellar [34] derived second-order characterizations of tilt-stable minimizers for some classes of constrained optimization problems. Among other important things, they showed that for -smooth nonlinear programming problems, under the linear independence constraint qualification (LICQ), a stationary point is a tilt-stable local minimizer if and only if the strong second-order sufficient condition (SSOSC) holds. Consequently, in this setting, tilt-stability is equivalent to Robinson’s strong regularity [39] of the associated Karush-Kuhn-Tucker system whenever LICQ occurs at the point in question. In contrast to Robinson’s strong regularity, tilt stability does not postulate LICQ as a necessary condition. This observation motivated the study of tilt-stability for nonlinear programming under constraint qualifications weaker than LICQ, aiming to cover a broader class of examined problems.
Under the validity of both the Mangasarian-Fromovitz constraint qualification (MFCQ) and the constant rank constraint qualification (CRCQ), Mordukhovich and Outrata [31] proved that SSOSC is a sufficient condition for a stationary point to be a tilt-stable local minimizer in nonlinear programming. In [28] Mordukhovich and Nghia showed that SSOSC is indeed not a necessary condition for tilt stability and then introduced the uniform second-order sufficient condition (USOSC) to characterize tilt stability when both MFCQ and CRCQ occur. Recently, Gfrerer and Mordukhovich [12] obtained some pointbased second-order sufficient conditions for tilt-stable local minimizers under some weak conditions including the so-called metric subregularity constraint qualification (MSCQ) and the bounded extreme point property (BEPP). Furthermore, some pointbased second-order characterizations of tilt-stability were established in [12] under certain additional assumptions. We also note that the approach of using a uniform positive definiteness of the combined second-order subdifferential by Mordukhovich and Nghia [28] is an essential tool for the analysis done in [12]. For more information on the recent literature on tilt stability in nonlinear programming, we refer the reader to [12, 28, 31, 35] and the references therein.
The approach of this paper is different from those in the aforementioned references. We mainly use the subgradient graphical derivative of an extended-real-valued function, which is the graphical derivative of its limiting subdifferential [40], to characterize tilt stability and extend to the case of nonlinear programming. In fact, the subgradient graphical derivative and the second-order subdifferential are generally independent concepts; however, under additional conditions, the value of the subgradient graphical derivative can be identified with a subset of the value of the second-order subdifferential; see [40, 41]. We note that one of the biggest advantages of this approach is the workable computation of the graphical derivative in various important cases under very mild assumptions in initial data; see [5, 14, 15, 33]. Furthermore, several results on tilt stability, e.g. in [12], were established based on the calculation of the subgradient graphical derivative as a mediate step. These observations indeed lead us to the following natural questions:
Is it possible to use the subgradient graphical derivative to characterize tilt stability of local minimizers for unconstrained optimization problem? If yes, is such a characterization useful in helping us to improve the knowledge of tilt stability for nonlinear programming problems?
The aim of this paper is to give the positive answers for the two risen questions. Precisely, after recalling some preliminary materials in Section 2, we establish a new second-order characterization of tilt-stable local minimizers for unconstrained optimization problems, in which the objective function is prox-regular and subdifferentially continuous [37] in Section 3. The characterization is expressed in terms of a uniform positive definiteness of the subgradient graphical derivative of the objective function around the considered point in which the prox-regularity of the objective function is essential not only for the necessary implication but also for the sufficient one. In Section 4, by applying the established characterization to nonlinear programs under the metric subregularity constraint qualification, we derive a new second-order characterization of tilt stability via a uniform second-order sufficient condition, which reduces to [28, Theorem 4.3] under the validity of both MFCQ and CRCQ and then obtain pointbased second-order sufficient conditions for a stationary point of the problem to be a tilt-stable local minimizer. As a consequence, we show that each stationary point of a nonlinear programming problem satisfying MSCQ is a tilt-stable local minimizer if SSOSC is satisfied. This result improves the corresponding result of Mordukhovich and Outrata [31] replacing the combination of MFCQ and CRCQ by the much weaker MSCQ. The final Section 5 involves some perspectives of the obtained results and future works.
2 Preliminaries
In this section we recall some basic notions and facts from variational analysis that will be used repeatedly in the sequel; see [8, 27, 40] for more details. Let be a nonempty subset of the Euclidean space and be a point in . Define the polar cone of by \Omega^{\circ}:=\big{\{}v\in\mathbb{R}^{n}|\,\langle v,x\rangle\leq 0\ \,\mbox{for all}\ x\in\Omega\big{\}}. The (Bouligand-Severi) tangent/contingent cone to the set at is known as
[TABLE]
The polar cone of the tangent cone is the (Fréchet) regular normal cone to at defined by
[TABLE]
It is well-known that the regular normal cone could be presented by the following construction
[TABLE]
where means that with Another normal cone construction used in our work is the (Mordukhovich) limiting/basic normal cone to at defined by
[TABLE]
which was introduced by Mordukhovich [25] in an equivalent form. If one puts and by convention. When the set is convex, the above tangent cone and normal cones reduce to the tangent cone and normal cone in the sense of classical convex analysis.
Consider the set-valued mapping with the domain \mbox{\rm dom}\,F:=\big{\{}x\in\mathbb{R}^{n}|\;F(x)\neq\emptyset\big{\}} and graph {\rm gph}\,F:=\big{\{}(x,y)\in\mathbb{R}^{n}\times\mathbb{R}^{m}|\,y\in F(x)\big{\}}. Suppose that the domain of is nonempty and is an element of .
The graphical derivative of at for is the set-valued mapping defined by
[TABLE]
that is, This concept was introduced in the early 1980s by Jean-Pierre Aubin, who called it the contingent derivative. Here we follow the references [8, 40] in using the terminology “the graphical derivative”. In the case one writes for . If one puts for all by convention. We note further that if is a single-valued mapping differentiable at then
Recall [27, 40] that the set-valued mapping F:\mathbb{R}^{n}\;{\lower 1.0pt\hbox{\rightarrow}}\kern-10.0pt\hbox{\raise 2.0pt\hbox{\rightarrow}}\;\mathbb{R}^{m} is said to be Lipschitz-like (pseudo-Lipschitz or has the Aubin property) at for with modulus if there exist neighborhoods (nbhs) of and of such that
[TABLE]
where is the unit ball in . The exact modulus for Lipschitz-like property of at for is defined by
[TABLE]
It is known from [8, Theorem 4B.2] that is Lipschitz-like at for if and only if
[TABLE]
where . Moreover, the quantity on the left-hand side of (2.3) is the exact modulus of at for .
An important property of set-valued mapping known as metric regularity also plays essential roles in our study. The set-valued mapping is said to be metrically regular at for with modulus if there exist nbhs of and of such that
[TABLE]
where represents the distance from a point to a set . The infimum of all such is the modulus of metric regularity, denoted by . It is well-known that is metrically regular at for with modulus if and only if is Lipschitz-like at for with the same modulus; see, e.g., [27, Theorem 1.49].
Following [8, Section 3.8], we say is metrically subregular at for with modulus when the inequality (2.4) holds with , i.e.,
[TABLE]
The infimum of all such is the modulus of metric subregularity, denoted by .
The set-valued mapping is said to be strongly metrically regular at for with modulus if its inverse admits a single valued and Lipschitz continuous localization around for with modulus in the following sense: there are neighborhoods of and of and a Lipschitz continuous function with full domain and constant satisfying that
[TABLE]
Strong metric regularity introduced by Robinson [39] has been known a strong notion useful in optimization and algorithm; see [8] for further discussions and applications to nonlinear programming.
Assume that is an extended-real-valued proper function with \bar{x}\in\mbox{\rm dom}\,f:=\big{\{}x\in\mathbb{R}^{n}|\;f(x)<\infty\big{\}}. The limiting subdifferential (known also as the Mordukhovich/basic subdifferential) of at is defined by
[TABLE]
where {\rm epi}\,f:=\big{\{}(x,r)\in\mathbb{R}^{n}\times\mathbb{R}|\;r\geq\varphi(x)\big{\}} is the epigraph of . For each following [32], the mapping defined by
[TABLE]
is said to be the subgradient graphical derivative of at for Finally let us recall two notations of prox-regularity and subdifferential continuity. Function is said to be prox-regular at for if there exist such that for all with we have
[TABLE]
Moreover, we say is subdifferentially continuous at for if the mapping is continuous relative to the graph of at . When the function is both prox-regular and subdifferentially continuous at for , by choosing smaller , (2.5) is still valid without the restriction “”. It is worth noting that in this case the graph of is closed around . For more detailed information on the prox-regularity and its applications, we refer the reader to the references [6, 36, 40].
3 Second-Order Characterizations of Tilt Stability
This section focuses on the tilt stability for unconstrained optimization problems. The concept of tilt-stability due to Poliquin and Rockafellar [37] is defined as follows.
Definition 3.1**.**
(Tilt stability [37]).* Given , a point is a tilt-stable local minimizer of with modulus if there is a number such that the mapping*
[TABLE]
is single-valued and Lipschitz continuous with constant on some neighborhood of with . In this case we define the exact modulus for tilt stability of function at by
[TABLE]
The following result taken from [28, Theorem 3.1 and Theorem 3.2] provides some useful characterizations for tilt stability via the strong metric regularity of the subdifferential and the uniform second-order growth condition; see also [9, Theorem 3.3] for the earlier result without paying much attention to the modulus of tilt-stability.
Theorem 3.2**.**
(Characterizations of tilt stability).* Let be a lower semi-continuous (l.s.c.) proper function such that and . Assume that is both prox-regular and subdifferentially continuous at for . Then the following assertions are equivalent:*
(i)* The point is a tilt-stable local minimizer of the function with modulus .*
(ii)* The point is a local minimizer of and is strongly metrically regular at for with modulus in the sense that admits a single-valued and Lipschitz continuous localization around for with modulus .*
(iii)* There are neighborhoods of and of such that the mapping admits a single-valued localization around for and that for any pair we have the uniform second-order growth condition*
[TABLE]
Tilt stability has been also characterized via second-order subdifferentials, in particular, the limiting second-order subdifferential, that is, the limiting coderivative to the limiting subdifferential; see, e.g., [11, 28, 12, 32, 34, 35, 37]. Over the years, this dual approach has produced many nice results on tilt stability, leading to various applications to nonlinear programming, semidefinite programming, conic programming and so on. To the best of our knowledge, in the current stage, the dual approach has met some severe difficulties in handling tilt stability for non-polyhedral conic programs under weak conditions, due to the limitation of computing such dual second-order structures under mild assumptions.
We next examine a new approach to tilt stability, which is based on the subgradient graphical derivative. It turns out that, as shown in the next section, this approach can help us to improve the knowledge of tilt stability for nonlinear programming problems. Precisely, we have the following theorem which provides a new second-order characterization of tilt stability that will be the main tool in investigating tilt stability for nonlinear programming problems in Section 4.
Theorem 3.3**.**
(Subgradient graphical derivative characterization of tilt-stability).* Let be a l.s.c. proper function with and . Assume that is both prox-regular and subdifferentially continuous at for . Then the following assertions are equivalent:*
(i)* The point is a tilt-stable local minimizer of with modulus .*
(ii)* There is a constant such that for all we have*
[TABLE]
Furthermore, the exact tilt-stable modulus of is calculated by the formula
[TABLE]
with the convention that .
Proof. To verify (i)(ii), suppose that is a tilt-stable local minimizer of with modulus . Then we get from Theorem 3.2 that there exists a single-valued and Lipschitz continuous localization of relative to a neighborhood of such that (3.1) is satisfied. Fix with , due to the Lipschitz continuity of and we find some such that . Since is a tilt-stable local minimizer of the function with modulus , the positive real constants and can be chosen such that is single-valued and Lipschitz continuous with modulus over It follows from (3.1) that
[TABLE]
Then we have and thus for all . The latter is due to the single-valuedness of over Set and . Take any , we get from (3.1) that
[TABLE]
Adding these two inequalities gives us that
[TABLE]
To justify (3.2), pick any with and and find sequences and such that Hence, we derive from (3.5) that
[TABLE]
for all . It follows that . Taking in the latter inequality gives us that , which clearly ensures (3.2) with .
Let us now justify the converse implication (ii)(i) by supposing that (3.2) holds with some . Since is prox-regular and subdifferentially continuous at for , there are with satisfying
[TABLE]
for all and Pick any and define
[TABLE]
We have
[TABLE]
Define further with for and observe that contains an open ball for some sufficiently small. Take any and Then \big{(}u,v-s(u-\bar{x})\big{)}=J^{-1}(u,v)\in\mbox{\rm gph}\,\partial f\cap\mathbb{B}_{\varepsilon}(\bar{x},\bar{v}). So by (3.6) we have
[TABLE]
This together with (3.7) implies that
[TABLE]
whenever and Since is both prox-regular and subdifferentially continuous at for , it is easy to check from definition that is also prox-regular and subdifferentially continuous at for . Take any and By [8, Proposition 4A.2], we get from (3.8) that
[TABLE]
Note that . The above inclusion together with (3.2) implies that . Thus
[TABLE]
which ensures that . By the regular graphical derivative criterion for Lipschitz-like property from [8, Theorem 4B.2] (see also (2.3)) we conclude that is Lipschitz-like at for with the modulus . Hence, there exists some neighborhood of such that
[TABLE]
Since , we get from the latter that
[TABLE]
So, choosing the neighborhood smaller if necessary, assume that for all and where is some positive real number satisfying Let be a localization of relative to , i.e., . Since for , we have . Moreover, for all , it follows from (3.9) that
[TABLE]
This easily implies that is single-valued, i.e., for . Since we have for all Furthermore, from (3.10) we obtain that
[TABLE]
or equivalently, there exists such that
[TABLE]
Hence,
[TABLE]
It implies that
[TABLE]
which together with (3.12) ensures that
[TABLE]
Taking into account that satisfies (3.9), we get from Theorem 3.2 the existence of an open neighborhood of such that
[TABLE]
Since is an open set of , we find a neighborhood of with and . For any and , we have
[TABLE]
Applying Theorem 3.2 again verifies (i). It is easy to see that the exact bound formula (3.3) follows directly from (3.2).
The next two examples show the prox-regularity assumption is essential not only for but also for in our Theorem 3.3.
Example 3.4**.**
(Implication (i) (ii) fails in the absence of the prox-regularity). Let be the function defined by
[TABLE]
Then is a tilt-stable local minimizer, and is subdifferentially continuous but not prox-regular at for see [9] for further detail. Here we check the prox-regular property of at for via definition and direct computation. Indeed, for each sufficiently small, we have
[TABLE]
So, is a tilt-stable local minimizer of with arbitrary modulus Moreover, by simple calculations, we get
[TABLE]
with Let be an arbitrary positive number. For , and it holds that
[TABLE]
or equivalently,
[TABLE]
Therefore, is not prox-regular at for Next, we will show that (3.2) is invalid for each To see this, note that for each with we have
[TABLE]
It follows that
[TABLE]
For as , and we have Thus for any the assertion (ii) in Theorem 3.3 is invalid. This means that, in the absence of the prox-regularity, tilt-stability of at does not guarantee the validity of the second-order condition (3.2).
Example 3.5**.**
(Implication (ii) (i) fails in the absence of the prox-regularity). Let be the function taken from [10, Remark 4.8]:
[TABLE]
where and We next show that is not prox-regular at for and is not a tilt-stable local minimizer, while the assertion (ii) in Theorem 3.3 holds. To see this, we first note that, for each the limiting subdifferential of at is computed by
[TABLE]
This implies that
[TABLE]
For a fixed choosing u_{n}=\Big{(}\dfrac{1}{n},0\Big{)}, x_{n}=\Big{(}0,\dfrac{1}{n}\Big{)}, and v_{n}=\Big{(}\dfrac{2}{n},1\Big{)}\in\partial f(u_{n}), we have
[TABLE]
This says is not prox-regular at for Moreover, by direct computation, for each and with we obtain that
[TABLE]
Since is not single-valued, is not a tilt-stable local minimizer. Let with and For each and by a simple calculation, we get
[TABLE]
It follows that
[TABLE]
Hence, for any and with we have which ensures (3.2) for any and We conclude that the validity of (3.2) does not imply tilt-stability of at without the prox-regularity assumption on at for .
4 Tilt Stability in Nonlinear Programming
In this section, using our subgradient graphical derivative characterization of tilt-stability along with the recent formulas for the graphical derivative of normal cone mappings from [5, 15] and some techniques from [12], we establish new results on tilt stability for nonlinear programming problems under the metric subregular constraint qualification.
Consider the nonlinear programming problem:
[TABLE]
where and are twice continuously differentiable functions.
Let be the mapping defined by q(x):=\big{(}q_{1}(x),q_{2}(x),...,q_{m}(x)\big{)} for and be the feasible set. Problem (4.1) could be written as a unconstrained optimization problem:
[TABLE]
where is the indicator function to , which equals to [math] when and otherwise. We say the point is a tilt stable local minimizer of Problem (4.1) with modulus if there exists such that the argmin solution mapping
[TABLE]
is single-valued and Lipschitz continuous with constant on some neighborhood of with . Thus, is a tilt stable local minimizer of Problem (4.1) if and only if it is a tilt stable local minimizer of the function defined above. The number is the exact modulus of tilt stability of (4.1) at .
Following the sum rule [27, Proposition 1.107], the limiting subdifferential of at is computed by
[TABLE]
with \Psi:\mathbb{R}^{n}\;{\lower 1.0pt\hbox{\rightarrow}}\kern-10.0pt\hbox{\raise 2.0pt\hbox{\rightarrow}}\;\mathbb{R}^{n}.
Let us now recall some well-known constraint qualification in nonlinear programming. The Mangasarian-Fromovitz constraint qualification (MFCQ) is said to hold at the point if there exists a vector such that
[TABLE]
where I(\bar{x}):=\big{\{}i\in\{1,\ldots,m\}\,|\,q_{i}(\bar{x})=0\big{\}} is the active index set at . Furthermore, the constant rank constraint qualification (CRCQ) is said to hold at if there is a neighborhood of such that the gradient system has the same rank in for any index . It is well-recognized that MFCQ and CRCQ are independent in the sense that one cannot imply the other. Obviously, CRCQ is weaker than the linear independence constraint qualification (LICQ), which means all vectors , are linearly independent. Moreover, MFCQ is known to be stronger than the below metric subregularity constraint qualification; see, e.g., [12].
Definition 4.1**.**
One says the metric subregularity constraint qualification (MSCQ) holds at if the set-valued mapping is metrically subregular at for [math], i.e., there exists a neighborhood of and a constant such that
[TABLE]
The infimum of all for which this inequality (4.3) holds is called the modulus of metric subregularity of at for [math] and is denoted by .
The feasible set is said to have the bounded extreme point property (BEPP) at if there exist real numbers and such that
[TABLE]
where denotes the set of extremal points of **
The metric subregularity constraint qualification (MSCQ) is a mild condition, which is equivalent to the existence of a local error bound [17]. It is weaker than most known constraint qualifications, such as LICQ, MFCQ, CRCQ, the pseudonormality and the quasinormality [24], the constant positive linear dependence (CPLD) [38], the relaxed CPLD [1, 16], the relaxed CRCQ [23], the relaxed MFCQ/the constant rank of the subspace component [2, 16, 20]. Furthermore, if MSCQ holds at , then it holds at every near . Note that MSCQ does not imply BEPP (see Example 4.13), while the latter holds under MFCQ or CRCQ or the second-order sufficient condition for metric subregularity [12].
By [6, Theorem 31(b)], [18, Proposition 3.4] and [27, Corollary 1.15] and one has the following result:
Lemma 4.2**.**
Let be a twice continuously differentiable mapping. Suppose MSCQ holds at Then, there exists such that
[TABLE]
Moreover, is prox-regular and subdifferentially continuous at for each
Following Lemma 4.2, under MSCQ, the normal cone to at could be presented by the following formula
[TABLE]
For , we denote
[TABLE]
by the set of Karush-Kuhn-Tucker (KKT) multipliers corresponding to . Furthermore, the critical cone to at for is defined by
[TABLE]
Let for . We note that if then is a subset of the active set at , i.e., .
By Lemma 4.2, if MSCQ holds at then the set is a nonempty polyhedral convex set for any . In this case, for each the problem
[TABLE]
is a linear programming. The optimal solution set of will be denoted by .
For problem (4.1), its associated KKT function is defined by for each and Under MSCQ at a local minimizer to Problem (4.1), it follows from (4.9) and (4.4) that there exists such that is a solution of the KKT system
[TABLE]
When a feasible point satisfies (4.6) for some KKT multiplier , we call it a stationary point of (4.1).
In this paper, we introduce a new second-order sufficient condition, which is motivated from the so-called uniform second-order sufficient condition (USOSC) introduced by Mordukhovich and Nghia [28].
Definition 4.3**.**
(Relaxed uniform second-order sufficient condition). We say that the relaxed uniform second-order sufficient condition (RUSOSC) holds at with modulus if there exists such that
[TABLE]
whenever with defined in (4.2) and \lambda\in\Lambda\big{(}x,v-\nabla g(x);w\big{)} with satisfying
[TABLE]
Remark 4.4**.**
The USOSC aforementioned in [28] is defined similarly, except for replacing \Lambda\big{(}x,v-\nabla g(x);w\big{)} by \Lambda\big{(}x,v-\nabla g(x)\big{)}, which does not depend on satisfying (4.8). It is clear that USOSC implies RUSOSC. The converse implication is also valid under CRCQ; see our Corollary 4.6 below together with Theorem 4.5.
We now arrive at the first result of this section, which gives us a fuzzy characterization of tilt stable local minimizers in terms of RUSOSC and its modification for nonlinear programming problems. It is also worth noting here that the modulus of metric regularity used in this result and the following ones could be computed directly in terms of initial data whenever MSCQ holds at ; see, e.g., [13, Corollary 3.4].
Theorem 4.5**.**
(Fuzzy characterization of tilt-stability under MSCQ).* Given a stationary point and real numbers suppose that MSCQ is fulfilled at and Then, the following assertions are equivalent:*
* The point is a tilt-stable local minimizer of Problem (4.1) with modulus *
* The RUSOSC is satisfied at with modulus *
(iii)* There exists such that*
[TABLE]
whenever and \lambda\in\Lambda\big{(}x,v-\nabla g(x);w\big{)}\cap\gamma\|v-\nabla g(x)\|\mathbb{B}_{\mathbb{R}^{m}} with satisfying
[TABLE]
where is defined in (4.2).
Proof. Let be so small that MSCQ holds at each with modulus Pick any with by (4.2). It follows from the sum rule for the graphical derivative in [8, Proposition 4A.2] that
[TABLE]
By the computation of in [5, Theorem 3.5] and [15, Theorem 4], we have
[TABLE]
Note further from the validity of MSCQ, Lemma 4.2, and (4.5) that
[TABLE]
Moreover, for each \lambda\in\Lambda\big{(}x,v-\nabla g(x)\big{)}, we have
[TABLE]
which implies that
[TABLE]
Let us justify []. Assume that is a tilt-stable local minimizer of Problem (4.1), i.e., it is a tilt-stable local minimizer of . Since could be arbitrarily small, we may suppose that (3.2) is satisfied with this by Theorem 3.3. Pick any and \lambda\in\Lambda\big{(}x,v-\nabla g(x);w\big{)} with
[TABLE]
It follows from (4.14) that -w\in K\big{(}x,v-\nabla g(x)\big{)}. Moreover, note from (4.4) and (2.1) that
[TABLE]
We have
[TABLE]
This implies by (4.12). Moreover, by Lemma 4.2 again, is prox-regular and subdifferentially continuous at for Thanks to (3.2) we obtain that
[TABLE]
This together with (4.15) verifies (4.7) with and thus ensures (ii).
Since the implication [] is obvious, it remains to justify []. To end this, suppose holds. Take any and By (4.9) and (4.12), there exists \lambda\in\Lambda\big{(}x,v-\nabla g(x);w\big{)}\cap\gamma\|v-\nabla g(x)\|\mathbb{B}_{\mathbb{R}^{m}} such that
[TABLE]
It follows from (4.14) that satisfies (4.8). Noting also that \Lambda\big{(}x,v-\nabla g(x);w\big{)}=\Lambda\big{(}x,v-\nabla g(x);-w\big{)}. Hence, we get from and (4.7) that
[TABLE]
Moreover, since is a cone, it follows from (4.16) that . Combining this with the above inequality gives us that
[TABLE]
By Theorem 3.3 and Lemma 4.2, the point is a tilt stable local minimizer of (4.1) with modulus The proof is complete.
Using [12, Proposition 5.3], we easily see that Theorem 4.5 recovers [28, Theorem 4.3] under the validity of MFCQ and CRCQ. Furthermore, we show next that MFCQ is indeed a superfluous assumption in [28, Theorem 4.3].
Corollary 4.6**.**
(Characterization of tilt-stability under CRCQ via USOSC).* Let be a stationary point of (4.1) at which CRCQ holds. Then, the following assertions are equivalent:*
(i)* The point is a tilt stable local minimizer of (4.1) with modulus *
(ii)* There exists such that*
[TABLE]
whenever \lambda\in\Lambda\big{(}x,v-\nabla g(x)\big{)}, for and for
Proof. Since CRCQ holds at by [12, Proposition 5.3], we have
[TABLE]
for all near and w\in K(x,v-\nabla g(x)\big{)}. Moreover, the validity of CRCQ implies the validity of MSCQ (see, e.g. [23]), and \Lambda\big{(}x,v-\nabla g(x);w\big{)}=\Lambda\big{(}x,v-\nabla g(x);-w\big{)}. Therefore, the conclusion follows from the equivalence between (i) and (ii) in Theorem 4.5.
The below example shows a situation where Corollary 4.6 can be applicable, while [28, Theorem 4.3] cannot.
Example 4.7**.**
Consider the following optimization problem in :
[TABLE]
Obviously (4.17) is a special case of (4.1) with for . Note that and CRCQ holds at , so does MSCQ. On the other hand, direct computation shows that
[TABLE]
for all and \lambda\in\Lambda\big{(}x,v-\nabla g(x);w\big{)} satisfying
[TABLE]
By Corollary 4.6, is a tilt stable local minimizer for (4.17). However, MFCQ does not hold at [28, Theorem 4.3] is not applicable in this example.
The following result, which is a special case of [3, Theorem 5.3.2 (i)], is useful for us to obtain pointbased sufficient condition for tilt stability later.
Lemma 4.8**.**
(see [3, Theorem 5.3.2 (i)]).* Consider the problem :*
[TABLE]
where are given and fixed and Let denote the set of optimal solutions to problem Then, the graph of the mapping is closed.
The following result provides a pointbased sufficient condition for tilt-stable minimizer.
Theorem 4.9**.**
(Pointbased sufficient condition for tilt-stability under MSCQ).* Given a stationary point and real numbers suppose that MSCQ is fulfilled at and and that the following second-order condition holds:*
[TABLE]
*where \Delta(\bar{x}):=\bigcup\limits_{0\not=v\in K\big{(}\bar{x},-\nabla g(\bar{x})\big{)}}\Lambda\big{(}\bar{x},-\nabla g(\bar{x});v\big{)}\bigcap\gamma\|\nabla g(\bar{x})\|\mathbb{B}_{\mathbb{R}^{m}}.
Then is a tilt-stable local minimizer of (4.1) with modulus Furthermore, we have the estimation:*
[TABLE]
with the convention that in (4.21).
Proof. Suppose to contrary that all assumptions of Theorem 4.9 are satisfied, but is not a tilt-stable local minimizer of (4.1) with modulus By the equivalence between (i) and (iii) in Theorem 4.5, there exist with and \lambda^{k}\in\Lambda\big{(}x^{k},v^{k}-\nabla g(x^{k});w^{k}\big{)} for some satisfying ,
[TABLE]
and that
[TABLE]
By dividing all equalities and inequalities in (4.22) by and both sides of (4.23) by , we may assume without loss of generality that and converges to some with Furthermore, since for all and using a subsequence if necessary, we may assume with By passing in (4.23), we get
[TABLE]
Note that , , , we get that . Moreover, we have
[TABLE]
Hence, \bar{\lambda}\in\Lambda\big{(}\bar{x},-\nabla g(\bar{x})\big{)}. We next show that there exists v\in K\big{(}\bar{x},-\nabla g(\bar{x})\big{)}\backslash\{0\} such that \bar{\lambda}\in\Lambda\big{(}\bar{x},-\nabla g(\bar{x});v\big{)}. Consider the following two cases:
Case 1: There exist infinitely many such that Passing to a subsequence if necessary, we may assume that for every and that for some with Note that for large , we get
[TABLE]
Hence, by (4.13). Moreover, since , we get from the above expression that
[TABLE]
It follows that v\in T_{\Gamma}(\bar{x})\cap\{-\nabla g(\bar{x})\}^{\perp}=K\big{(}\bar{x},-\nabla g(\bar{x})\big{)}. Note further that for all sufficiently large due to the fact . Pick any , we have and Therefore,
[TABLE]
which clearly implies that \bar{\lambda}\in\Lambda\big{(}\bar{x},-\nabla g(\bar{x});v\big{)}.
Case 2: for only finitely many Then we may assume without loss of generality that for all From (4.22) it follows that
[TABLE]
So, since and we have \bar{w}\in K\big{(}\bar{x},-\nabla g(\bar{x})\big{)}\backslash\{0\}. On the other hand, \lambda^{k}\in\Lambda\big{(}\bar{x},v^{k}-\nabla g(\bar{x});w^{k}\big{)}. By Lemma 4.8, we have Moreover, since for all we see that for all
Consequently, in the both cases above, we get a contradiction by comparing (4.24) with (LABEL:6.6). So, is a tilt-stable local minimizer of (4.1) with modulus Finally, to justify (4.21), note the assumption (LABEL:6.6) that
[TABLE]
Take any , we have (LABEL:6.6). This along with the above proof guarantees that is a tilt-stable local minimizer of (4.1) with modulus showing that . Since is chosen arbitrarily, we have , which clearly verifies (4.21) holds. The proof is complete.
As a consequence of Theorem 4.9, we establish the following result, which is also a corollary of [12, Theorem 6.1] by replacing MSCQ and BEPP there by the stronger constraint qualification that is MFCQ.
Corollary 4.10**.**
Let be a stationary point of Problem 4.1 and be a positive number. Suppose that MFCQ is satisfied at and the following second-order condition holds:
[TABLE]
where \Delta_{\mathcal{E}}(\bar{x}):=\bigcup\limits_{0\not=v\in K\big{(}\bar{x},-\nabla g(\bar{x})\big{)}}\Lambda_{\mathcal{E}}\big{(}\bar{x},-\nabla g(\bar{x});v\big{)} and \Lambda_{\mathcal{E}}\big{(}\bar{x},-\nabla g(\bar{x});v\big{)} is the set of extremal points of \Lambda\big{(}\bar{x},-\nabla g(\bar{x});v\big{)}. Then is a tilt-stable local minimizer of (4.1) with modulus Furthermore, we have the estimate
[TABLE]
with the convention that in (4.28).
Proof. Let any \lambda\in\Lambda\big{(}\bar{x},-\nabla g(\bar{x});v\big{)} for some v\in K\big{(}\bar{x},-\nabla g(\bar{x})\big{)} and with Since MFCQ holds at the set is bounded and thus it is a compact polyhedral set. Hence, we have
[TABLE]
Consequently, for some \lambda^{i}\in\Lambda_{\mathcal{E}}\big{(}\bar{x},-\nabla g(\bar{x});v\big{)}, and Since and we get
[TABLE]
So, taking into account that \lambda^{i}\in\Lambda_{\mathcal{E}}\big{(}\bar{x},-\nabla g(\bar{x});v\big{)}, by (LABEL:6.6-1), we have
[TABLE]
This implies that
[TABLE]
So, by Theorem 4.9, is a tilt-stable local minimizer of (4.1) with modulus and thus, (4.28) follows.
We next establish another second-order sufficient condition for tilt-stable local minimizers by surpassing the appearance in (LABEL:6.6).
Theorem 4.11**.**
Given a stationary point and a real number suppose that MSCQ is fulfilled at and and that the following second-order condition holds:
[TABLE]
Then, is a tilt-stable local minimizer for (4.1).
Proof. If or \bigcup\limits_{\lambda\in\Delta(\bar{x})}\big{\{}w\ \langle\nabla q_{i}(\bar{x}),w\rangle=0,\ i\in I^{+}(\lambda)\big{\}}=\{0\}, then, by Theorem 4.9, we get the conclusion. We now assume and \bigcup\limits_{\lambda\in\Delta(\bar{x})}\big{\{}w\ \langle\nabla q_{i}(\bar{x}),w\rangle=0,\ i\in I^{+}(\lambda)\big{\}}\not=\{0\}. First, we justify the compactness of Since is bounded, it suffices to prove that is closed. To do this, take any \{\lambda^{k}\}\subset\bigcup\limits_{0\not=v\in K\big{(}\bar{x},-\nabla g(\bar{x})\big{)}}\Lambda\big{(}\bar{x},-\nabla g(\bar{x});v\big{)} with Since \Lambda\big{(}\bar{x},-\nabla g(\bar{x});tv\big{)}=\Lambda\big{(}\bar{x},-\nabla g(\bar{x});v\big{)} for all v\in K\big{(}\bar{x},-\nabla g(\bar{x})\big{)}\backslash\{0\}, and K\big{(}\bar{x},-\nabla g(\bar{x})\big{)} is a cone, one can find v_{k}\in K\big{(}\bar{x},-\nabla g(\bar{x})\big{)}\backslash\{0\} with such that \lambda^{k}\in\Lambda\big{(}\bar{x},-\nabla g(\bar{x});v_{k}\big{)} for all . By passing to subsequences if necessary, we may assume that with Applying Lemma 4.8 to the situation of problem , we have \overline{\lambda}\in\Lambda\big{(}\bar{x},-\nabla g(\bar{x});\overline{v}\big{)}. It follows that is closed and thus is compact.
Next, we show that (LABEL:6.6) holds for some when (4.31) is satisfied. Indeed, for each , let
[TABLE]
[TABLE]
and
[TABLE]
We note that (4.31) ensures for all with From the definition of there exists with such that Since is compact and the sets has finite elements in , , passing to a subsequence if necessary, we may assume that for some and for all Therefore, for all This implies that and
[TABLE]
We see that
[TABLE]
So, taking into account that we have
[TABLE]
Finally, for each and we have
[TABLE]
This shows that (LABEL:6.6) holds for any . By Theorem 4.9, is a tilt-stable local minimizer with modulus
Recall that the strong second-order sufficient condition (SSOSC) holds at if for all \lambda\in\Lambda\big{(}\bar{x},-\nabla g(\bar{x})\big{)} we have
[TABLE]
Under MFCQ and CRCQ, Mordukhovich and Outrata [31, Theorem 3.5] proved that the tilt-stability is satisfied under SSOSC. In the following corollary we also obtain this property but under weaker condition.
Corollary 4.12**.**
(Tilt stability from SSOSC under MSCQ).* Let be a stationary point of (4.1) at which MSCQ is valid. Then, is a tilt-stable local minimizer of (4.1) provided SSOSC is satisfied at *
Proof. The desired conclusion is straightforward from Theorem 4.11.
To complete this section, we provide a simple example, which is accessible by our Theorem 4.9 and Theorem 4.11 to verify the tilt stability; however, all the results in [12] is not applicable, since BEPP is not valid in this example. Moreover, we also clarify Corollary 4.12 without using either MFCQ and CRCQ as in [31, Theorem 3.5] discussed above.
Example 4.13**.**
(Tilt stability under MSCQ without BEPP). Consider the following two-dimensional nonlinear programming problem:
[TABLE]
Let q(x):=\big{(}q_{1}(x),q_{2}(x),q_{3}(x)\big{)}, and We have
[TABLE]
and Furthermore, direct verification shows that
[TABLE]
[TABLE]
and
[TABLE]
for each v\in K\big{(}\bar{x},-\nabla g(\bar{x})\big{)}, where and Obviously, we see that
[TABLE]
for all Hence MSCQ is fulfilled at and where Let and \Delta(\bar{x}):=\bigcup\limits_{0\not=v\in K\big{(}\bar{x},-\nabla g(\bar{x})\big{)}}\Lambda\big{(}\bar{x},-\nabla g(\bar{x});v\big{)}\bigcap\gamma\|\nabla g(\bar{x})\|\mathbb{B}_{\mathbb{R}^{3}}. It is easy to see that
[TABLE]
Take an arbitrary We note that So, if and , then Therefore,
[TABLE]
where and By Theorem 4.9, is a tilt-stable local minimizer of (4.33) with modulus
We next show that BEPP does not hold at in this case. Indeed, for each letting and we have
[TABLE]
Thus is a point in with This infer that BEPP is not fulfilled at Therefore, there is no any result of [12] that can apply to this example.
Finally, we observe that it is similar to (4.34) that SSOSC (4.32) is satisfied at , while either MFCQ or CRCQ fails in this example. This is an evidence of the advantage of our Corollary 4.12 in comparison to [31, Theorem 3.5].
5 Concluding Remarks
In this paper we have introduced a new fuzzy characterization of tilt stability via the sugradient graphical derivative. This new approach allows us to obtain some second-order necessary and sufficient conditions for tilt stability in nonlinear programming, which extend and improve several recent results in [12, 28, 31] by weakening the involved assumptions. Keeping in mind that, in the current stage, the commonly used dual approach has met severe difficulties in handling tilt stability for non-polyhedral conic programs under weak conditions, examining the new approach to tilt stability for such problems would be a topic of great interest. Another important topic of further research is to expand our approach to full stability in the sense of Levy-Poliquin-Rockafellar [21], a far-going extension of tilt stability and possibly improve results developed recently in [29, 30]. Furthermore, due to the strict connection of tilt stability and full stability to strong stability in the sense of Kojima [19], which is equivalent of SSOSC under MFCQ as discussed in [4, Chapter 5], studying strong stability under weaker conditions than MFCQ, e.g., MSCQ (see also our Corollary 4.12) will be an interesting topic that we will pursue.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. Andreani, G. Haeser, M. L. Schuverdt, P. J. S. Silva, A relaxed constrant positive linear dependence contraint qualification and applications, Math. Program. 135 (2012), 255–273.
- 2[2] R. Andreani, G. Haeser, M. L. Schuverdt, P. J. S. Silva, Two new weak constraint qualifications and applications, SIAM J. Optim. 22 (2012), 1109–1135.
- 3[3] B. Bank, J. Guddat, D. Klatte, B. Kummer and K. Tammer, Non-Linear Parametric Optimization , Springer Fachmedien Wiesbaden Gmb H, Berlin, 1982.
- 4[4] J. F. Bonnans and A. Shapiro, Perturbation Analysis of Optimization Problems , Springer, New York, 2000.
- 5[5] N. H. Chieu and L. V. Hien, Computation of graphical derivative for a class of normal cone mappings under a very weak condition, SIAM J. Optim. 27 (2017), 190–204.
- 6[6] G. Colombo and L. Thibault, Prox-regular sets and applications, in Handbook of Nonconvex Analysis , D. Y. Gao and D. Motreanu, eds., International Press, Boston, 2010, pp. 99–182.
- 7[7] A. L. Dontchev and R. T. Rockafellar, Characterizations of strong regularity for variational inequalities over polyhedral convex sets, SIAM J. Optim. 6 (1996), 1087–1105.
- 8[8] A. L. Dontchev, R. T. Rockafellar, Implicit functions and solution mappings. A view from variational analysis. Second edition. Springer Series in Operations Research and Financial Engineering. Springer, New York, 2014.
