On Lipschitz-like continuity of a class of set-valued mappings
Ewa M. Bednarczuk, Leonid I. Minchenko, Krzysztof E. Rutkowski

TL;DR
This paper investigates the Lipschitz-like continuity of set-valued mappings derived from parametric systems of equalities and inequalities, establishing conditions under relaxed constraint qualifications.
Contribution
It introduces new conditions for Lipschitz-like continuity of set-valued mappings based on relaxed constant rank constraint qualification.
Findings
Lipschitz-like continuity holds under relaxed conditions
Provides theoretical framework for parametric systems
Extends previous results with weaker assumptions
Abstract
We study set-valued mappings defined by solution sets of parametric systems of equalities and inequalities. We prove Lipschitz-like continuity of these mappings under relaxed constant rank constraint qualification.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
On Lipschitz-like continuity of a class of set-valued mappings
Ewa M. Bednarczuk1
,
Leonid I. Minchenko2
and
Krzysztof E. Rutkowski3
Abstract.
We study set-valued mappings defined by solution sets of parametric systems of equalities and inequalities. We prove Lipschitz-like continuity of these mappings under relaxed constant rank constraint qualification.
Key words and phrases:
set-valued mappings, parametric optimization, relaxed constant rank constraint qualification, R-regularity, pseudo-Lipschitz continuity, Lipschitz-like continuity, Aubin property
2010 Mathematics Subject Classification:
41A50, 46C05, 49K27, 52A07, 90C31.
1 Systems Research Institute of the Polish Academy of Sciences, Warsaw University of Technology
2 Belarus State University of Informatics and Radioelectronics, Minsk, Belarus
3 Warsaw University of Technology, Systems Research Institute of the Polish Academy of Sciences
1. Introduction
Properties of set-valued mappings given by systems of equalities and inequalities play a significant role in parametric optimization. In particular, considerable effort is directed towards formulating conditions ensuring Lipschitz-type continuities of these mappings, namely their calmness and the pseudo-Lipschitz continuity (also referred to as Lipschitz-like continuity or the Aubin property) [1, 13, 18, 19, 24].
The present paper is devoted to sufficient conditions for R-regularity (Definition 2.5) and pseudo-Lipschitz continuity for set-valued mappings defined by solution sets of parametric constrained systems. R-regularity is a variant of a much more general property, called metric regularity, intensively studied in [8, 9, 11, 16, 17, 21].
Let be a Hilbert space and be a normed space. Let us consider a parametric nonlinear programming problem:
[TABLE]
where is a parameter, stands for the decision variable, , (we admit the case ). Functions , , are assumed to be (jointly) continuous together with their partial gradients with respect to , and , .
In the present paper we prove Lipschitz-likeness of the set-valued mapping defined in (1.1). We generalize results from [25] and [3]. In [25] the respective results are obtained under stronger assumptions of functions , , while in [3] the Lipschitz-likeness of is obtained for , , where , , , are locally Lipschitz functions. We also correct the mistake in the proof of Lemma 3 of [25].
For set-valued mapping defined in (1.1), its domain and graph are defined by and , respectively.
The tangent cone and the linearized cone to at are defined, respectively, as follows
[TABLE]
Organization of the paper is as follows. In section 2 we provide basing concepts. Section 3 is devoted to the concept of regularity. In section 4 we investigate relationships between relaxed constant rank condition and the R-regularity of . In section 5 we prove Lipschitz-likeness of under relaxed constant rank condition. In section 6 some applications to bilevel programming are discussed.
2. Basic concepts and definitions
This section contains some background material (see, i.e., [1, 15, 19, 22, 24, 26]) which will be used in the sequel.
We denote , , where is the open unit ball centered at [math] in the respective space, is the distance between point and set , where is the norm of vector .
Definition 2.1**.**
A set-valued mapping is lower semicontinuous (lsc) at (relative to ) if for any neighbourhood there is a neighborhood such that for all (for all ).
Definition 2.2**.**
A set-valued mapping is lower Lipschitz continuous at (relative to ) if there exist positive numbers and such that
[TABLE]
Note that (2.1) implies that for any , if .
Definition 2.3**.**
A set-valued mapping is Lipschitz-like (pseudo-Lipschitzian) (relative to ) at (where ) if there exist a number and neighbourhoods and such that
[TABLE]
for all ().
Let , and be the set of indices of active inequality constraints at . Following [24, 25] we define the relaxed constant rank constraint qualification (RCRCQ) which generalizes the constant rank constraint qualification introduced by Janin [18].
Definition 2.4**.**
The set-valued mapping satisfies the Relaxed Constant Rank Constraint Qualification, or shortly, RCRCQ (relative to ) at , if for any index set
[TABLE]
in a neighbourhood of (for from this neighbourhood).
The set satisfies RCRCQ at if for any index set
[TABLE]
for all in a neighbourhood of .
Clearly, if the set-valued mapping satisfies RCRCQ at , then it satisfies RCRCQ at all points in some neighbourhood of .
The following lemma proves the equality under RCRCQ. In the finite dimensional case, where this fact has been proved in Theorem 1 of [24]. In the infinite-dimensional case considered in the present paper this fact has been proved in Theorem 6.3 of [2].
Lemma 2.1**.**
([2, 24]). Let the set-valued mapping satisfy RCRCQ (relative to ) at . Then there exist neighborhoods and such that for all and all .
Proof.
As already noted, if satisfies RCRCQ at , there are neighbourhoods and such that satisfies RCRCQ at any point where , . Hence, the set satisfies RCRCQ at and by Theorem 6.3 of [2], . ∎
Following [12, 22] we define the R-regularity of set-valued mappings.
Definition 2.5**.**
The set-valued mapping is R-regular at (relative to ) if there exist a number and neighbourhoods and such that
[TABLE]
The concept of R-regularity appears in different works (see e.g. Theorem 2.84 and formula (2.164) of [4], formula (10) of [10]). When , , the R-regularity is equivalent to the metric regularity of , where (see formulas (2.143), (2.144) of [4]). In the paper [20], some variants of (2.5) have been investigated (see e.g. formula (6) of [20]).
3. Criterion of R-regularity
Let and . The set is the solution set to the problem
[TABLE]
The problem (3.1) can be equivalently reformulated as
[TABLE]
Lagrange multiplier sets for problem (3.1) are defined as follows
[TABLE]
Lemma 3.1**.**
(Proposition 7.1 of [2], Theorem 1 of [24]). Suppose that is a solution to (3.1) for and . Assume the set-valued mapping satisfies RCRCQ (relative to ) at . Then .
The following theorem generalizes Theorem 2 [25] and Theorem 4.1 [14] to parametric systems defined by the set-valued mapping .
Theorem 3.1**.**
Let and the set-valued mapping be l.s.c. at relative to . The following assertions are equivalent:
- (a)
the set-valued mapping is R-regular at relative to ; 2. (b)
there exists a number such that for any sequences , the inequality holds for all and sufficiently large.
Proof.
If , the theorem is obviously valid. Assume that .
The implication follows from a slight modification in the first part of the proof of Theorem 2 [25]. 2. 2)
. On the contrary, suppose that is not R-regular relative at . Then there exist sequences and , such that for all
[TABLE]
Take any . Due to (b) there exists a vector such that and
[TABLE]
It follows from the lower semicontinuity of at that there exists a sequence such that . Then and, therefore, .
In virtue of the boundedness of the sequence and of the condition , for , by (3.4), for all sufficiently large we obtain
[TABLE]
The latter inequality implies
[TABLE]
which contradicts (3.3). Thus .
∎
Remark 3.2**.**
Theorem 3.1 is a generalization of Theorem 2 [25]. Unlike Theorem 2 [25] it does not require Lipschitz continuity of gradients for . Theorem 3.1 considers also more general notion of R-regularity relative .
Remark 3.3**.**
As follows from the proof of Theorem 2 [25] the implication holds without the assumptions of lower semicontinuity of at .
Remark 3.4**.**
Let us note that Lemma 3 of [25] is a consequence of Theorem 3.1 and Theorem (4.1) below, which says that RCRCQ for at and lower Lipschitz continuiuty of at implies -regularity of at .
In [3] we discussed in details the proof of Lemma 3 of [25] for some special functions , . The proof of Theorem 3.1 together with Theorem 4.1 fill some gaps in the proof of Lemma 3 of [25].
The example below shows that the assertion of Theorem 3.1 may not hold if is not lsc at a point .
Example 3.5**.**
Let , . Then for all , for and for . Consider the point , where , .
Evidently, is not lsc at . Let us take , , where . It is easy to see that for given and the R-regularity condition does not hold if is sufficiently small.
The following technical observation will be used in the sequel.
Proposition 3.6**.**
Let . Assume that RCRCQ holds for the set-valued mapping given by (1.1) at and for . Then there exist neighbourhoods , and an index set , such that for all vectors , are linearly independent.
Proof.
The assertion is valid if , are linearly independent. Suppose that , are linearly dependent. By RCRCQ there exist neighbourhoods , such that
[TABLE]
Let . Then there exists indices , for such that are linearly independent. Denote . Then, by the continuity of gradients of , with respect to variable , , are linearly independent in some neighbourhood of . ∎
In view of Proposition 3.6, RCRCQ implies that there exists a subset of indices of parametric system defined by the set-valued mapping such that
[TABLE]
for in some neighbourhood of .
4. Relaxed constant rank condition and R-regularity
It is known [5, 22] that the Mangasarian-Fromovitz constraint qualification (MFCQ) [23] for the set at a point implies R-regularity of the set-valued mapping at .
We show that RCRCQ implies R-regularity of the set-valued mapping .
Theorem 4.1**.**
*Assume that 1) is lsc at relative to ;
- satisfies RCRCQ at relative to .*
Then is R-regular at relative to .
Proof.
By Theorem 3.1, R-regularity of the mapping at is equivalent to the fact that there exists a number such that for any sequences , the inequality holds for all and sufficiently large.
On the contrary, suppose that there exist sequences , , such that , and
[TABLE]
Due to the fact that without loss of generality, we can assume that for each , , and for any we have . In consequence, .
As already noted, if RCRCQ holds at , then RCRCQ holds also at all points close to . Without loss of generality, we can assume that RCRCQ holds at all , . Consequently, by Lemma 3.1, for all .
Without loss of generality, we can assume that , where by RCRCQ, is such that for any ,
[TABLE]
By Lemma 2.1, and by the necessary optimality conditions for problem (3.2)111In the literature it is often assumed that Robinson constraint qualification holds (see for example [4]). However, it is enough to assume that the coincides with feasible set to the linearized problem to (3.2) (see discussion after Lemma 3.7 of [4]). we have
[TABLE]
where , and , , . Recall that and , , are related to the set via the relationship
[TABLE]
for some .
By Proposition 3.6, there exist neighbourhoods , and indices , such that for all vectors , are linearly independent. Hence, without loss of generality we can assume that , and for every , we have
[TABLE]
for some , .
Hence we can rewrite (4.3) as follows
[TABLE]
where , , are linearly independent.
Passing to a subsequence, if necessary, we may assume that for all , is a fixed set, i.e., .
By [3, Lemma 2] we have that for any there exists such that
[TABLE]
where , and , are linearly independent. Hence we can rewrite (4.4) as
[TABLE]
Again, passing to a subsequence, if necessary, we may assume that is a fixed set.
Put , , and , . Let us denote . We have and, by (4.1), . Without loss of generality we may assume that . From (4.5) we have
[TABLE]
By passing to the limit in (4.6) we obtain
[TABLE]
where . This contradicts the fact that for
[TABLE]
i.e. vectors are linearly independent. ∎
5. Lipschitz-likeness of
The following theorem provides the relationships between R-regularity and pseudo-Lipschitzness of the set-valued mapping defined on a normed space .
Theorem 5.1**.**
Assume that is R-regular at a point relative to . Then is pseudo-Lipschitzian at this point relative to .
Proof.
If is R-regular at a point relative to , this means that there are numbers ,, such that
[TABLE]
for all and all .
Denote where are Lipschitz constants for functions on some set . Choose numbers and such that . Then
[TABLE]
for all .
This means that is Lipschitz lower continuous at relative to and, consequently (see (2.1)), for all , where . Let and let . Then, from (5.1) follows
[TABLE]
The last inequality is equivalent to
[TABLE]
∎
Remark 5.2**.**
Let us note that in Theorem 5.1 we only need to assume that all the functions and , are locally Lipschitz continuous (may not be differentiable) near .
By Theorem 4.1 we obtain the following result
Theorem 5.3**.**
*Assume that 1) is lsc at relative to ;
- satisfies RCRCQ at relative to .*
Then is pseudo-Lipschitzian at this point relative to .
Let us note that for some particular functions , Theorem 5.3 has been already proved in [3].
In the finite-dimensional setting, when both and are finite-dimensional spaces the results analogous to Theorem 5.3 can be obtained via properties of the optimal value function defined as and the solution set .
Definition 5.4**.**
Let . A mapping is locally bounded at if there exist a neighborhood and a bounded set such that for all .
Theorem 5.5**.**
*Assume that 1) F is locally bounded at and functions are Lipschitz continuous on a set , where ;
- is R-regular at relative to .
Then is Lipschitz continuous on some set .*
Proof.
Let and be Lipschitz constants for and on a set . Then due to Lemma 3.68 [22]
[TABLE]
Let us take any and . Then without loss of generality
[TABLE]
Similarly, one can obtain ∎
6. Application to bilevel programming
Consider a bilevel programming problem (BLPP):
[TABLE]
where is defined in (1.1), , functions , , and are continuously differentiable (see e.g. monograph [7]).
The point is said to be a feasible point to the problem (6.4) if , . A feasible is called a solution (local solution) of the problem (6.4) if for all feasible points (for all feasible points from some neighborhood of ).
The problem (6.4) can be equivalently reformulated as the following one-level problem
[TABLE]
where is the optimal value function of the lower-level problem. Main difficulty in solving problem (6.5) comes from the nonsmoothness of the value function . Ye and Zhu [27] introduced the concept of partial calmness which allowed to move the nonsmooth constraint from the feasible set to the objective function.
Let be a feasible point of the problem (6.4). The problem (6.4) in the form (6.5) is called partially calm at , if there exist a number and a neighborhood of the point in such that for all such that , , .
In [27] it was proved that the problem (6.4) in the form (6.5) is partial calm at its local solution if and only if there exists a number such that is a local solution of the partially penalized problem
[TABLE]
Ye and Zhu [27] showed that the problem (6.4) with a linear in lower-level problem is partially calm.
Let us define the set-valued mapping and consider the bilevel program (6.4) under the following assumption:
- (H1)
.
Denote . Introduce the sets
[TABLE]
and
Theorem 6.1**.**
Let be a local solution of problem (6.4). Suppose that the mapping is R-regular at and the function is Lipschitz continuous on the set with Lipschitz constant . Then there exists a number such that for any the point is a local solution to the problem
[TABLE]
Proof.
It follows from (H1) that for all . In virtue of Proposition 2.4.3 of [6], for all , the point is a solution of the problem
[TABLE]
Then for all and, therefore, .
Since R-regularity for implies R-regularity for the set-valued , there exists a neighbourhood such that for all . The last inequality is equivalent to the assertion of the theorem with . ∎
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] Jean-Pierre Aubin. Lipschitz behavior of solutions to convex minimization problems. Math. Oper. Res. , 9(1):87–111, 1984.
- 2[2] Ewa M. Bednarczuk, Krzysztof W. Leśniewski, and Krzysztof E. Rutkowski. On tangent cone to systems of inequalities and equations under relaxed constant rank condition. ar Xiv e-prints , page ar Xiv:1905.05581, May 2019.
- 3[3] Ewa M. Bednarczuk and Krzysztof E. Rutkowski. On Lipschitz-like property for polyhedral moving sets. ar Xiv e-prints , page ar Xiv:1811.05166, Nov 2018.
- 4[4] J. Frédéric Bonnans and Alexander Shapiro. Perturbation analysis of optimization problems . Springer Series in Operations Research. Springer-Verlag, New York, 2000.
- 5[5] J. M. Borwein. Stability and regular points of inequality systems. J. Optim. Theory Appl. , 48(1):9–52, 1986.
- 6[6] Frank H. Clarke. Optimization and nonsmooth analysis . Canadian Mathematical Society Series of Monographs and Advanced Texts. John Wiley & Sons, Inc., New York, 1983. A Wiley-Interscience Publication.
- 7[7] Stephan Dempe. Foundations of bilevel programming , volume 61 of Nonconvex Optimization and its Applications . Kluwer Academic Publishers, Dordrecht, 2002.
- 8[8] Andrei V. Dmitruk and Alexander Y. Kruger. Metric regularity and systems of generalized equations. J. Math. Anal. Appl. , 342(2):864–873, 2008.
