Criticality of Lagrange Multipliers in Extended Nonlinear Optimization
Hong Do, Boris Mordukhovich, M. Ebrahim Sarabi

TL;DR
This paper investigates the criticality of Lagrange multipliers in extended nonlinear programming, providing a systematic variational analysis framework that links multiplier criticality with stability concepts using advanced second-order tools.
Contribution
It introduces the first comprehensive study of multiplier criticality in ENLP, offering verifiable characterizations and relationships with stability notions in variational analysis.
Findings
Characterization of critical and noncritical multipliers in ENLP
Relationships between multiplier criticality and stability concepts
Application of second-order variational analysis tools
Abstract
The paper is devoted to the study and applications of criticality of Lagrange multipliers in variational systems, which are associated with the class of problems in composite optimization known as extended nonlinear programming (ENLP). The importance of both ENLP and the concept of multiplier criticality in variational systems has been recognized in theoretical and numerical aspects of optimization and variational analysis, while the criticality notion has never been investigated in the ENLP framework. We present here a systematic study of critical and noncritical multipliers in a general variational setting that covers, in particular, KKT systems in ENLP with establishing their verifiable characterizations as well as relationships between noncriticality and other stability notions in variational analysis. Our approach is mainly based on advanced tools of second-order variational…
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.
Taxonomy
TopicsOptimization and Variational Analysis · Advanced Optimization Algorithms Research · Fractional Differential Equations Solutions
**CRITICALITY OF LAGRANGE MULTIPLIERS
IN EXTENDED NONLINEAR OPTIMIZATION**
HONG DO111Department of Mathematics, Wayne State University, Detroit, Michigan, 48202, USA ([email protected]). Research of this author was partly supported by the USA National Science Foundation under grants DMS-1512846 and DMS-1808978, and by the USA Air Force Office of Scientific Research grant #15RT04., BORIS S. MORDUKHOVICH222Department of Mathematics, Wayne State University, Detroit, Michigan, 48202, USA ([email protected]). Research of this author was partly supported by the USA National Science Foundation under grants DMS-1512846 and DMS-1808978, and by the USA Air Force Office of Scientific Research grant #15RT04. and M. EBRAHIM SARABI333Department of Mathematics, Miami University, Oxford, Ohio, 45056, USA ([email protected]).
**Abstract. **The paper is devoted to the study and applications of criticality of Lagrange multipliers in variational systems, which are associated with the class of problems in composite optimization known as extended nonlinear programming (ENLP). The importance of both ENLP and the concept of multiplier criticality in variational systems has been recognized in theoretical and numerical aspects of optimization and variational analysis, while the criticality notion has never been investigated in the ENLP framework. We present here a systematic study of critical and noncritical multipliers in a general variational setting that covers, in particular, KKT systems in ENLP with establishing their verifiable characterizations as well as relationships between noncriticality and other stability notions in variational analysis. Our approach is mainly based on advanced tools of second-order variational analysis and generalized differentiation.
Keywords Variational analysis, composite optimization, extended nonlinear programming, critical and noncritical multipliers, generalized differentiation, stability of variational systems
Mathematical Subject Classification (2000) 90C31, 49J52, 49J53
1 Introduction
One of the major goals of this paper is to study a remarkable class of optimization problems given in the following, formally unconstrained, composite format:
[TABLE]
where is an original cost function and is a constraint mapping, both are twice differentiable at the reference points unless otherwise stated, and where is an extended-real-valued function defined for all by the formula
[TABLE]
via a convex polyhedral set as well as an positive-semidefinite and symmetric matrix .
Note that the unconstrained composite format (1.1) gives us a convenient representation of the constrained optimization problem to minimize the cost function subject to the inclusion constraint . In particular, conventional nonlinear programs (NLPs) with inequality constraints and equality constraints described by -smooth functions can be written in the composite format (1.1), where is the indicator function of the polyhedron that is equal to [math] on and to otherwise.
Problems of the ENLP type (1.1) with given by (1.2) were introduced by Rockafellar [17] under the name of extended nonlinear programs (ENLPs). It has been realized over the years that ENLPs in this form provide a suitable framework for developing both theoretical and computational aspects of optimization in broad classes of constrained problems that include stochastic programming, robust optimization, etc. The special expression (1.2) for the extended-real-valued function , known as the dualizing representation or the piecewise linear-quadratic penalty, is significant for the theory and applications of Lagrange multipliers in the Karush-Kuhn-Tucker (KKT) systems associated with the ENLPs under consideration.
It is not hard to check (see more details in Section 6) that KKT systems associated with local optimal solutions to ENLPs are included in the following more general class of variational systems of the subdifferential type
[TABLE]
where is a differentiable mapping while is a twice differentiable mapping in the classical sense [18, Definition 13.1(i)], where is taken from (1.2), where ∗ indicates the matrix transposition/adjoint operator, and where stands for the subdifferential of convex analysis.
The main attention of this paper is paid to a systematic study of the multiplier criticality concept (i.e., the notions of critical and noncritical Lagrange multipliers) for variational systems of type (1.3) with applications to KKT systems in ENLPs.
The notions of critical and noncritical multipliers were first introduced by Izmailov [4] for the classical KKT systems corresponding to NLPs with equality constraints described by -smooth functions. It has been realized from the very beginning that the presence of critical multipliers plays a negative role in numerical optimization and is largely responsible for primal slow convergence in primal-dual algorithms of the Newtonian type. Further strong developments in this direction for NLPs and related variational inequalities have been done over the years, mainly by Izmailov, Solodov, and their collaborators; see, e.g., the book [5] and the survey paper [6], which is entirely devoted to critical multipliers. The criticality definitions in the above publications are heavily based on the specific structures of NLPs and related variational inequalities.
In [15], Mordukhovich and Sarabi suggested new definitions of critical and noncritical multipliers for a general class of subdifferential variational systems of type (1.3), where may be even a nonconvex extended-real-valued function. The given definitions in [15] are expressed via second-order generalized differential constructions of variational analysis while reduced to those from [4, 5] for the classical KKT systems corresponding to NLPs. Furthermore, for extended-real-valued convex piecewise linear (CPWL) functions in (1.3), which include (1.2) when , the definitions of critical and noncritical multipliers are expressed in [15] entirely in terms of the problem data with the subsequent characterizations of criticality and various applications to optimization and stability problems for such systems.
The quite recent paper of the same authors [16] contains counterparts of some major results from [15] with developing also novel issues on criticality for variational systems described by
[TABLE]
where and are the same as in (1.3), and where is the normal cone to a -cone reducible set . This framework covers, in particular, KKT systems associated with general problems of (nonpolyhedral) conic programming; see, e.g., [1].
The main results of the current paper extend those from [15], obtained for CPWL functions , to the case of functions defined in (1.2), which form a major class of extended-real-valued convex piecewise linear-quadratic functions in variational analysis; see [18] and Section 2 below. At the same time, the new results obtained here are completely independent from those derived for the variational system (1.4) in [15] in the case of nonpolyhedral sets therein.
The basic tools of first-order and second-order generalized differentiation employed in this paper are tangentially generated, except the classical subdifferential of convex analysis. We mostly rely on the generalized differential theory in primal spaces developed by Rockafellar; see [18] and the references therein. Using these tools allows us to establish verifiable characterizations of noncritical multipliers in the general setting of (1.3), to characterize the uniqueness of Lagrange multipliers in (1.3), to ensure noncriticality for ENLPs via a new second-order optimality condition, which is employed in turn to verify the important stability property of solutions to KKT systems that is known as robust isolated calmness and is related to noncriticality. We also reveal a relationship between the isolated calmness and Lipschitz-like properties of solution maps for canonically perturbed variational systems with the piecewise linear-quadratic term (1.2).
As mentioned above, the existence of critical multipliers is a negative factor in convergence analysis, since it seems to prevent primal superlinear convergence of major primal-dual algorithms. Thus it is crucial to find verifiable conditions, expressed entirely in terms of the problem data in question, which ensure that critical multipliers corresponding to this minimizer do not arise. It is conjectured in [10], based on preliminary results for NLPs, that full stability of local minimizers in the sense of [7] rules out the appearance of critical multiplies. This conjecture was verified in [15] for polyhedral problems of type (1.1) with convex piecewise linear functions . Now we justify this conjecture in the general case of ENLPs with piecewise linear-quadratic functions in form (1.2).
The rest of the paper is organized as follows. In Section 2 we present some definitions and facts from variational analysis and generalized differentiation that are broadly employed throughout the whole paper. Other variational constructions and results are recalled in those places of the subsequent sections where they are actually used.
Section 3 contains basic definitions of critical and noncritical multipliers for variational systems (1.3) involving piecewise linear-quadratic functions of type (1.2) with providing equivalent descriptions, examples, and discussions. In Section 4 we obtain new results on the relationship between the well-recognized calmness and isolated calmness properties of multiplier maps associated with the variational systems (1.3) with the piecewise linear-quadratic term (1.2) and the uniqueness of Lagrange multipliers in such systems. This is certainly of its independent interest, while the developed approach and results can be viewed as the preparation to the subsequent characterizations of noncritical multipliers in the variational systems under consideration.
Section 5 plays a central role in the paper. It establishes major characterizations of noncritical multipliers for systems (1.3) with taken from (1.2) via a novel semi-isolated calmness property for solution maps to canonical perturbations of (1.3) and also via two new error bounds that are specific for the variational systems (1.3) with the piecewise linear-quadratic term (1.2).
Section 6 is devoted to noncritical multipliers in KKT systems associated with ENLPs for which the results of the previous sections are automatically applied with the specification of in (1.3) as the -partial gradient of the appropriate Lagrangian. The main new result here, that is characteristic to the optimization framework, is a novel second-order sufficient condition for strict local minimizers, which also ensures that all the corresponding multipliers are noncritical.
In Section 7 we justify, for the case of ENLPs from (1.1) and (1.2), the aforementioned conjecture on excluding critical multipliers corresponding to a fully stable local minimizer for the given ENLP. The proof of this result is based on characterizations of noncriticality via semi-isolated calmness obtained in Section 5.
The last Section 8 provides applications of the developed characterizations of noncritical multipliers for the variational systems under consideration to the study of an important stability property of solution maps to KKT systems associated with ENLPs. This property of set-valued mappings has been recently recognized as robust isolated calmness. The results obtained above allow us to characterize robust isolated calmness via the noncriticality and uniqueness of Lagrange multipliers on one side and via the new second-order optimality condition for ENLPs on the other. Finally, we characterize the Lipschitz-like/Aubin property of solution maps to perturbed variational systems and establish its relationship with isolated calmness.
2 Preliminaries from Variational Analysis
In this section we review, based on the book [18], some basic notions of generalized differentiation in variational analysis and then recall important facts broadly used in what follows. Throughout the paper we use the standard notation of variational analysis; see [11, 18].
Given a nonempty subset and a point , the (Bouligand-Severi) tangent/contingent cone to at is defined by
[TABLE]
where the symbol indicates that with .
For a set-valued mapping , define its domain and graph by, respectively,
[TABLE]
The graphical derivative of at is given by
[TABLE]
Next we consider an extended-real-valued function with . Given , the second subderivative of at in the direction is defined by
[TABLE]
When is convex and proper (i.e., ), we use its subdifferential (i.e., the collection of subgradients) at given by
[TABLE]
If is a nonempty convex set, then the normal cone to at is the subdifferential (2.4) of its indicator function and thus is defined by
[TABLE]
The critical cone to at for is expressed via the tangent cone (2.1) as
[TABLE]
with the notation \{\bar{v}\}^{\perp}:=\big{\{}w\in\mathbb{R}^{n}|\;\langle w,v\rangle=0\}.
Along with (2.3), we employ in this paper yet another second-order generalized derivative of an extended-real-valued convex function at for that is defined via the graphical derivative (2.2) of the subgradient mapping under the name of the subgradient graphical derivative by
[TABLE]
Invoking the constructions above, we now formulate the basic facts about the functions taken from (1.2) that are systematically exploited in the paper. The proofs of these facts can be found in [18, Examples 11.18, 13.23 and Theorem 13.40]. Recall that the horizon cone of a nonempty set used below is defined by
[TABLE]
Recall also [18, Definition 10.20] that a function is piecewise linear-quadratic if its domain can be represented as the union of finitely many convex polyhedral sets, relative to each of which is given by an expression of the form for some scalar , vector , and symmetric matrix .
Theorem 2.1
(properties of piecewise linear-quadratic penalties).* Let be defined by (1.2). Then the following properties hold:*
- (i)
The function is a proper and convex piecewise linear-quadratic with the domain
[TABLE]
- (ii)
The subdifferential (2.4) of is calculated by
[TABLE]
- (iii)
Given any , the second subderivative (2.3) is calculated by
[TABLE]
in the same form as in (1.2) with the replacement of by critical cone defined via (2.6). Furthermore, the subgradient graphical derivative (2.7) of at for is represented as
[TABLE]
3 Multiplier Criticality in Piecewise Linear-Quadratic Settings
In this section we formulate the definitions of critical and noncritical multipliers corresponding to stationary points of the variational system (1.3) with the piecewise linear-quadratic term (1.2), establish an equivalent description of criticality entirely via the given data of (1.3), and then present two examples illustrating the calculation of critical and noncritical multipliers for this setting.
Given a point , define the set of Lagrange multipliers associated with by
[TABLE]
If is a solution to the variational system (1.3), we clearly get . Furthermore, it is not hard to check that the inclusion ensures that is a stationary point of (1.3) in the sense that it satisfies the condition
[TABLE]
Suppose from now on that , which is ensured, e.g., by any constraint qualification condition in problems of constrained optimization. The following definitions of critical and noncritical multipliers for (1.3), are just specifications of those from [15], given there for general variational systems with the subsequent implementation for the case of a convex piecewise linear function . It is worth noticing that the function from (1.2) with is convex piecewise linear, namely its epigraph is a convex polyhedral set, and so can be covered by the results already established in [15]; however, when , it is a convex piecewise linear-quadratic function and requires different techniques to achieve similar results.
Definition 3.1
(critical and noncritical multiplies in variational systems).* Let be a solution to the variational system (1.3). We say that is a critical Lagrange multiplier for (1.3) corresponding to if there exists a nonzero vector such that*
[TABLE]
A given multiplier is noncritical for (1.3) corresponding to if the generalized equation (3.3) admits only the trivial solution .
Applying the representations of Theorem 2.1 for the graphical derivative in (3.3) gives us an equivalent description of critical and noncritical multipliers from Definition 3.1, expressed entirely in terms of the initial data of (1.3).
Theorem 3.2
(equivalent description of criticality via piecewise linear-quadratic penalties).* Let be a solution to the variational system (1.3) with the term taken from (1.2). Denoting and via the critical cone (2.6), we have that the multiplier corresponding to is critical for (1.3) if and only if the system of relationships*
[TABLE]
admits a solution with . Accordingly, is a noncritical multiplier in this setting if and only if we have for any solution to (3.4).
Proof.
To achieve the claimed equivalencies, we require to calculate the graphical derivative in (3.3) for the function given in (1.2). First we use formula (2.10) from Theorem 2.1(iii), which yields
[TABLE]
On the other hand, the second expression of in (2.8) of Theorem 2.1(ii) shows that
[TABLE]
Putting these representations together, we arrive at
[TABLE]
Picking further any vector from the set on the left-hand side of (3.5) gives us therefore that \eta\in(N_{{\cal K}}+B\big{)}^{-1}\big{(}\nabla\Phi(\bar{x})\xi) and so . Since is a convex cone, the latter inclusion is equivalent to the conditions
[TABLE]
Finally, we substitute the obtained descriptions of into (3.3) and thus clearly verify both assertions of the theorem.
Next we present two examples, which demonstrate how to use the descriptions of Theorem 3.2 to explicitly determine critical and noncritical multipliers and illustrate in this way some characteristic features of multiplier criticality.
Example 3.3
(calculating critical and noncritical multipliers).* *Consider the multidimensional case of (1.3) with from (1.2), where is the identity matrix, and where the convex polyhedral set is the nonnegative orthant in , i.e.,
[TABLE]
Thus the function from (1.2) reduces in this case to
[TABLE]
For any and , by Theorem 2.1(ii) we have that if and only if . Denoting by , the latter inclusion is equivalent to the following system of equations and inclusions:
[TABLE]
It is not hard to see that for each fixed and this system has only one solution, which implies that the set of Lagrange multipliers has at most one element.
We now give two specific examples of mappings and , where one has a noncritical multiplier and the other has a critical multiplier. First, let and for all , and let . Combining (3.6) with the fact that implies that the unique Lagrange multiplier is . Then we calculate the critical cone in Theorem 3.2 with and its dual cone by, respectively,
[TABLE]
It follows from Theorem 3.2 that the unique Lagrange multiplier is noncritical if and only if the system of equations and inclusions
[TABLE]
admits the only solution pairs with . Denoting , the above system can be equivalently rewritten as
[TABLE]
Since , , and for any , it can be easily checked that the latter system has the unique solution pair . This tells us that is a noncritical multiplier.
Next we consider the case where as before while for all . Proceeding similarly to the previous case shows that is the unique Lagrange multiplier with the same critical cone . In this setting we have , and therefore system (3.7) reduces to
[TABLE]
It shows that all the pairs with and for are solutions to the above system. Thus the multiplier is critical.
In Section 6 we revisit this example in the optimization framework; see Example 6.2.**
The next two-dimensional example presents a simple linear-quadratic variational system of type (1.3) with from (1.2) such that a stationary point therein is associated with both critical and noncritical Lagrange multipliers.
Example 3.4
(variational systems with both critical and noncritical multipliers corresponding to a given stationary point).* *Specify the data of (1.2) and (1.3) as follows:
[TABLE]
Thus we have in (1.3) that for any and . By Theorem 2.1(i), we obtain . Since by Theorem 2.1(iii), it is not hard to see , and so with . Then for any we get and . On the other hand, conditions (3.1) from Theorem 3.2 read now as
[TABLE]
This tells us that if , the latter system admits only the solution , and thus the obtained Lagrange multiplier is noncritical. In the case where , this system admits nontrivial solutions , and so the Lagrange multiplier is critical.**
4 Uniqueness of Lagrange Multipliers and Isolated Calmness
This section is devoted to the study of uniqueness of Lagrange multipliers corresponding to given stationary points of the variational systems (1.3) with piecewise linear-quadratic penalties (1.2). This issue is definitely of its own interest while seems to be independent of multiplier criticality. However, the methods we develop for the uniqueness study and the obtained conditions for it occur to be closely related to the subsequent characterizations of noncritical multiplies as well as their deeper understanding and specification.
First we recall some “at-point” (vs. “around/neighborhood”) stability properties of set-valued mappings that have been recognized in variational analysis; see, e.g., [3, 11, 18] with the references and commentaries therein.
It is said that a mapping is calm at if there exist a constant and neighborhoods of and of such that
[TABLE]
where stands for the closed unit ball of the space in question. If (4.1) is replaced by
[TABLE]
then the corresponding property is known as isolated calmness of at . If the is locally closed at , the latter property admits the graphical derivative characterization
[TABLE]
known as the Levy-Rockafellar criterion; see the commentaries to [3, Theorem 4E.1].
Finally, enjoys the robust isolated calmness property at if in addition to (4.2) we have . This name is coined quite recently [2], while the property itself has been actually used in optimization over the years; see the discussions in [2, 15].
In this section we employ the calmness and isolated calmness properties for characterizations of uniqueness of Lagrange multipliers in (1.3) with the piecewise linear-quadratic term (1.2). Robust isolated calmness is used in the last section of the paper.
Using the data of (1.3), consider the set-valued mapping given by
[TABLE]
Then fix a point and define the parameterized multiplier map associated with by
[TABLE]
We have for the Lagrange multiplier set (3.1) of the unperturbed system (1.3).
The next theorem characterizes uniqueness of Lagrange multipliers in variational systems (1.3) with the term from (1.2) via both calmness and isolated calmness properties of the multiplier map (4.5), which are equivalent to each other in this case and are characterized in turn by a novel dual qualification condition.
Theorem 4.1
(characterizations of uniqueness of Lagrange multipliers in variational systems).* Let be a solution to the variational system (1.3) with taken from (1.2). Then the following properties are equivalent:*
- (i)
.
- (ii)
* is calm at \big{(}(0,0),\bar{\lambda}\big{)} and .*
- (iii)
* is isolatedly calm at \big{(}(0,0),\bar{\lambda}\big{)}.*
- (iv)
We have the dual qualification condition
[TABLE]
where is calculated by (3.5).
Proof.
Denoting as above, we begin with proving the equivalence (iii)(iv). To proceed, observe that the graph of is closed and deduce from (4.3) that is isolatedly calm at if and only if DM_{\bar{x}}\big{(}(0,0),\bar{\lambda}\big{)}(0,0)=\{0\}. It is not hard to check that \eta\in DM_{\bar{x}}\big{(}(0,0),\bar{\lambda}\big{)}(0,0) amounts to saying that is a solution to the system
[TABLE]
This tells us that is a solution to the above system if and only if
[TABLE]
Combining these facts verifies the equivalence between conditions (iii) and (iv).
Next we show that (i)(iv). Assume on the contrary that the dual qualification condition (4.6) fails while (i) holds, and so find an element
[TABLE]
Since for any , we get from and (2.10) that , and hence by Theorem 2.1(ii). Choosing to be sufficiently small and employing the Reduction Lemma from [3, Lemma 2E.4] ensure the existence of a neighbored of such that
[TABLE]
This in turn results in , which yields by (2.8) the inclusion . Combining the latter with results in . However, we have thus for any , which contradicts (i) and so verifies the claimed implication (i)(iv).
To show further that the isolated calmness of at \big{(}(0,0),\bar{\lambda}\big{)} imposed in (iii) yields (ii), it suffices to check that . Indeed, the assumed isolated calmness allows us to find a neighborhood of such that , which tells us by the convex-valuedness of that . Combining the latter with verifies (ii). Since (ii) obviously implies (i), we complete the proof of the theorem.
The next example reveals that the dual qualification condition (4.6) is essential for the uniqueness of Lagrange multipliers in Theorem 4.1.
Example 4.2
(nonuniqueness of Lagrange multipliers under failure of the dual qualification condition).* *Consider the variational system (1.3) with term (1.2), where and are taken from (3.8), while is defined by and is defined by for all . It is shown in Example 3.4 that . Letting , we get by the direct calculation that
[TABLE]
and so , which is not a singleton.
Let us now show that the dual qualification condition fails in this setting. Having and choosing give us the critical cone
[TABLE]
and so . Combining it with (2.10), we arrive at
[TABLE]
which demonstrates the failure of the dual qualification condition (4.6).**
5 Characterizations of Noncritical Multipliers
In this section we derive major characterizations of noncritical multipliers for the piecewise linear-quadratic variational systems (1.3) in terms of semi-isolated calmness and error bounds.
Using the mapping from (4.4), define the solution map for the canonical perturbation of system (1.3) by
[TABLE]
The property of semi-isolated calmness used in (5.3) was introduced in [15] for solution maps to general variational systems with a product structure of values as in (5.1). The reader can see that for such mappings the semi-isolated calmness of the variational systems of type (1.3) occupies an intermediate position between the calmness and isolated calmness.
In what follows we use the notation for the distance between a point and a set , for the closed ball centered at with radius , and
[TABLE]
for the proximal mapping associated with a function .
Theorem 5.1
(major characterizations of noncritical multipliers in variational systems).* Let be a solution to the variational system (1.3) with the piecewise linear-quadratic term (1.2). Then the following conditions are equivalent:*
- (i)
The Lagrange multiplier is noncritical for (1.3) corresponding to .
- (ii)
There exist numbers , and neighborhoods of and of such that for any the following inclusion holds:
[TABLE]
- (iii)
There exist numbers and such that the error bound estimate
[TABLE]
holds for any in terms of the inverse subdifferential of .
- (iv)
There are numbers and such that the error bound estimate
[TABLE]
holds for any in terms of the proximal mapping from (5.2).
Proof.
Let us first verify that (ii) implies (i). Theorem 3.2 reduces it to proving that the semi-isolated calmness property in (ii) ensures that for any solution to the system (3.4) we have . Define for all and observe that
[TABLE]
whenever is sufficiently small. Letting and using , we deduce from the last equality above that . It follows in the similar way that
[TABLE]
Denoting further implies that
[TABLE]
and therefore we get for .
Let us now prove that for sufficiently small. Since , we only need to verify by Theorem 2.1(ii) that
[TABLE]
To proceed with checking (5.5), deduce from (3.4) that
[TABLE]
Denoting and remembering that is a convex polyhedral set, we conclude that for all sufficiently small. Furthermore, it follows from (3.4) that
[TABLE]
Thus there exist and such that . Using this together with (3.4) gives us the equalities
[TABLE]
Recall that , where stands for the set of active constraints in at . It allows us to deduce from the inclusion that there are numbers as such that , and therefore
[TABLE]
Observe furthermore the relationships
[TABLE]
where for small . Since both and belong to , it follows that , and thus there is for such that . Noting that and for all , we deduce that
[TABLE]
Let us now show that
[TABLE]
Suppose on the contrary that there is an index for which . This means that and . Therefore
[TABLE]
which in turn yields , a contradiction with (5.6). Thus for all we get and hence arrive at
[TABLE]
This verifies (5.5) and thus implies that . It now follows from the assumed semi-isolated calmness (5.3) in (ii) that
[TABLE]
which results in by letting . It tells us is noncritical and hence justify the implication (ii)(i) of the theorem.
Next we prove the opposite implication (i)(ii). Assuming that the multiplier noncriticality in (i) holds, let us first verify the following statement.
Claim: There exist numbers and and neighborhoods of and of such that for any and we have
[TABLE]
To justify this claim, suppose on the contrary that (5.7) fails and thus for any find , , and such that
[TABLE]
Denote and deduce from the convergence above that and . Since is a convex piecewise linear-quadratic function, it follows from the proof of [18, Theorem 11.14(b)] that is a union of finitely many convex polyhedral sets. This together with [3, Theorem 3D.1] and ensures the existence of a number and a neighborhood of such that for all we have
[TABLE]
Suppose without loss of generality that for all . Since , there exist and such that . Using this along with the classical Hoffman lemma, we find a number such that
[TABLE]
where is a common calmness constant for the mappings , , and at . Since is closed and convex, for each there exists a vector for which
[TABLE]
Thus we can assume without loss of generality that
[TABLE]
By passing to a subsequence if necessary, it follows that
[TABLE]
Due to and the discussions above we get the equalities
[TABLE]
which lead us as to the limiting condition
[TABLE]
It further follows from that , which is equivalent to the inclusion for each by Theorem 2.1(ii). Since is a convex polyhedral set, the Reduction Lemma from [3, Lemma 2E.4]) tells us that
[TABLE]
for all sufficiently large, where is the critical cone to at for taken from Theorem 2.1(iii). This along with Theorem 2.1(iii) brings us to the conclusions
[TABLE]
[TABLE]
which imply in turn that . Since is a convex polyhedral set, it follows from Theorem 2.1(i) that is a convex piecewise linear-quadratic function. Thus [18, Proposition 10.21] tells us that . Employing Theorem 2.1(i) ensures that is a closed set. Combining it with the convergence as yields
[TABLE]
Since , we get and, proceeding similarly to the proof of (5.14), arrive at
[TABLE]
Furthermore, it follows from and that . Using (5.15) and arguing as in the proof of (5.8), we find and a neighborhood of such that
[TABLE]
for all . Employing the latter together with (5.14) leads us to the relationships
[TABLE]
This allows us to find, for all sufficiently large, a such that
[TABLE]
We can see that the left-hand side of inclusion (5.16) converges as to the vector . On the other hand, the right-hand side of this inclusion is the sum of two convex polyhedral sets, and so is closed. This shows that satisfies to
[TABLE]
Thus we get vectors and , which provide the representation . It follows from the relationship (2.10) in Theorem 2.1(iii) that . Furthermore, employing (5.13) tells us that
[TABLE]
which contradicts the noncriticality of due to and thus completes the proof of the claim.
To finalize verifying implication (i)(ii) in the theorem, take the neighborhoods and from the above claim and shrink them if necessary for the subsequent procedure. Using the claim and arguing similarly to the proof of the conditions in (5.12) give us a constant such that for any and any we have
[TABLE]
Combining it with (5.7) allows us to find for which and
[TABLE]
whenever . This clearly justifies the semi-isolated calmness property (5.3) and thus finishes the proof of implication (i)(ii).
The equivalence between (ii) and (iii) can be verified similarly to the corresponding arguments in the proof of [15, Theorem 4.1], and so we omit them here. Thus it remains to establish the equivalence between assertions (ii) and (iv) of the theorem to complete its proof.
Let us start with checking implication (iv)(ii). Picking and with and taken from (iv), we get from the definition of that
[TABLE]
It follows from [18, Proposition 12.19] due to the convexity of that , and hence the second inclusion in (5.19) is equivalent to the equality . Appealing now to (5.4) brings us to the estimates
[TABLE]
which readily justify the assertion in (ii).
Finally, we verify the converse implication (ii)(iv). To proceed, pick , where is taken from (ii). Define the vectors
[TABLE]
Since and are continuous at and since is Lipschitz continuous, we assume without loss of generality that and , where and come from (ii). It follows from (5.20) that . Since is continuous at , we can assume without loss generality that for some we have for all . So we deduce from (5.3) that
[TABLE]
Recall that the distance function {\rm dist}\big{(}\cdot;\Lambda(\bar{x})\big{)} is Lipschitz continuous; so we have
[TABLE]
which in combination with the obtained inequalities leads us to
[TABLE]
This verifies (iv) and completes the proof of the theorem.
To conclude this section, let us mention some connection of the obtained characterizations of noncritical multipliers for variational systems (1.3) with the uniqueness of Lagrange multipliers therein, which is not assumed in Theorem 5.1. Indeed, looking more closely at the proof of theorem reveals that the second term in (5.17) is actually undesired, since it provides complications for the proof. But, as follows from Theorem 4.1, this terms disappears (reduces to ) if the set of Lagrange multipliers is a singleton. This phenomenon has been recently observed in [16] for the case of constrained optimization problems.
6 Noncriticality in Extended Nonlinear Programming
Here we concentrate on problems of composite optimization given by (1.1), where is taken from (1.2). It means that we are dealing with the class of ENLPs discussed in Section 1. Starting with this section we assume that and are not just twice differentiable, but belongs to the class of -smooth mappings around the points in question.
Define the Lagrangian of (1.1) by
[TABLE]
and observe that the KKT system for (1.1) is written as
[TABLE]
Thus (6.2) is a particular case of (1.3) with . Denoting
[TABLE]
the corresponding set of Lagrange multipliers, we have Definition 3.1 of multiplier criticality as well as all the above results being specified for the KKT system (6.2).
On the other hand, there are some phenomena concerning critical and noncritical Lagrange multipliers that distinguish KKT systems in optimization from general variational systems of type (1.3). We consider them in this and two subsequent sections.
The following theorem provides a certain second-order sufficient condition ensuring simultaneously the strict minimality of a feasible solution to ENLP (1.1) and the noncriticality of the corresponding Lagrange multiplier. In its formulation we use the critical cone defined in Theorem 2.1(iii) as well as the notation for the range of a linear operator . Note that the existence of Lagrange multipliers corresponding to in (1.1), which is assumed below, is ensured by the first-order qualification condition (7.3) from Lemma 7.1.
Theorem 6.1
(second-order sufficient condition for strict local minimizers and noncritical multipliers in ENLPs).* Let be a solution to KKT system (6.2). Assume further that the second-order sufficient condition*
[TABLE]
holds. Then there exist numbers and such that the quadratic lower estimate
[TABLE]
holds for the function taken from (1.1). Furthermore, the Lagrange multiplier satisfying (6.4) is noncritical for the KKT system (6.2) corresponding to .
Proof.
Define the family of second-order difference quotients for at for by
[TABLE]
Set and deduce from that . Then for any we get the equalities
[TABLE]
where . It implies together with (2.3) and (2.9) that
[TABLE]
Theorem 2.1(i) tells us that . This means that the inclusion amounts to . Employing the second-order sufficient condition (6.4) together with (6.10) ensures that for all such vectors . Otherwise, we have , and hence . This along with (6.10) results in
[TABLE]
Combining all the above brings us to
[TABLE]
Appealing now to [18, Theorem 13.24] guarantees the existence of numbers and for which the quadratic estimate (6.5) holds and so ensures that is a strict local minimizer for .
Finally, we verify that a multiplier satisfying the second-order condition (6.4) is noncritical for (6.2). To see it, pick fulfilling (3.4) with , i.e., so that
[TABLE]
It follows from and the discussion above that and that . Employing the subdifferential expression in (2.8) gives us
[TABLE]
In this way we arrive at the equalities
[TABLE]
which yield due to (6.4) as well as to . This shows that is a noncritical multiplier of (6.2) corresponding to and thus completes the proof.
The next example, which revisits Example 3.3 in the ENLP framework, illustrates the possibility to use the second-order sufficient condition (6.4) to justify the strict optimality of a feasible solution to (1.1) and the noncriticality of the corresponding Lagrange multiplier.
Example 6.2
(multiplier noncriticality via the second-order sufficient condition).* *Consider the ENLP from (1.1), where , and , and where and are taken from Example 3.3. Then we have
[TABLE]
Let us check that condition (6.4) holds when and , which confirms by Theorem 6.1 that is a strict minimizer for this ENLP and is the corresponding noncritical multiplier. Indeed, it follows from Example 3.3 that , where . By the structure of we have the expressions
[TABLE]
Then and hence . Since , it follows that , and therefore the sufficient condition in Theorem 6.1 reads as
[TABLE]
which is equivalently presented by
[TABLE]
Furthermore, Example 3.3 tells us that and so . Combining this with (6.11), the sufficient condition (6.4) now becomes
[TABLE]
Since from (6.11) is always nonnegative, condition (6.13) holds, and thus it confirms the strict minimality of and the noncriticality of .**
7 Critical Multipliers and Full Stability of Minimizers in ENLPs
This section also deals with constrained minimization problems of the ENLP type and delivers as important message for both theoretical and numerical aspects of optimization. As discussed in Section 1, critical multipliers are particularly responsible for slow convergence of major primal-dual algorithms of optimization and are desired to be excluded for a given local minimizer. It is natural to suppose that seeking not arbitrary while just “nice” and stable in some sense local minimizers allows us to rule out the appearance of critical multipliers associated with such local optimal solutions. It is conjectured in [10] that fully stable local minimizers in the sense of [7] are appropriate candidate for excluding critical multipliers. This conjecture is affirmatively verified in [14] for problems (1.1) with where . Now we are able to extend this result to the general case of (1.2) with an arbitrary symmetric positive-semidefinite matrix .
To proceed, we first specify the definition of fully stable local minimizers from [7] for problems (1.1) with term (1.2). Consider their canonically perturbed version described by
[TABLE]
with parameter pairs . Fix and with and then define the parameter-depended optimal value function for (7.1) by
[TABLE]
together with the parameterized set of optimal solutions to (7.1) given by
[TABLE]
with the convention that when the expression under minimization in (7.2) is . We say that is a fully stable local optimal solution to problem (1.1) if there exist a number and neighborhoods of and of such that the mapping is single-valued and Lipschitz continuous with and that the function is likewise Lipschitz continuous on .
Note that [7, Proposition 3.5] deduces the local Lipschitz continuity of from the basic constraint qualification (7.3) formulated in the following lemma, which is obtained in [18, Exercise 13.26]. The second-order necessary condition presented below can be viewed as a “no-gap” version of the second-order sufficient one used in Theorem 6.1 with the notation therein.
Lemma 7.1
(second-order necessary optimality condition for composite optimization problems).* Let be a local optimal solution to problem (1.1) with taken from (1.2), and let the basic constraint qualification*
[TABLE]
be satisfied, and so . Then we have second-order necessary optimality condition
[TABLE]
valid for all with .
Now we are ready to establish the aforementioned result in the general ENLP setting.
Theorem 7.2
(excluding critical multipliers by full stability of local minimizers).* Let be a fully stable local optimal solution to problem (1.1), and let be taken from (1.2). Then the Lagrange multiplier set in (6.3) is nonempty and does not include critical multipliers.*
Proof.
First we show that the full stability of ensures the validity of the qualification condition (7.3). Indeed, pick any . Select and as . It follows from the full stability of that there exist a Lipschitz constant and the unique solution to problem (7.1) such that
[TABLE]
Since and , we get . This gives us the relationships
[TABLE]
Using estimate (7.5) and letting lead to . Thus the basic constraint qualification (7.3) is satisfied, which ensures that .
Next we pick any and show that it is noncritical for the unperturbed KKT system (6.2) corresponding to . Consider the KKT system for the perturbed problem (7.1) that can be written as
[TABLE]
Let be the solution map to (7.6) given by
[TABLE]
Employing Theorem 5.1, we only need to prove that there exist numbers and as well as neighborhoods of and of such that for any and any , estimate (5.3) holds with replacing by the set of Lagrange multipliers taken from (6.3).
To this end we deduce from the full stability of in (7.1) with due to the result of [14, Proposition 6.1] that there exist neighborhoods of and of for which the set-valued mapping
[TABLE]
admits a Lipschitzian single-valued graphical localization on . This means that there exists a Lipschitzian single-valued mapping such that . Denote , and take so small that . The Lipschitzian single-valued graphical localization property of allows us to find a constant such that for any and any (x_{p_{1}p_{2}},\lambda_{p_{1}p_{2}})\in S_{KKT}(p_{1},p_{2})\cap\big{(}\mathbb{B}_{\varepsilon}(\bar{x})\times\mathbb{B}_{\varepsilon}(\bar{\lambda})\big{)} we have the inclusion , and hence
[TABLE]
Using now the error bound estimate (5.18) from the proof of Theorem 5.1 with replacing by and adjusting if necessary give us the semi-isolated calmness property (5.3), which is equivalent to the noncriticality of that was chosen arbitrary from the Lagrange multiplier set . This therefore completes the proof of theorem.
The result of Theorem 7.2 calls for the deriving verifiable conditions for full stability of local minimizers to (1.1) expressed entirely via the problem data and the given minimizer. Such conditions allow us to efficiently exclude slow convergence of primal-dual algorithms to seek fully stable minimizers based on the initial data. Some characterizations of full stability of local minimizers for ENLPs of type (1.1) are obtained in [14, Theorem 7.3] under rather strong assumptions. Relaxing these assumptions is a challenging goal of our future research.
8 Noncriticality and Lipschitzian Stability of Solutions to ENLPs
In this section we use the machinery developed above to investigate other notions of Lipschitzian stability, which occur to be related to noncriticality of multipliers for ENLPs. The following theorem provides characterizations of both isolated calmness and robust isolated calmness properties of the KKT solution map (7.7) associated with ENLP (1.1) in terms of the second-order sufficient condition (6.4) as well as noncriticality and uniqueness of Lagrange multipliers.
Theorem 8.1
(characterizations of robust isolated calmness of solution maps).* Let be a feasible solution to ENLP (1.1) with taken from (1.2), and let be a corresponding Lagrange multiplier from (6.3). The following assertions are equivalent:*
- (i)
The solution map from (7.7) is robustly isolatedly calm at the point \big{(}(0,0),(\bar{x},\bar{\lambda})\big{)}\in\mathbb{R}^{n+m}\times\mathbb{R}^{n+m}, and is a local optimal solution to (1.1).
- (ii)
The second-order sufficient condition (6.4) holds, and .
- (iii)
, is a local optimal solution to (1.1), and is a noncritical multiplier for (1.3) with that is associated with the optimal solution .
- (iv)
* is isolatedly calm at \big{(}(0,0),(\bar{x},\bar{\lambda})\big{)}, and is a local optimal solution to (1.1).*
Proof.
The outline of the proof is as follows. We sequentially verify implications (ii)(iii), (iii)(iv), (iv)(iii), (iii)(ii), and (i)(iv).
To prove (ii)(iii), assume the validity of (6.4) and that . Then Theorem 6.1 tells us that is a strict local minimizer of (1.1) and that is a noncritical multiplier of (1.3) with corresponding to , and thus (iii) is satisfied.
Suppose next that all the conditions in (iii) hold. Since is noncritical, we derive the semi-isolated calmness of at \big{(}(0,0),(\bar{x},\bar{\lambda})\big{)}. This together with results in the existence of a number as well as neighborhoods of and of such that
[TABLE]
Thus enjoys the isolated calmness property at \big{(}(0,0,(\bar{x},\bar{\lambda}))\big{)}, and we arrive at (iv).
To verify the opposite implication (iv)(iii), let us show that the isolated calmness of at \big{(}(0,0),(\bar{x},\bar{\lambda})\big{)} in (iv) yields . Indeed, suppose on the contrary that is not a singleton. Then there exists with . Since the set is convex, every point of the line segment connecting and belongs to . The isolated calmness of at \big{(}(0,0),(\bar{x},\bar{\lambda})\big{)} amounts to (8.1), and hence we can find with and such that is sufficiently close to , i.e., . Then it follows from (8.1) that
[TABLE]
which yields , a contradiction ensuring that is a singleton. Theorem 5.1 tells us that is a noncritical multiplier of (1.3) corresponding to , and thus (iii) holds.
Next we verify implication (iii)(ii). Let us first deduce from in (iii) that the qualification condition (7.3) in (ii) is satisfied. Supposing the contrary, find a normal with such that . Letting , we get and for the Lagrangian function (6.1). By the choice of and the normal cone definition (2.5) we get from the above that
[TABLE]
which shows that and hence due to . Since , it gives us a contradiction with the assumption of in (iii) and thus justifies the validity of the qualification condition (7.3). Employing now Lemma 7.1 tells us that the second-order necessary optimality condition (7.4) is satisfied.
To finish the verification of (iii)(ii), we need to prove that the second-order sufficient optimality condition (6.4) holds under the assumptions in (iii). Supposing the contrary gives us a nonzero element such that
[TABLE]
Since , it is easy to see that the second-order necessary condition (7.4) can be equivalently written as
[TABLE]
Furthermore, employing the equalities
[TABLE]
allows us to deduce from the equivalent form of the second-order necessary condition that
[TABLE]
This in turn implies that the vector is an optimal solution to the problem
[TABLE]
Applying the subdifferential Fermat rule to the latter problem and then using the elementary sum rule for convex subgradients together with the chain rule from [18, Exercise 10.22(b)] yield
[TABLE]
where the last equality comes from (2.10). Since , it shows by Definition 3.1 that is a critical multiplier. This contradicts the assumption in (iii) that is a noncritical multiplier and therefore verifies the validity of (6.4) and the entire implication (iii)(ii).
Our next step is to prove implication (i)(iv), which clearly holds. To complete the proof of the theorem, it remains to verify implication (iv)(i). To achieve this implication, we only need to show that there are neighborhoods of and of such that for all . To this end, define the set-valued mapping by
[TABLE]
Having already proved (iv) and (iii) are equivalent, we have the qualification condition (7.3) because of the assumptions in (iii). As proved above, (iii) and (ii) are equivalent. Thus the second-order sufficient condition (6.4) is satisfied and implies by Theorem 6.1 that is a strict local minimizer for (1.1). This gives a neighborhood of for which we have
[TABLE]
Applying [9, Theorem 4.37(ii)] to the mapping with the initial point gives us numbers and such that
[TABLE]
where can be chosen such that . Consider now the optimization problem
[TABLE]
It is clear that this problem admits an optimal solution for any pair since the cost function therein is lower semicontinuous while the constraint set is obviously compact. Let us now show that there is a number with such that
[TABLE]
Suppose the contrary and then find sequences and for which . We get without loss of generality that as and so . This yields . Since is an optimal solution to (8.4), it follows that
[TABLE]
for all . Pick any and so large that with . It follows from (8.3) that there exist and satisfying
[TABLE]
Thus , and it follows from (8.6) that
[TABLE]
Passing to the limit at the latter inequality as gives us the estimate
[TABLE]
which holds for all . In particular, we have
[TABLE]
which contradicts (8.2) since and , and thus we arrive at (8.5).
At the last step of the proof, denote by be the set of Lagrange multipliers associated with the optimal solution to problem (8.4). It follows from the validity of the qualification condition (7.3) and its robustness with respect to perturbations of the initial point that this qualification condition is also satisfied for the perturbed problem (8.4). This implies in turn that for all sufficiently close to . Assume without loss of generality that for all , where is taken from (8.5). Using a similar argument as (5.12) and (5.18) via the Hoffman lemma gives us a constant such that for any and any we have
[TABLE]
This clearly proves the existence of a neighborhood of such that for all and so finishes the proof of implication (iv)(i).
The final piece of this paper concerns yet another well-recognized Lipschitzian type property, which seems to be the most natural extension of robust Lipschitzian behavior to set-valued mapping. For this reason we label it as the Lipschitz-like property [9] while it is also known as the pseudo-Lipschitz or Aubin one. It is said that a set-valued mapping/multifunction is Lipschitz-like around if there exists a constant together with neighborhoods of and of such that we have the inclusion
[TABLE]
To formulate a convenient characterization of property (8.8), we recall first the notion of the normal cone to a set at a point defined by
[TABLE]
The coderivative of a set-valued mapping at is given by
[TABLE]
The following characterization of the Lipschitz-like property for any closed-graph mapping around is known as the Mordukhovich criterion from [18, Theorem 9.40], where the proof is different from the original one; see [8, Theorem 5.7] as well as its infinite-dimensional extension given in [9, Theorem 4.10]:
[TABLE]
Note the results obtained therein provide also a precise computation of the exact bound/infimum of Lipschitzian moduli in (8.8) via the coderivative norm at .
Full coderivative calculus developed for coderivatives, which is based on variational/extremal principles of variational analysis and can be found in [11, 9, 18], allows us apply the general characterization (8.9) to specific multifunctions given in some structural forms. The next theorem employs (8.9) and coderivative calculus to characterize the Lipschitz-like property of the solution map (7.7) to the canonically perturbed KKT system (7.6).
Theorem 8.2
(Lipschitz-like property of solution maps).* Let for the solution map defined in (7.7) with taken from (1.2). Then is Lipschitz-like around \big{(}(0,0),(\bar{x},\bar{\lambda})\big{)} if and only if we have the implication*
[TABLE]
Proof.
Consider the mapping from (4.4) with . We easily deduce from the coderivative definition and the form of that
[TABLE]
for all and . Using the structure of and employing the coderivative sum rule in the equality form from [11, Theorem 3.9] yield
[TABLE]
It follows from (8.11) and the coderivative criterion (8.8) that is Lipschitz-like around \big{(}(0,0),(\bar{x},\bar{\lambda})\big{)} if and only if we have the implication
[TABLE]
which leads us together the coderivative representation for in (8.12) to characterization (8.10) of the Lipschitz-like property of the solution map .
Combining finally the obtained characterization of the Lipschitz-like property in Theorem 8.2 with some known facts of variational analysis allows us to reveal a relationship between the latter property of the solution map and its isolated calmness at the same point.
Theorem 8.3
(Lipschitz-like property of solution maps implies their isolated calmness).* Let be the solution map (7.7) of the canonically perturbed KKT system (7.6) with the piecewise linear-quadratic term (1.2), and let . If is Lipschitz-like around \big{(}(0,0),(\bar{x},\bar{\lambda})\big{)}, then it enjoys the isolated calmness property at this point.*
Proof.
Assuming that has the Lipschitz-like property around \big{(}(0,0),(\bar{x},\bar{\lambda})\big{)}, we get implication (8.10) by Theorem 8.2. On the other hand, we proceed similarly to the proof of Theorem 8.2 and get counterparts of the equalities in (8.11) and (8.12) with replacing the coderivative by the graphical derivative therein. The latter one is due to the easily checkable sum rule for graphical derivatives of summations with one smooth term as in (4.4). Having this, we apply the Levy-Rockafellar criterion of isolated calmness (4.3) to the solution map (7.7) and thus conclude that the isolated calmness of at \big{(}(0,0),(\bar{x},\bar{\lambda})\big{)} is equivalent to
[TABLE]
Comparing (8.10) and (8.13), we see that the only difference is in terms involving and . To this end we use derivative-coderivative relationship from [18, Theorem 13.57], which tells us that the inclusion
[TABLE]
holds under the assumptions that are automatically satisfied for the piecewise linear-quadratic function from (1.2). This therefore completes the proof of the theorem.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] J. F. Bonnans and A. Shapiro, Perturbation Analysis of Optimization Problems , Springer, New York, 2000.
- 2[2] C. Ding, D. Sun and L. Zhang, Characterization of the robust isolated calmness for a class of conic programming problems, SIAM J. Optim. SIAM J. Optim. 27 (2017), 67–90.
- 3[3] A. L. Dontchev and R. T. Rockafellar, Implicit Functions and Solution Mappings: A View from Variational Analysis , 2nd edition, Springer, New York, 2014.
- 4[4] A. F. Izmailov, On the analytical and numerical stability of critical Lagrange multipliers, Comput. Math. Math. Phys. 45 (2005), 930–946.
- 5[5] A. F. Izmailov and M. V. Solodov, Newton-Type Methods for Optimization and Variational Problems , Springer, New York, 2014.
- 6[6] A. F. Izmailov and M. V. Solodov, Critical Lagrange multipliers: what we currently know about them, how they spoil our lives, and what we can do about it, TOP 23 (2015), 1–26.
- 7[7] A. B. Levy, R. A. Poliquin and R. T. Rockafellar, Stability of locally optimal solutions, SIAM J. Optim. 10 (2000), 580–604.
- 8[8] B. S. Mordukhovich, Complete characterizations of openness, metric regularity, and Lipschitzian properties of multifunctions, Trans. Amer. Math. Soc. 340 (1993), 1-35.
