Abstract
We establish a solvability criterion for nonautonomous time-evolution inclusions governed by the right-hand side without the convexity assumption. In this study, we examine the problem for some , where F has a closed graph, constrained within the subdifferential operator of a convex, time-dependent potential . This work extends the existing literature, which has primarily focused on the autonomous case or time-dependent mappings with a time-independent convex potential in finite-dimensional spaces. Under novel assumptions that the potential g is convex in the state variable and Lipschitz in time, we establish a solvability criterion. An example of the applicability of our result for nonconvex nonautonomous differential inclusions is stated. As a significant application of our main theorem, we demonstrate that a certain class of implicit nonconvex sweeping processes with an unbounded perturbative term admits solutions.
Keywords:
nonconvex nonautonomous differential inclusions; convex subdifferentials; implicit sweeping processes MSC:
34A60; 26E25; 46N10
1. Introduction
The theory of differential inclusions provides a powerful framework for modeling a vast array of phenomena in nonsmooth mechanics, control systems, and economics, where the dynamics are governed not by a single vector field but by a set-valued one. A fundamental challenge in this domain, which has attracted considerable research interest, is the solvability of differential inclusions governed by nonconvex set-valued mappings.
A significant contribution to this problem was made in [1], providing a core existence theory for autonomous set-valued dynamical systems in a finite-dimensional setting. The authors considered the problem: for any there is in a way that
where F is upper semicontinuous (in short u.s.c.) without the convexity assumption, constrained within the subdifferential operator of a convex, time-dependent potential g, i.e., for any x around .
This seminal work has inspired numerous extensions. For instance, the authors in [2] introduced a Carathéodory univalued perturbation , studying the inclusion . In [3], the author further generalized this framework to include a set-valued perturbation and viability constraints, ensuring the solution remains within a closed set S. Subsequent research, such as [4,5], extended these ideas to the case for a nonconvex Lipschitz function g in both finite and infinite dimension settings. Various other extensions can be found in, e.g., [6,7,8,9,10,11,12,13,14,15].
Despite this extensive literature, the nonautonomous case, where F depends explicitly on time t, remains largely unexplored. To our knowledge, the only attempt in this direction is [16], which considers a time-dependent mapping F with for a time-independent convex function g.
Our primary objective in this work is to bridge this gap by proving that the nonautonomous nonconvex evolution inclusion admits solutions:
Here, F is considered from to with a closed graph in (without the convexity of the values of F), satisfying , where . We suppose that is Lipschitz on , uniformly on bounded sets with respect to x, and for every t, is convex continuous on .
As a second result, we apply our existence result to a class of multivalued dynamical systems called implicit nonconvex sweeping processes. Specifically, we establish the solvability of the inclusion
Here, stands for the Clarke normal cone to . This application underscores the utility of our theoretical findings for modeling complex, controlled dynamical systems.
This paper is structured as follows. Section 2 states the main assumptions and provides the necessary technical lemmas, whose proofs are also included. In Section 3, we state and prove our principal solvability criterion, recorded as Theorem 1. Subsequently, we apply Theorem 1 to deduce the solvability of a class of nonconvex sweeping processes, which is formulated as Theorem 2.
2. Preliminary Lemmas
Throughout this work, the space is assumed to be Hilbert, , , and F assigns to any , a subset of . We will work under the conditions on F:
- F has a closed graph in (with possibly nonconvex values).
- There is satisfying:
- (a)
- For every bounded subset , there is so that
- (b)
- For every , is convex continuous on ;
- (c)
- is continuous on bounded sets for z in and for a.e. ;
- (d)
- uniformly on bounded sets for z, where is a given subset of assumed to be convex compact and is a nondecreasing function.
Establishing that solutions exist for the nonconvex nonautonomous differential inclusion (2) requires first proving several supporting lemmas. We start with the first one.
Lemma 1.
Under the assumptions and in , for any , there exist and so that and ,
Proof.
Fix any and any . Set . By the assumption in , we have for some
Hence, for every ,
By the assumption in , we have that is convex continuous on and so it is bounded on bounded sets; i.e., there is so that
Thus,
That is, g is bounded by M on . Now fix any . By in , is convex continuous on , and since it is bounded by M on , we obtain by a standard result that is Lipschitz on ; that is,
Consequently, by combining (5) and (9) we obtain
for all and all . This ensures (4) with , , and so we establish the desired result. □
We use this lemma to demonstrate the following one.
Lemma 2.
Under the assumptions and in , for any fixed very small and any fixed , the function is u.s.c. on .
Proof.
Fix an arbitrary . Using Lemma 1, we obtain for some such that
Fix any . Let be very small so that . We shall show that
Take any sequence . For sufficiently large n, it holds that and and hence . So, we obtain by (10)
By taking the limsup in this inequality as , we obtain
Therefore, the function is u.s.c. on .
- We have to mention that for the two special cases, and , the sequence converges from the right to 0 in the first case and converges from the left to T in the second case. □
Lemma 3.
Under the same assumptions as in Lemma 2, one has the following:
- (i).
- The function is u.s.c. on , . Here is the support map of .
- (ii).
- For any , and for any with , we have .
Proof.
First, we recall that the support function equals the directional derivative . So, we shall prove the u.s.c. of on for every . Fix . Since is convex continuous, the directional derivative can be reformulated as
From Lemma 2 the function is u.s.c. on , . Therefore,
is the infimum over a countable set and so it is u.s.c., which completes the proof of part .
Let for any with . Then
Taking we derive by the continuity of g
which means that , and hence the proof is complete. □
Lemma 4.
Consider a bounded open set Ω in . Suppose that (a)–(c) in hold. For every sequence of measurable maps with pointwise limit y on I, one has
Proof.
We invoke the dominated convergence theorem for and the function . First, we check the pointwise convergence of to h almost everywhere on I. By the hypothesis of the lemma, we have for all , and so by the assumption (c) in we have for a.e. s on I, is continuous at , and so Let us check the domination assumption. We have by assumption in that the function is Lipschitz with constant on the bounded set . So, it is differentiable almost everywhere on I and for any , which ensures that for a.e. and . Hence, we obtain for a.e. and . Consequently, we deduce
and hence the demonstration is achieved. □
The next result relies on the following one, whose proof appears in Theorem 2 in [17] (see also Lemma 2.2 in [4]).
Lemma 5.
Consider convex continuous and Lipschitz mapping. For a.e. , the set is a singleton and .
Lemma 6.
Assume that the assumptions and in are fulfilled. Consider a Lipschitz mapping y from I to and let . There is so that Φ is Lipschitz on , and for a.e.
Proof.
We commence the proof by showing the Lipschitz continuity of on for time . From Lemma 1, it follows that for some such that
By the Lipschitz continuity of y on I, there is so that
Fix some . Thus, we write
which ensures that . Consequently, we apply (15) with and to write
We now proceed to prove Formula (14). Since is Lipschitz on , it is differentiable a.e. on . We want to show:
Here means the subdifferential of at , and is the derivative of y (exists a.e. since y is Lipschitz on ). Fix arbitrary elements and to be very small so that . Then We start with the difference quotient for the composite function :
This is decomposed into two separate terms by adding and subtracting :
Thus,
Now, we notice that by Lipschitz continuity of g in time on I, there is as so that
By the assumption (c) in , we have that is continuous a.e. on I and uniformly w.r.t. x on bounded sets. Taking we get and . Also, note that both and belong to , and consequently, letting in (18) yields
However, by convexity of , we derive
and
So
Since is Lipschitz over with Lipschitz constant independent of t, the subdifferential is bounded by on , and so for any sequence , the set is bounded and so there is a subsequence weakly convergent to some . Using the u.s.c. of the subdifferential and the property that as and , we obtain . By letting in (19), we get
and since the sequence is taken arbitrarily, we obtain
Using Lemma 5, we have that is a singleton and so , which ensures that
Consequently, we take in (17),
Thus,
□
3. Main Results
We now turn to the core objective of our work: establishing an existence theory for the nonconvex, time-varying set-valued system (2).
Theorem 1.
Under the assumptions and in , for every , there is so that (2) has a Lipschitz solution with .
Proof.
We now establish the strong convergence in . Since it is already known that weakly in and the latter is a Hilbert space, it suffices to demonstrate the norm convergence . To achieve this we set and , and we use Lemma 6 to write
Thus, from (29) we derive
From the construction of the sequence , we obtain
Therefore, we start with the inequality
which holds because of the definition of the subdifferential. Since by construction , we have
Now we insert a zero-sum term and rearrange
Finally, we use the definition to rewrite the last bracket:
Putting everything together gives
Hence, for a.e.
where is defined by . By adding, we obtain
By Lemma 1, there exists some for which is Lipschitz with some constant (independent of t) on the neighborhood for any . Let such that (since is compact). Put . For any , we introduce the following collection of subdivisions of the interval :
Additionally, we introduce the following:
Using the assumption in , we show the Lipschitz continuity of on . Indeed, for any , one has
so is Lipschitz on with Lipschitz constant . Define the sequence of functions by . Then, we have
By assumption in , we have
Hence,
for . Hence is relativ. compact in , . Also, by assumption in , we have
Therefore, all the hypotheses of Arzela-Ascoli theorem (Thm. 4 in [18]) are fulfilled, and so there is a subsequence of , which we still denote by by a slight abuse of notation, that converges unif. to some Lipschitz map and weakly in .
Choose such that and exist, and fix an arbitrary . Combining the weak conv. of to with Mazur’s lemma (see Page 6 in [19]), which guarantees that a point in the weak closure of a set also lies in the strong closure of its convex hull, we obtain the following pointwise characterization:
Thus,
Now, by the limit superior definition,
Therefore, we obtain
By the assumption in , we get
So the above inequalities (24)–(26) ensure
The last inequality results from the u.s.c. of , proved in in Lemma 3.
- Consequently, it follows that
From the Lipschitzness of g w.r.t. , together with the convergence of , , and (uniformly on ), by taking the limsup as in the above inequality we obtain
Using (31), we deduce
By applying (31), we obtain
The first term on the right can be rearranged. Introducing the expression for the time derivative at the limit trajectory yields
Substituting this into the previous inequality gives the refined estimate
Given the measurability of and the pointwise convergence , we may invoke Lemma 4 to obtain
Consequently,
Since the norm is weakly l.s.c. and weakly in , we obtain
Therefore, we deduce that . This entails strongly in . To conclude, we use our construction to rewrite
Employing the assumption , we can let in the above inclusion to obtain (2). This completes the demonstration of the theorem. □
The main result in [1] can be derived straightforwardly from our Theorem 1.
Corollary 1.
Consider to be u.s.c. with closed values. We suppose that there is a convex continuous function so that , Then, , there is such that (1) has at least one Lipschitz solution.
Proof.
It follows from standard convex analysis that a continuous convex function on is locally Lipschitz; therefore, g enjoys this property. There are and so that g is Lipschitz on with Lipschitz constant . This guarantees that . Hence the condition in is satisfied with and (which is compact since ). Therefore, under the assumptions in Corollary 1, all the conditions in Theorem 1 are easily verified and so Theorem 1 is applicable and hence (1) has a Lipschitz solution. □
We now proceed to state a very important and special form of set-valued mappings F depending on both t and x. We define , where C is a given moving set defined from I to with nonempty closed values. Define by
Assume that C verifies the following assumptions:
- There is and so that ;
- There is so that .
- is continuous a.e. on I and uniformly on bounded subsets of .
Notice that g can be reformulated as follows:
Observe that under the assumption and using (33), the assumption (c) in is satisfied for the function g defined in (32). We investigate the basic properties of the function g.
Proposition 1.
, is convex. In addition, under the hypotheses and , , has the Lipschitz property on bounded subsets of .
Proof.
For any , is the supremum of linear functions in x, so it is convex in x. So, we shall prove the Lipschitz property of g in and in x over bounded sets. First, notice that by and , we have that all the values of C are bounded. Indeed,
which guarantees that . Take arbitrary points and arbitrary elements . For every , we pick by definition of the supremum in (32) some in a way that
Also, we have
Combining these two inequalities we obtain
Interchanging x with y and then letting leads to
Let . Fix any and any . It follows from (33) that
We start by writing the difference
Canceling the common term gives
Using the identity for the difference of two squared distances, we obtain
The difference of distances is bounded by the Hausdorff distance between the sets,
Finally, since is assumed to be Lipschitz with constant L in the Hausdorff metric, we have
Putting all estimates together yields
However, for any choice of and , it holds that
Consequently,
Therefore, for any ,
□
- From the above proposition, we have that is Lipschitz on I uniformly on bounded subsets of . Thus, we get the differentiability a.e. on I of uniformly in x on bounded sets, and hence for a.e. and for every , we have
Proposition 2.
Under the assumptions and , the graph of is closed in .
Proof.
Let with . We shall show that . By definition of F we have
Since C is Hausdorff continuous and , we have . We claim that as . Indeed,
That is, . Also, we have . Thus, by taking the limit in (39), we obtain and since , we get by definition of the projection that . Thus F we derived the closedness of the graph in . □
The following proposition is the key tool of our last main result proved in Theorem 2.
Proposition 3.
, one has
Proof.
Take arbitrary elements . If , then we are done. Suppose that . Fix any . Then, for every . Expanding the squared norms, this inequality is equivalent to for all . Canceling the common term and rearranging gives for every . Finally, taking the supremum over yields the equivalent condition . Since , we obtain the equality form
Now fix arbitrary elements . One has
which gives
This yields , and the demonstration is finished. □
Theorem 2.
Suppose that - are fulfilled. Assume also
Then there is and a Lipschitz solution of
Proof.
By virtue of Propositions 1–3, all the hypotheses in Theorem 1 are fverified for this , and so by Theorem 1, there is , for which (2) has at least one Lipschitz solution. □
We present the following example of our finidngs in Theorem 2.
Example 1.
Consider the following nonconvex nonautonomous evolution inclusion: Find such that (2) holds, with
This evolution inclusion can be written in the form of (2) with and for all . Some computations give the following: for , and one has
and . Obviously -, and (41) are verified, and so by Theorem 1 there exists and a Lipschitz solution of (42) a.e. on .
As a final outcome, we present the following existence result for implicit nonconvex sweeping processes.
Theorem 3.
Let C be an arbitrary (without convexity assumption) moving set defined from I to that satisfies -. Suppose also that (41) is satisfied. Then there is so that the implicit nonconvex sweeping process has a Lipschitz map so that
Proof.
All hypotheses in Theorem 2 are fulfilled, and therefore we can choose a time and a Lipschitz trajectory satisfying
Employing the definition of the proximal normal cone, we obtain the inclusion
Consequently, the inclusion (43) holds, which completes the demonstration. □
We state a solvability criterion for the implicit convex process in Hilbert spaces, partially extending Theorem 3.2 in [20]. The complete continuity (which is very restrictive assumption) of the perturbation is not needed in our theorem while it is crucial in Theorem 3.2 in [20]. Also, the perturbation in (43) is not bounded, contrarily to the one used in Theorem 3.2 in [20].
Corollary 2.
Consider to be a moving set with convex closed values. Suppose that C verifies -. Then the implicit convex sweeping process (43) has a Lipschitz solution on for some .
4. Conclusions
In this paper, we have addressed a notable gap in the theory of time-evolution inclusions by extending existence results to the nonautonomous case, where F depends explicitly on time with a closed graph. Building upon the foundational work of Bressan and colleagues [1], as well as subsequent extensions involving perturbations and viability constraints, we have established a solvability criterion for the nonautonomous nonconvex time-evolution inclusion (2) under the hypothesis that F has a closed graph with nonconvex values and , where so that is Lipschitz uniformly with respect to the state variable and , is convex continuous in the state variable.
Our second result demonstrates the applicability of this framework to implicit nonconvex sweeping processes. We have proven the solvability of the problem (43). This extends known results for implicit convex sweeping processes to nonconvex implicit sweeping processes and provides a basis for analyzing systems with nonconvex moving constraints and unbounded additional forcing terms.
Future research may focus on relaxing the regularity assumptions on g, considering more general classes of perturbations, or extending the results to stochastic or Banach infinite-dimensional settings. The application of these results to specific problems in nonsmooth mechanics, optimal control, and hysteresis modeling also presents a promising direction for further investigation.
Funding
The author extends his appreciations to Ongoing Research Funding program, (ORF-2025-1001), King Saud University, Riyadh, Saudi Arabia.
Data Availability Statement
No new data were created or analyzed in this study.
Acknowledgments
The author would like to thank the reviewers for their thorough reading of the manuscript and for their valuable suggestions and remarks. He also gratefully acknowledges the support of the Ongoing Research Funding Program, (ORF-2025-1001), King Saud University, Riyadh, Saudi Arabia.
Conflicts of Interest
The author declares no conflicts of interest.
References
- Bressan, A.; Cellina, A.; Colombo, G. Upper semicontinuous differential inclusions without convexity. Proc. Amer. Math. Soc. 1989, 106, 771–775. [Google Scholar] [CrossRef]
- Cellina, A.; Staicu, V. On evolution equations having monotonicities of opposite sign. J. Differ. Equ. 1991, 90, 71–80. [Google Scholar] [CrossRef]
- Truong, X.D.H. Existence of Viable solutions of nonconvex differential inclusions. Atti. Semi. Mat. Fis. Modena 1999, 47, 457–471. [Google Scholar]
- Bounkhel, M. Existence Results of Nonconvex Differential Inclusions. Portugaliae Math. 2002, 59, 283–310. [Google Scholar]
- Bounkhel, M.; Haddad, T. Existence of viable solutions for nonconvex differential inclusions. Electron. J. Differ. Equ. 2005, 2005, 1–10. [Google Scholar]
- Aitalioubrahim, M. Viability for upper semicontinuous differential inclusions without convexity. Topol. Methods Nonlinear Anal. 2013, 42, 77–90. [Google Scholar]
- Aitalioubrahim, M. Existence of monotone solutions for functional differential inclusions without convexity. Discuss. Math. Differ. Incl. Control Optim. 2017, 37, 101–121. [Google Scholar] [CrossRef]
- Benabdellah, H. Sur une Classe d’equations différentielles multivoques semi continues supérieurement a valeurs non convexes. In Séminaire d’Analyse Convexe; Université des Sciences et Techniques du Languedoc: Montpellier, France, 1991; Exposé No. 6. [Google Scholar]
- Benabdellah, H.; Faik, A. Perturbations convexes et non convexes des équations d’évolution. [Convex and nonconvex perturbations of evolution equations]. Portugal. Math. 1996, 53, 187–208. [Google Scholar]
- Krastanov, M.I.; Ribarska, N.K.; Tsachev, Y. On the existence of solutions to differential inclusions with nonconvex right-hand sides. SIAM J. Optim. 2007, 18, 733–751. [Google Scholar] [CrossRef]
- Lupulescu, V. An existence result for a class of nonconvex functional differential inclusions. Acta Univ. Apulensis Math. Inform. 2005, 9, 49–56. [Google Scholar]
- Rossi, R.; Savaré, G. Gradient flows of non convex functionals in Hilbert spaces and applications. ESAIM Control Optim. Calc. Var. 2006, 12, 564–614. [Google Scholar] [CrossRef]
- Rossi, R.; Savaré, G. Existence and approximation results for gradient flows. Atti Della Accad. Naz. Dei Lincei. Cl. Di Sci. Fis. Mat. E Nat. Rend. Lincei. Mat. E Appl. 2004, 15, 183–196. [Google Scholar]
- Cardinali, T.; Colombo, G.; Papalini, F.; Tosques, M. On a class of evolution equations without convexity. Nonlinear Anal. 1997, 28, 217–234. [Google Scholar] [CrossRef]
- Papalini, F. Existence of solutions for differential inclusions without convexity. Rend. Istit. Mat. Univ. Trieste 1992, 24, 193–206. [Google Scholar]
- Kánnai, Z.; Tallos, P. Viable solutions to nonautonomous inclusions without convexity. CEJOR Cent. Eur. J. Oper. Res. 2003, 11, 47–55. [Google Scholar]
- Valadier, M. Entrainement unilateral, lignes de descente, fonctions lipschitziennes non pathologiques. CRAS Paris 1989, 308, 241–244. [Google Scholar]
- Aubin, J.P.; Cellina, A. Differential Inclusion; Springer: Berlin/Heidelberg, Germany, 1984. [Google Scholar]
- Ekeland, I.; Temam, R. Convex Analysis and Variational Problems; Studies in Mathematics and its Applications; North-Holland: New York, NY, USA, 1976; Volume 1. [Google Scholar]
- Bounkhel, M. Implicit differential inclusions in reflexive smooth Banach spaces. Proc. Amer. Math. Soc. 2012, 140, 2767–2782. [Google Scholar] [CrossRef]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content. |
© 2025 by the author. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).