Converse Lyapunov Functions for Inclusions 2 Basic denitions Given a set A, A stands for the closure of A, A stands for the interior set of A, coa sta
|
|
- Clare Small
- 5 years ago
- Views:
Transcription
1 A smooth Lyapunov function from a class-kl estimate involving two positive semidenite functions Andrew R. Teel y ECE Dept. University of California Santa Barbara, CA teel@ece.ucsb.edu Laurent Praly Centre Automatique et Systemes Ecole des Mines de Paris 35 rue St. Honore Fontainebleau cedex, FRANCE praly@cas.ensmp.fr Submitted to Journal of Dierential Equations, June 15, 1999 Abstract We consider dierential inclusions where a positive semidenite function of the solutions satises a class-kl estimate in terms of time and a second positive semidenite function of the initial condition. We show that a smooth converse Lyapunov function, i.e., one whose derivative along solutions can be used to establish the class-kl estimate, exists if and only if the class-kl estimate is robust, i.e., it holds for a larger, perturbed dierential inclusion. It remains an open question whether all class-kl estimates are robust. One sucient condition for robustness is that the original differential inclusion is locally Lipschitz. Another sucient condition is that the two positive semidenite functions agree and a backward completability condition holds. These special cases unify and generalize many results on converse Lyapunov theorems for dierential equations and dierential inclusions that have appeared in the literature. Corresponding author. y Research supported in part by the NSF under grant ECS and by the AFOSR under grant F
2 Converse Lyapunov Functions for Inclusions 2 Basic denitions Given a set A, A stands for the closure of A, A stands for the interior set of A, coa stands for the closed convex hull of A stands for the boundary of A. The notation 1 indicates a sequence of points x belonging to A converging to a point on the boundary of A or, if A is unbounded, having the property jxj! 1. Given a closed set A R n and a point x 2 R n, jxj A denotes the distance from x to A. A function : R0! R0 is said to belong to class-k ( 2 K) if it is continuous, zero at zero, and strictly increasing. It is said to belong to class-k 1 if, in addition, it is unbounded. A function : R0 R0! R0 is said to belong to class-kl if, for each t 0, (; t) is nondecreasing and lim s!0 + (s; t) = 0, and, for each s 0, (s; ) is nonincreasing and lim t!1 (s; t) = 0. The requirements imposed for a function to be of class-kl are slightly weaker than usual. In particular, (; t) is not required to be continuous or strictly increasing. See, also, Remark 2. 1 Introduction 1.1 Background In the same text [19] where Lyapunov introduced his famous sucient conditions for asymptotic stability of the origin of a dierential equation _ = f(; t) ; (1) we can nd the rst contribution [19, x20, Theorem II] to the converse question: what aspects of asymptotic stability and the function f guarantee the existence of a (smooth) function satisfying Lyapunov's sucient conditions for asymptotic stability? The answers have proved instrumental, over the years, in establishing robustness of various stability notions and have served as the starting point for many nonlinear control systems design concepts. One of the early important milestones in the pursuit of smooth converse Lyapunov functions was Massera's 1949 paper [21] that provided a semi-innite integral construction for time-invariant, continuously dierentiable systems with an asymptotically stable equilibrium. Later, in 1954, Malkin observed that Massera's construction worked even for time-varying systems as long as the asymptotic stability and the dierentiability of f with respect to the state were uniform in time [20]. Regarding stability Malkin assumed, in eect, the existence of a class-kl function such that the solutions (t; t ; ) of the system (1), issued from at time t, satisfy j(t; t ; )j (j j; t? t ) 8t t 0 (2)
3 Converse Lyapunov Functions for Inclusions 3 at least for initial conditions suciently small. In [5], Barbashin and Krasovskii generalized Malkin's result to the case where (2) holds for all initial conditions. Both Massera [22] and Kurzweil [15], independently in the mid-1950's, weakened the assumptions made by Malkin, and Barbashin and Krasovskii about the function f(; t). Kurzweil's contribution especially stands out because he was able to establish a converse theorem even when f(; t) is only continuous so that uniqueness of solutions is not guaranteed. In his work he made precise a notion of strong stability of the origin on an open neighborhood G of the origin which amounted to the existence of a function 2 KL and a locally Lipschitz, positive denite function! : G! R0, proper on G, such that all solutions of the system (1) satisfy!((t; t ; )) (!( ); t? t ) t t 0 : (3) Kurzweil showed that this strong stability and continuity of f(; t) imply the existence of a smooth converse Lyapunov function, i.e., a function whose derivative along solutions can be used to deduce (3). Much of the research in the 1960's focused on developing converse Lyapunov theorems for systems possessing asymptotically stable closed, not necessarily compact, sets. Taking this approach, the time-varying case can be subsumed into the time-invariant case by augmenting the state-space of (1) as: _x = d f(; p) = =: F (x) ; x dt p 1 = : (4) t (One disadvantage in treating time-varying systems as time-invariant ones is that it usually leads to imposing stronger than necessary conditions on the time-dependence of the righthand side, e.g., continuity where only measurability is needed. An example where a converse theorem is developed for systems with right-hand sides measurable in time, and for Lyapunov and Lagrange stability, is [4].) A closed set A for (4) is said to be uniformly asymptotically stable if there exists of a function 2 KL such that all solutions of (4) with jx j A suciently small exist for all forward time and satisfy j(t; x )j A (jx j A ; t) 8t 0 : (5) Some of the early results on converse Lyapunov functions for set stability are summarized in [39]. Particularly noteworthy are the result of Hoppensteadt [14] who generated a C 1 converse Lyapunov function for parameterized dierential equations and the result of Wilson [38] who provided a smooth converse Lyapunov function for uniform asymptotic stability of a set. Converse theorems for (compact) set stability for nonlinear dierence equations are also now standard (see, e.g., [32, Theorem 1.7.6]). Noting that every solution (t; x ) of (4) can be written as (t + t ; t (t; x ) = ; ) (6) t + t where (; t ; ) is a solution of (1), it follows that (2), (3) and (5) are all particular cases of the estimate!((t; x )) (!(x ); t) 8t 0 (7)
4 Converse Lyapunov Functions for Inclusions 4 where! is a continuous, positive semidenite function. In the 1970's, Lakshmikantham and coauthors [17] (see also [16, Section 3.4]) provided a Lipschitz converse Lyapunov function for Lipschitz ordinary dierential equations of the form (4) under an assumption essentially the same as: given two continuous, positive semidenite functions! 1 and! 2, there exists a function 2 KL such that, for all initial conditions x with! 2 (x ) suciently small, all solutions exist for all forward time and satisfy! 1 ((t; x )) (! 2 (x ); t) 8t 0 : (8) The stability concept described by (8), apparently rst introduced in [27] and often called stability with respect to two measures, generalizes (7) and thus includes the notions of local uniform asymptotic stability of a point, of a prescribed motion and of a closed set. It also covers the notion of local uniform partial asymptotic stability such as when, for x suciently small, jh((t; x ))j (jx j; t) 8t 0 (9) where y = h(x) is a continuous (output) function of the state. A smooth converse Lyapunov theorem for the global version of (9) was recently derived in [31, Theorem 2]. (See [37] for a survey on the partial stability problem.) Extensions of the above results to dierential inclusions started to appear in the late 1970's with some of the most general results appearing only recently. Some motivations for the study of dierential inclusions are: 1) they describe the solution set for ordinary dierential equations with arbitrary, measurable bounded disturbances (see Footnote 1 below), and 2) they describe important notions of solutions for control systems that use discontinuous feedbacks. (see [12, x8.3].) The results in [23] pertain to dierential inclusions of the form _x 2 F (x) := co fv 2 R n : v = f(x; d) ; d 2 Dg (10) where D is compact, f(x; d) is continuous and continuously dierentiable with respect to x, and asymptotic stability in the rst approximation is assumed, i.e., for the inclusion an estimate of the form _x 2 v 2 R n : (0; d)x ; d 2 D ; (11) jx(t)j kjx(0)j exp(?t) k > 0 ; > 0 (12) is assumed for all solutions starting from suciently small initial conditions. The result [23, Theorem 2] states that this assumption implies the existence of a smooth converse Lyapunov function for local exponential stability and asymptotic stability on the basin of attraction of the origin for the inclusion (10). Related results for inclusions of the type (11) can also be found in [24, 25, 26]. In [18], Lin and coauthors considered the dierential inclusion (10), relaxing the continuous dierentiability assumption of f with respect to x to a local Lipschitz assumption, and
5 Converse Lyapunov Functions for Inclusions 5 assumed the estimate (5), i.e., the estimate (8) with! 1 (x) =! 2 (x) = jxj A, for all initial conditions. 1 They showed, under the additional assumption that either A is compact or all solutions exist for all backward time, that the estimate (5) for the dierential inclusion (10) implies the existence of a smooth converse Lyapunov function. In [1], the authors combined the ideas of [18] with the idea of Kurzweil [15] establishing the existence of a smooth converse Lyapunov function for the dierential inclusion (10) in the case of the existence of a compact set A, a neighborhood G of A and function! : G! R0 that is locally Lipschitz, positive denite with respect to A and proper with respect to G and a function 2 KL such that, for all x 2 G, the solutions of (10) satisfy!((t; x )) (!(x ); t) 8t 0 : (13) The rst results on smooth converse theorems for dierential inclusions that are only upper semicontinuous (see Denition 1 below) appeared in [6]. In that work, Clarke and coauthors studied _x 2 F (x) (14) under the assumption that F (x) is nonempty, compact and convex for each x 2 R n and F (x) is upper semicontinuous. They assumed the estimate (8) with! 1 (x) =! 2 (x) = jxj, and showed that this implies the existence of a smooth converse Lyapunov function. A related result, for the case of uniform exponential stability for switching systems, can be found in [9]. Other interesting results on the existence of nondierentiable converse Lyapunov functions can be found in [2, Chapter 6] and [34, 35, 36]. 1.2 Contributions In this paper, we consider dierential inclusions _x 2 F (x) (15) that satisfy the conditions assumed in [6]. In particular, F (x) is a set-valued map from an open set G to subsets of R n that is upper semicontinuous on G (see Denition 1) and is such that F (x) is nonempty, compact and convex for each x 2 G. The stability property we will assume for (15) we will refer to as \KL-stability with respect to (! 1 ;! 2 ) on G". Namely, given two continuous functions! 1 : G! R0 and! 2 : G! R0, we assume the existence of 1 More precisely, [18] considers systems of the form _x = f(x; d(t)) where d(t) belongs to the set of measurable functions taking values in the compact set D. It is known (see [11] or [7, problem ], for example) that the solutions of this system are exactly the solutions of the dierential inclusion _x 2 F (x) := fv 2 R n : v = f(x; d) ; d 2 Dg. Also, since this F (x) is a nonempty, compact, locally Lipschitz set-valued map under the assumptions of [18], it is known (see, for example, [3, Corollary ]) that the closure of the solution set of _x 2 F (x) is exactly the solution set of _x 2 cof (x). Thus, the result [18, Proposition 5.1] shows that if the solutions of _x 2 F (x) exist for all forward time and satisfy (5) then the same is true for the solutions of _x 2 cof (x).
6 Converse Lyapunov Functions for Inclusions 6 a class-kl function such that all solutions of the dierential inclusion (15) starting in G remain in G for all forward time and satisfy! 1 ((t; x )) (! 2 (x ); t) 8t 0 : (16) (See also Denition 6). This is like the stability property considered in [17]. Our main result is (see Theorem 1): A smooth converse Lyapunov function for KL-stability with respect to (! 1 ;! 2 ) (see Denition 7) exists if and only if the KL-stability is robust, i.e., it holds for a larger, perturbed dierential inclusion (see Denition 8). This type of equivalence between robust stability and the existence of a Lyapunov function, reminiscent of the classical \total stability" results for ordinary dierential equations [13, Theorem 56.4], is already present in the proofs of Kurzweil [15] and Clarke, et al., [6]. It remains an open question whether KL-stability with respect to (! 1 ;! 2 ) is robust, in general. However, we will show (see Theorem 2): If the dierential inclusion (15) is locally Lipschitz on G (see Denition 3) then KL-stability with respect to (! 1 ;! 2 ) on G is robust. This is the case for the problems consider by Lakshmikantham, et al. [16], Lin, et. al. [18], and Sontag and Wang [31, Theorem 2]. We will also show (see Theorem 3): If the dierential inclusion (15) is backward completable by!-normalization (see Denition 9) then KL-stability with respect to (!;!) on G is robust. This condition holds for the problems considered by Kurzweil [15] (see Corollary 1) and Clarke, et al. [6] (see Corollary 2). It is also useful for generating smooth converse Lyapunov functions for compact, stable attractors. As an illustration, we provide a smooth converse Lyapunov function for nite time convergence to a compact set from a larger compact set (see Corollary 3). This result is useful for the problem of semiglobal practical asymptotic stabilization of nonlinear control systems as studied in [33], for example. Our converse Lyapunov function is constructed in the following steps : 1. We imbed the original dierential equation or dierential inclusion into a larger, locally Lipschitz dierential inclusion that still exhibits KL-stability with respect to (! 1 ;! 2 ). This idea is due to Kurzweil [15] for the case of ordinary dierential equations with continuous right-hand side under strong stability of the origin. It is due to Clarke and co-authors [6] for the case of nonempty, compact, convex, upper semicontinuous dierential inclusions and global asymptotic stability of the origin. In general, it is possible if and only if the KL-stability with respect to (! 1 ;! 2 ) is robust. 2. We nd class-k 1 functions e 1 and e 2 such that e 1 ((s; t)) e 2 (s)e?2t, where quanties KL-stability with respect (! 1 ;! 2 ) for the locally Lipschitz dierential inclusion constructed in step 1. A recent result by Sontag [30, Proposition 7] shows that this is always possible.
7 Converse Lyapunov Functions for Inclusions 7 3. We dene a trial Lyapunov function V 1 (x) as the supremum, over time and solutions (; x) of the locally Lipschitz dierential inclusion constructed in step 1, of the quantity e 1 (! 1 ((t; x)))e t where e 1 was constructed in step 2. This is a classical construction once the estimate in step 2 is available, at least for locally Lipschitz ordinary dierential equations where the supremum over solutions is not needed. (See, e.g., [39, x19].) We show, using many of the tools used in [6] and [18], that this trial Lyapunov function has all of the desired properties except smoothness. However, it is locally Lipschitz. It would only be upper semicontinuous, in general, if the supremum were taken over solutions of the original dierential inclusion. 4. We smooth the trial Lyapunov function using ideas that go back to Kurzweil [15] and that have been claried, generalized and used over the years by, for example, Wilson [38], Lin, et al., [18] and Clarke, et al. [6]. The rest of the paper is organized as follows: In Section 2 we present some denitions related to set-valued maps and some properties of solutions to dierential inclusions. These denitions are needed for understanding the statement of our main results. In Section 3 we give precise denitions of KL-stability with respect to (! 1 ;! 2 ) (Denition 6) as well as the robust version of this property (Denition 8), and of a smooth converse Lyapunov function for KL-stability with respect to (! 1 ;! 2 ) (Denition 7). Then we present our main results on the existence of a smooth converse Lyapunov function and relate these results to others that have appeared in the literature. Section 4 contains some technical prerequisites that are necessary for the proofs of our main results. We prove our main results in Section 5. Particularly noteworthy are Section 5.1.2, which contains the construction of our smooth converse Lyapunov function under the assumption of robust KL-stability, and Section 5.3 where we establish robust KLstability under the assumption of nominal KL-stability with respect to (!;!) plus a backward completability assumption. Section 6 contains the proofs of some propositions that are used to make connections to other results that have appeared in the literature. In an addendum, we include (elements of) the proofs of Lemmas 1, 8, 9, 16 and 17 and of Proposition 1. They can be found elsewhere in the literature, may be with some minor modications. The addendum is not intended to be part of the published version of the paper. In this paper, we have borrowed many ideas and technicalities from our predecessors. We try to make this point clear in bibliographical notes.
8 Converse Lyapunov Functions for Inclusions 8 2 Preliminaries Throughout this paper F (x) will be a set-valued map from G to subsets of R n where G is an open subset of R n. Also B denotes the open unit ball in R n and F (x) + "B := z 2 R n : jzj F (x) < " : (17) We review some denitions concerning set-valued maps (see also [12, x5.3, x7.2]): Denition 1 The set-valued map F is said to be upper semicontinuous on G if, given x 2 G, for each " > 0 there exists > 0 such that, for all 2 G satisfying jx? j < we have F () F (x) + "B. Denition 2 The set-valued map F is said to satisfy the basic conditions on G if it is upper semicontinuous on G and, for each x 2 G, F (x) is nonempty, compact and convex. We will need the following fact: Lemma 1 If the set-valued map F satises the basic conditions on G and : G! R0 is a continuous function such that for all x 2 G, we have then the set-valued map co fxg + (x)b G ; (18) [ 2fxg+(x)B 1 F () A + (x)b ; which we denote by cof (x + (x)b) + (x)b ; satises the basic conditions on G. Denition 3 Let O be an open subset of G. The set-valued map F is said to be locally Lipschitz on O if, for each x 2 O, there exists a neighborhood U O of x and a positive real number L such that x 1 ; x 2 2 U =) F (x 1 ) F (x 2 ) + Ljx 1? x 2 jb : (19) Given a set-valued map F (x), we can dene a solution of the dierential inclusion _x 2 F (x) : (20) Denition 4 A function x : [0; T ]! G (T > 0) is said to be a solution of the dierential inclusion (20) if it is absolutely continuous and satises, for almost all t 2 [0; T ], z { _ x(t) 2 F (x(t)) : (21) A function x : [0; T )! G (0 < T 1) is said to be a maximal solution of the dierential inclusion (20) if it does not have an extension which is a solution belonging to G, i.e., either T = 1 or there does not exist a solution y : [0; T + ]! G with T + > T such that y(t) = x(t) for all t 2 [0; T ).
9 Converse Lyapunov Functions for Inclusions 9 The following basic fact about the existence of maximal solutions is a combination of [12, x7, Theorem 1] and [29, Propositions 1 and 2]. Lemma 2 If F (x) satises the basic conditions on G then for each x 2 G there exist solutions of (20) for suciently small T > 0 satisfying x(0) = x. In addition, every solution can be extended into a maximal solution. Moreover, if a maximal solution x() is dened on a bounded interval [0; T ) then 1 as t! T. Henceforth, we will use (; x) to denote a solution of (20) starting at x and we will denote by S(x) or S(C) (respectively, S[0; T ](x) or S[0; T ](C)) the set of maximal solutions (respectively, solutions dened on [0; T ]) of the dierential inclusion (20) starting at x or in the compact set C. Note that with 1 2 S[0; T 1 ](x) and 2 2 S[0; T 2 ]( 1 (T 1 ; x)) and dening 3 (t; x) = 1 (t; x) if 0 t T 1 ; = 2 (t? T 1 ; 1 (T 1 ; x)) if T 1 t T 1 + T 2 : (22) we have 3 2 S[0; T 1 + T 2 ](x). Denition 5 The dierential inclusion (20) is said to be forward complete on G if, for all x 2 G, all solutions 2 S(x) are dened (and remain in G) for all t 0. The dierential inclusion (20) is said to be backward complete on G if the dierential inclusion _x 2?F (x) is forward complete on G. 3 Main results 3.1 General statements The stability concept we work with in this paper is called KL-stability with respect to (! 1 ;! 2 ) where! 1 and! 2 are continuous, positive semidenite functions. This concept is dened as follows: Denition 6 Let! i : G! R0, i = 1; 2, be continuous. The dierential inclusion _x 2 F (x) is said to be KL-stable with respect to (! 1 ;! 2 ) on G if it is forward complete on G and there exists 2 KL such that, for each x 2 G, all solutions 2 S(x) satisfy! 1 ((t; x)) (! 2 (x); t) 8t 0 : (23) As mentioned in the introduction, this stability concept was introduced in [27] and considered in [17] and [16]. It is often referred to as stability with respect to two measures. It covers standard stability notions like uniform global asymptotic stability of a closed set and partial asymptotic stability. In the case where A is a closed set,! 1 (x) =! 2 (x) = jxj A, and G = R n, it has been shown in [18, Proposition 2.5] that KL-stability is equivalent to the set A being uniformly globally stable and uniformly globally attractive. The technique used to prove [18, Proposition 2.5] is used to prove the following generalization for KL-stability with respect to (! 1 ;! 2 ):
10 Converse Lyapunov Functions for Inclusions 10 Proposition 1 Let! i : G! R0, i = 1; 2, be continuous. The following are equivalent: 1. The dierential inclusion _x 2 F (x) is KL-stable with respect to (! 1 ;! 2 ) on G. 2. All of the following hold: (a) The dierential inclusion _x 2 F (x) is forward complete on G. (b) (Uniform stability and global boundedness): There exists a class-k 1 function such that, for each x 2 G, all solutions 2 S(x) satisfy! 1 ((t; x)) (! 2 (x)) 8t 0 : (24) (c) (Uniform global attractivity): For each r > 0 and " > 0, there exists T (r; ") > 0 such that, for each x 2 G, all solutions 2 S(x) satisfy! 2 (x) r ; t T =)! 1 ((t; x)) " : (25) KL-stability with respect to (! 1 ;! 2 ) can be characterized in innitesimal (with respect to time) terms via the existence of a smooth Lyapunov function: Denition 7 Let! i : G! R0, i = 1; 2, be continuous. A function V : G! R0 is said to be a smooth converse Lyapunov function for KL-stability with respect to (! 1 ;! 2 ) on G for F (x) if V (x) is smooth on G and there exist class-k 1 functions 1, 2 such that, for all x 2 G, 1 (! 1 (x)) V (x) 2 (! 2 (x)) (26) and max hrv (x); wi?v (x) : (27) w2f (x) The motivation for this denition is that (27) guarantees the derivative of V (x) along solutions, denoted _V ((t; x)), satises _V ((t; x))?v ((t; x)) (28) for almost all t in the interval where (t; x) exists and belongs to G. It follows that V ((t; x)) V (x)e?t (29) on this interval and then, using (26) and assuming forward completeness on G, we can deduce KL-stability with respect to (! 1 ;! 2 ) on G. (By relying on a result like [18, Lemma 4.4], it is possible to deduce KL-stability with respect to (! 1 ;! 2 ) on G when V (x) on the right-hand side of (27) is replaced by any class-k 1 function of V (x).) We are interested in whether KL-stability with respect to (! 1 ;! 2 ) implies the existence of a smooth converse Lyapunov function for KL-stability with respect to (! 1 ;! 2 ). This is still an open question, in general. What we will show here is that a smooth converse Lyapunov function exists if and only if the KL-stability with respect to (! 1 ;! 2 ) is robust; that is KL-stability with respect to (! 1 ;! 2 ) still holds for a set of dierential inclusions given by supersets of F. This concept, which is present in the work of Kurzweil [15] and Clarke, et al. [6], is dened more precisely as follows:
11 Converse Lyapunov Functions for Inclusions 11 Denition 8 Let! i : G! R0, i = 1; 2, be continuous. The dierential inclusion _x 2 F (x) is said to be robustly KL-stable with respect to (! 1 ;! 2 ) on G if there exists a continuous function : G! R0 such that 1. fxg + (x)b G; 2. the dierential inclusion is KL-stable with respect to (! 1 ;! 2 ) on G; _x 2 F (x) (x) := cof (x + (x)b) + (x)b (30) 3. (x) > 0 for all x 2 GnA where A := ( 2 G : sup! 1 ((t; )) = 0 t0;2s () ) (31) and where S () represents the set of maximal solutions to (30). The main feature of the dierential inclusion (30) is that its solution set includes the solution set of the dierential inclusion _x 2 F (x) since F (x) F (x) (x). Note that even for ordinary dierential equations, robust stability will be expressed in terms of stability for a corresponding dierential inclusion. The following theorem emphasizes that robust KL-stability with respect to (! 1 ;! 2 ) is the key property for getting a smooth converse Lyapunov function. Theorem 1 Let! i : G! R0, i = 1; 2, be continuous and let F (x) satisfy the basic conditions on G. The following statements are equivalent: 1. The dierential inclusion _x 2 F (x) is forward complete on G and there exists a smooth converse Lyapunov function for KL-stability with respect to (! 1 ;! 2 ) on G for F (x). 2. The dierential inclusion _x 2 F (x) is robustly KL-stable with respect to (! 1 ;! 2 ) on G. Proof. See Section 5.1. We now specify cases where robust KL-stability is guaranteed. The rst case is when the dierential inclusion is locally Lipschitz, at least on a specic subset of G: Theorem 2 Let! i : G! R0, i = 1; 2, be continuous and let F (x) satisfy the basic conditions on G. If the dierential inclusion _x 2 F (x) is KL-stable with respect to (! 1 ;! 2 ) on G and F (x) is locally Lipschitz on an open set containing GnA where A := ( 2 G : sup! 1 ((t; )) = 0 t0;2s() ) : (32) then the dierential inclusion _x 2 F (x) is robustly KL-stable with respect to (! 1 ;! 2 ) on G.
12 Converse Lyapunov Functions for Inclusions 12 Proof. See Section 5.2. With the combination of Theorems 1 and 2 we recover the converse Lyapunov function results of [18] and [31, Theorem 2]. We also obtain a smooth, global version of [16, Theorem 3.4.1]. Several important converse Lyapunov function results, like those due to Kurzweil [15] and Clarke, et al. [6] are not covered by Theorem 2. However, they will be covered (see, respectively, Corollary 1 of Section 3.2 and Corollary 2 of Section 3.3) by our next set of sucient conditions for robust KL-stability. We will show that KL-stability implies robust KL-stability in the case where! 1 (x) =! 2 (x) =:!(x) and the dierential inclusion is backward completable by!-normalization. The latter is dened as follows: Denition 9 Let! : G! R0 be continuous. The dierential inclusion _x 2 F (x) is said to be backward completable by!-normalization if there exists a continuous function : G! [1; 1), a class-k function and a positive real number c such that and the dierential inclusion is backward complete on G. (x) (!(x)) + c (33) _x 2 1 (x) F (x) =: F N(x) (34) In this denition, the existence of (x) making (34) backward complete on G is always guaranteed. Indeed, from [12, x5, Lemma 15] or [3, Theorem ], sup v2f (x) jvj can be upper bounded by a function (x) that is continuous on G. So, for instance, in the case where G = R n, by picking (x) = (x) we get sup v2fn (x) jvj 1 which implies that the dierential inclusion (34) is backward complete on R n. The diculty comes from requiring that (x) simultaneously satises (33). However, when!(x) is proper on G this diculty disappears. More generally, when G is the Cartesian product G := G 1 R n 2, with G 1 an open subset of R n 1 and by writing _x1 _x = 2 F (x) ; (35) _x 2 we have : Proposition 2 If 1. F satises the basic conditions on G; 2. we have lim x 1!@G 1 1 inf!(x 1 ; x 2 ) = 1 ; (36) x 2 2R n 2 3. there exist positive real numbers ` and b such that v = v1 v 2 2 F (x) =) jv 2 j `jx 2 j + b (37)
13 Converse Lyapunov Functions for Inclusions 13 then the dierential inclusion (35) is backward completable by!-normalization. Proof. See Section 6.1. With backward completability, KL-stability with respect to (!;!) implies robust KLstability with respect to (!;!): Theorem 3 Let! : G! R0 be continuous and let F (x) satisfy the basic conditions on G. If the dierential inclusion _x 2 F (x) is backward completable by!-normalization and KL-stable with respect to (!;!) on G then it is robustly KL-stable with respect to (!;!) on G. Proof. See Section Results specialized to ordinary dierential equations To illustrate our results, we specialize them to ordinary dierential equations _x = F (x) (38) where F : G! R n is continuous. As noted in the introduction, this covers the case of time-varying systems _ = f(; t) (39) where f is continuous in both variables (compare with [4]) by taking f(; p) x = ; F (x) = : (40) p 1 A direct consequence of Theorem 2 or 3 and Theorem 1 is the following: Corollary 1 If either or I. the function F (x) is locally Lipschitz on G, II. i.) F (x) is continuous on G, ii.)! 1 =! 2 =!, and iii.) the dierential equation _x = F (x) is backward completable by!-normalization then the following two statements are equivalent: 1. _x = F (x) is KL-stable with respect to (! 1 ;! 2 ) on G. 2. _x = F (x) is forward complete on G and there exists a smooth converse Lyapunov function for KL-stability with respect to (! 1 ;! 2 ) on G for F (x).
14 Converse Lyapunov Functions for Inclusions 14 With condition (II) of this corollary, we recover Kurzweil's main result [15, Theorem 7] which applies to the case described by (40) and Proposition 2, with when G 1 = R n?1 and, otherwise,! 1 (x) =! 2 (x) = max! 1 (x) =! 2 (x) = jj (41) jj; 3.3 Results for compact attractors 1 jj R n?1 ng 1? 2 j0j R n?1 ng 1 : (42) The main result of this section is that KL-stability with respect to (!;!), where! is a type of indicator for a compact set A, is equivalent to (local) stability of A plus attractivity. Uniform boundedness and uniform attractivity are guaranteed by the fact that the attractor is compact. Various applications of this observation are made including a corollary that recovers [6, Theorem 1.2]. Denition 10 Given a compact subset A of an open set G, a function! : G! R0 is said to be a proper indicator for A on G if! is continuous,!(x) = 0 if and only if x 2 A, and lim!(x) = 1. x!@g1 Remark 1 For each open set G and each compact set A G, there exists a proper indicator function. When G = R n we can take!(x) = jxj A. Otherwise, we can take, for example, 1 2!(x) = max jxj A ;? : (43) jxj Rn ng dist(a; R n n G) Note that the right-hand side of (42) is a function that is a proper indicator for the origin (in R n?1 ) on G 1. The properties of a proper indicator,!(x), for A on G enforce that KL-stability with respect to (!;!) on G implies that the set A is stable and all trajectories starting in G converge to A. The rst result of this subsection, which is similar to [15, Theorem 12], shows that the opposite is also true. Namely, for dierential inclusions with right-hand side satisfying the basic conditions, the basin of attraction G for a stable, compact attractor A is open and, for each function! that is a proper indicator for A on G, the dierential inclusion is KL-stable with respect to (!;!) on G. Proposition 3 Let F (x) satisfy the basic conditions on an open set O and let A O be compact. If the set A is stable and the set of points G from which A is strongly attractive contains a neighborhood of A, i.e., 1. Stability: for each " > 0 there exists > 0 such that, for each x 2 O T? A + B, each solution 2 S(x) is dened and belongs to O for all t 0 and satises j(t; x)j A " 8t 0 ; (44)
15 Converse Lyapunov Functions for Inclusions Attractivity: the set G of points x 2 O such that each solution 2 S(x) is dened and belongs to O for all t 0 and satises lim t!1 j(t; )j A = 0 contains a neighborhood of A, then the set G is open and, for each function! that is a proper indicator for A on G, the dierential inclusion _x 2 F (x) is KL-stable with respect to (!;!) on G. Proof. See Section 6.2. By combining Theorems 1, 3 and Proposition 2 with Proposition 3, we recover [6, Theorem 1.2]: Corollary 2 Suppose F (x) satises the basic conditions on R n and the origin of the dierential inclusion _x 2 F (x) is globally asymptotically stable, i.e., for each " > 0 there exists > 0 such that jxj ; 2 S(x) =) j(t; x)j " 8t 0 ; (45) for each x 2 R n, all solutions 2 S(x) are dened for all t 0 and satisfy lim j(t; x)j = 0 : t!1 Then, taking!(x) = jxj, there exists a smooth converse Lyapunov function for KL-stability with respect to (!;!) on R n for F (x). Nontrivial compact attractors arise in various ways. One situation, which is commonly encountered in the semiglobal practical asymptotic stabilization of nonlinear control systems (see, for example, [33]), is when: Assumption 1 There exist two compact sets C 1, C 2, two strictly positive real numbers, T and an open set O such that C 1 + B C 2 O, F (x) satises the basic conditions on O and is Lipschitz on C 1 + B, for all x 2 C 2, all solutions 2 S(x) are dened and belong to O for all t 0 and belong to C 1 for t T. It can be shown that: Proposition 4 Under Assumption 1 the set A := f 2 C 1 : (t; ) 2 C 1 ; 8 2 S() ; 8t 0g (46) is a nonempty, compact stable attractor with basin of attraction containing C 2.
16 Converse Lyapunov Functions for Inclusions 16 Proof. See Section 6.3. As a consequence, Proposition 3 applies for this set A. Also, for each function! that is a proper indicator for A on its strong domain of attraction, Proposition 2 allows us to apply Theorem 3 and then Theorem 1. So we can state the following converse Lyapunov function theorem, for nite-time convergence to a compact set from a larger compact set : Corollary 3 Under Assumption 1, there exist a compact set A C 1 and an open set G C 2 such that, for each function! : G! R0 that is a proper indicator for A on G, there exists a smooth converse Lyapunov function for KL-stability with respect to (!;!) on G for F (x). 3.4 Bibliographical Notes Our main result, Theorem 1, is inspired by the observations of Kurzweil [15] and Clarke, et al. [6] who recognized that robust stability, in the context of their specic problems, allowed them to construct a smooth converse Lyapunov function. The results of Section 3.3 for compact attractors are based on similar results in the special cases considered by Kurzweil [15] and Clarke, et al., [6]. 4 Technical prerequisites The proofs of our main results will be based on several technical lemmas. They concern: 1. Sontag's lemma on KL-estimates. 2. Solutions to dierential inclusions satisfying the basic conditions. 3. Solutions to locally Lipschitz dierential inclusions. 4. Derivatives of locally Lipschitz functions. 5. Smoothing continuous and locally Lipschitz functions. 4.1 Sontag's lemma on KL-estimates We recall a recent result of Sontag [30, Proposition 7] that is one of the keys in our converse Lyapunov function construction. The lemma is a global version of a particular aspect of the well-known Massera Lemma [21, Section 12] (cf. [16, Lemma 3.4.1]). We provide an alternative proof. Lemma 3 For each class-kl function and each number > 0, there exist functions e 1 2 K 1 and e 2 2 K 1 such that e 1 (s) is locally Lipschitz and e 1 ((s; t)) e 2 (s)e?t 8(s; t) 2 R0 R0 : (47)
17 Converse Lyapunov Functions for Inclusions 17 Proof. First we pick 2 K 1 and a function : R0! R >0 continuous and strictly decreasing with lim t!1 (t) = 0 such that, for all t 0, we have ((t); t) (t) : (48) To see that such functions exist, let f" k g 1 k=1 be a sequence of strictly positive real numbers decreasing to zero. Since 2 KL, there exists a sequence ft k g 1 k=1 of strictly positive real numbers strictly increasing to innity such that (k + 1; t k ) " k. Dene t 0 = 0 and " 0 = max f(1; 0); 2" 1 g. Then, choosing to be any K 1 function upper bounded by the piecewise constant curve p 1 (t) = j + 1 for t 2 [t j ; t j+1 ) and choosing to be any continuous, strictly decreasing to zero function that is lower bounded by the piecewise constant curve p 2 (t) = " j for j 2 [t j ; t j+1 ) and using that 2 KL, we have, for each integer j 0 and each t 2 [t j ; t j+1 ), ((t); t) (j + 1; t j ) " j = p 2 (t) (t). Next, let?1 be the inverse of, which is dened and continuous on (0; (0)]. It is also strictly decreasing with lim s!0?1 (s) = +1. It follows that the function e?2?1 (s) is welldened, continuous, positive and strictly increasing on (0; (0)]. Then we can nd e 1 2 K 1, locally Lipschitz and such that, for all s 2 (0; (0)], With (48), it follows, for all t 0, Now, using (50) and the fact that 2 KL, e 1 (s) e?2?1 (s) : (49) e 1 (((t); t))e 2t e 1 ((t))e 2t 1 : (50) 0 < s (t) ) e 1 ((s; t))e t = p e 1 ((s; 0)) s e1 ((s; t)) p e1 ((s; t))e e 1 ((s; 0)) 2t ;(51) p e 1 ((s; 0)) p e 1 (((t); t))e 2t ; (52) p e 1 ((s; 0)) : (53) (t) s ) e 1 ((s; t))e t e 1 ((s; 0))e?1 (s) : (54) So (47) holds by taking e 2 2 K 1 such that e 2 (s) maxnp e1 ((s; 0)) ; e 1 ((s; 0))e?1 (s) o : (55) Remark 2 Even though we are assuming minimal continuity properties for KL functions, the preceding result shows that any KL function can always be upper bounded by a continuous KL function. In particular, (47) can be rewritten as (s; t)?1 1? 2 (s)e?t (56) where the right-hand side is of class-kl and is also continuous in (s; t).
18 Converse Lyapunov Functions for Inclusions Solutions to inclusions satisfying the basic conditions For the dierential inclusion _x 2 F (x) we denote the set of points reachable from a compact set C G in time T > 0 as R T (C) := f 2 R n : = (t; x) ; t 2 [0; T ] ; x 2 C ; 2 S(x)g : (57) The following comes from [12, x7, Theorem 3] or [10, Theorem 7.1]: Lemma 4 Let F (x) satisfy the basic conditions on G and suppose the compact set C G and the strictly positive real number T > 0 are such that all solutions 2 S(x) are dened and belong to G for all t 2 [0; T ]. Then the set R T (C) is a compact subset of G and the set S[0; T ](C) is a compact set in the metric of uniform convergence. A consequence of Lemma 4 is the following: Lemma 5 Let F (x) satisfy the basic conditions on G and suppose x 2 G is such that all solutions 2 S(x) are dened and belong to G for all t 0. Then each sequence f n g 1 n=1 of solutions in S(x) has a subsequence converging to a function 2 S(x) and the convergence is uniform on each compact time interval. Proof. From Lemma 4, we know that for each integer k, the set S[0; k](x) is a compact set in the metric of uniform convergence. Since for all n and k, n is in S[0; k](x), it follows that f n g 1 n=1 has a subsequence f 1m g 1 m=1 converging uniformly on [0; 1] to a function 1 2 S(x). Similarly f 1m g 1 m=1 has a subsequence f 2m g 1 m=1 converging uniformly on [0; 2] to a function 2 2 S(x). And so on. The result follows by taking the subsequence given by the diagonal elements mm. The next result is on \continuity" of solutions with respect to initial conditions and perturbations of the right-hand side. See [12, x8, Corollary 2]. Lemma 6 Suppose _x 2 F (x) is forward complete on G, F (x) satises the basic conditions on G, and! : G! R0 is continuous on G. For each triple (T; "; C) where T > 0, " > 0 and C G compact there exists > 0 such that every maximal solution (t; x ) of _x 2 F (x) := cof (x + B) + B ; (58) with x 2 C+B, remains in G for all t 2 [0; T ] and there exists a solution (t; x) of _x 2 F (x) with x 2 C and jx? x j " such that, for all t 2 [0; T ], j!( (t; x ))?!((t; x))j " : (59) Remark 3 A useful remark is that if Lemma 6 holds for > 0 then it holds for all 2 (0; ] since, in this case, C + B C + B and F (x) F (x). Lemmas 4 and 6 can be used to show:
19 Converse Lyapunov Functions for Inclusions 19 Lemma 7 Suppose F (x) satises the basic conditions on G and the dierential inclusion _x 2 F (x) (60) is forward complete on G. Then there exists a continuous function : G! (0; 1) such that the dierential inclusion fxg + (x)b G ; (61) _x 2 F (x) (x) := cof (x + (x)b) + (x)b (62) is forward complete on G and F (x) (x) satises the basic conditions on G. Proof. In the following, let R 1 (C), respectively R (x) 1 (C), denote the reachable set in time t = 1 from the compact set C G for the dierential inclusion (60), respectively the dierential inclusion (62). According to Lemma 4, the forward completeness assumption on (60) implies that the reachable set in each nite time from each compact subset of G for the system (60) is a compact subset of G. So, we can nd a compact, countable covering C i, i = 1; 2; : : : ; of G such that, for each i, there exists " i > 0 satisfying C i R 1 (C i ) + " i B C i+1 G : (63) By applying Lemma 6 with the triple (1; " i ; C i ) and!(x) = x we get, for each i, the existence of i 2 (0; " i ] (64) such that R i 1 (C i) C i+1 : (65) Without loss of generality, from Remark 3, we can assume that the sequence f i g 1 i=1 is nonincreasing. Dene i(x) := inf i (x) := i(x) fx 2 C i g (x) := inf [() + jx? j] : 2G As in the proof of [7, Theorem 1.5.1], one can check that the function is well-dened and is Lipschitz on G with Lipschitz constant 1. We have also, for all x 2 G, (66) (x) i(x) ; (x) > 0 (67) and, from (63) and (64), fxg + (x)b G : (68)
20 Converse Lyapunov Functions for Inclusions 20 We will show that R (x) 1 (C i) C i+1 8i : (69) From the denition of i(x) and the fact that the sequence f i g 1 i=1 is nonincreasing, it follows that x i [ (GnCi ) =) (x) i : (70) To establish a contradiction, suppose the existence of an integer j and 2 R (x) (C 1 j) such that =2 C j+1, i.e., there exists a solution of the dierential inclusion (62) starting from a point x 2 C j that reaches, at time t 1, the point =2 C j+1. Then, exploiting time-invariance, continuity of this solution with respect to time S and compactness of C j, there exists t 2 [0; t) such that (t ; x) j, and (t; x) j (GnCj ) for all t 2 [t ; t]. It follows from (70) that ((t; x)) j for all t 2 [t ; t]. Therefore, for t 2 [t ; t], (t; x) is a solution of the dierential inclusion (62) with (x) = j. But then, using (65) and the fact that t? t 1 and (t ; x) 2 C j, it is impossible to have (t; x) =2 C j+1. This contradiction establishes that (69) holds. Now, suppose that (62) is not forward complete. Then there exist an integer j, a point x 2 C j, a solution of (62) starting at x and t < 1 such that for each integer m > j there exists t m < t such that (t m ; x) =2 C m. On the other hand, (69) implies R (x) m?j (C j) C m (71) which implies that m? j < t m < t for all m > j. This is impossible. The nal result of this subsection provides a link to the next subsection where solutions of locally Lipschitz dierential inclusions are considered. The result is slight modication of [6, Proposition 3.5]. Lemma 8 Let A be such that GnA is open and : G! R0 be bounded away from zero on compact subsets of GnA and such that fxg + (x)b G. If F (x) satises the basic conditions on G then there exists an dierential inclusion _x 2 F L (x) satisfying the basic conditions on G, locally Lipschitz on GnA and such that F (x) F L (x) F (x) (x) := cof (x + (x)b) + (x)b : (72) 4.3 Solutions to locally Lipschitz dierential inclusions We start with the following fact (see [7, Exercise a]): Lemma 9 Let O be an open subset of G. If the set-valued map F is locally Lipschitz on O, then for any compact set K O there exists a positive real number L K such that for any x 1 and x 2 in K, we have F (x 1 ) F (x 2 ) + L K jx 1? x 2 jb : (73) The next result, on solutions to locally Lipschitz dierential inclusions, is similar to [10, Lemma 8.3], [7, Lemma ] and [3, Theorem ]. (See also [6, Proof of Lemma 4.9]). We provide a proof for completeness.
21 Converse Lyapunov Functions for Inclusions 21 Lemma 10 Let F (x) satisfy the basic conditions on G and be locally Lipschitz on the open set O G. For each T > 0 and each compact set C O, there exist L and > 0 such that, for each x 2 C, each 2 S(x) and each satisfying jx? j, there exists 2 S() with the property j(t; x)? (t; )j Ljx? j 8t 2 [0; T x ] ; (74) where T x 2 [0; T ] is such that (t; x) 2 C for all t 2 [0; T x ]. Proof. Preparation step : For each pair (z; v) 2 G R n, dene g(z; v) to be the unique (since F (z) is closed and convex; see [12, x5, Lemma 2]) closest point in F (z) to v. Since F (z) is locally Lipschitz, closed and convex it follows from [12, x6, Lemma 8] that g(z; v) is continuous in z for each xed v. Since F (z) is closed and convex, g(z; v) is continuous in v for each xed z. From [12, x5, Lemma 15], for each compact subset X of G there exists a constant m such that jg(z; v)j m for all (z; v) 2 X R n. Below, we will pick x in G and in S(x) dened on [0; T x1 ) and will dene w(t) := z _ { (t; x) 2 F ((t; x)) for almost all t 2 [0; T x1 ). (The function w(t) can be dened arbitrarily z _ { for those t 2 [0; T x1 ) where (t; x) is not dened.) Since (t; x) is absolutely continuous, w(t) is measurable. Then we will dene g x (z; t) = g(z; w(t)). Since w(t) is measurable and g has the properties given above, g x (z; t), dened on G [0; T x1 ), satises the Caratheodory conditions for existence of solutions for ordinary dierential equations. Core of the proof : Let C O and T > 0 be given. Since C is a compact subset of O which is open, there exists " > 0 so that C + "B is a compact subset of O. Using Lemma 9, let K be a Lipschitz constant for F on C + "B. We choose L = exp(kt ) ; = " 2L : (75) Let x, 2 S(x), T x and T x1 be such that T x 2 (0; T ], (t; x) 2 C for all t 2 [0; T x ] and (t; x) is right maximally dened on [0; T x1 ). Necessarily T x1 > T x. (If T x = 0 then, since L 1, there is nothing to prove.) Let g x be as above, dened on G [0; T x1 ). Pick satisfying jx? j. Then is an interior point of C + "B. Let (t; ) be a solution with values in G of z { _ (t; ) = g x ( (t; ); t) ; (0; ) = (76) right maximally dened on [0; T ). We have T T x1 and from the denition of g x, (t; ) is a solution on [0; T ) of the dierential inclusion _x 2 F (x). Now, either T = T x1 or there exists t 2 [0; T ) such that (t ; ) =2 C + "B. We dene t := sup t 2 [0; T x ] : (s; ) 2 C + "B ; 8s 2 [0; t] : (77) We must have that t < T since in the case where T = T x1 we have t T x < T x1 = T and in the case where T < T x1 we have t t < T. Thus (t; ) is well-dened on [0; t] and,
22 Converse Lyapunov Functions for Inclusions 22 by the continuity of (; ) and since is an interior point of C + "B and T x > 0, we have t > 0 and t < T x =) (t; ) + "B) : (78) Then, from the denition of g x we have, for almost all t 2 [0; t], d dt j(t; x)? (t; )j jw(t)? g x( (t; ); t)j (79) = jw(t)? g( (t; ); w(t))j (80) Then, since we have, from the Lipschitz property : = inf jw(t)? vj : (81) v2f ( (t;)) w(t) 2 F ((t; x)) F ( (t; )) + K j(t; x)? (t; )j B ; (82) we conclude : d j(t; x)? (t; )j Kj(t; x)? (t; )j : (83) dt Invoking a comparison theorem, we get, for all t 2 [0; t], j(t; x)? (t; )j exp(kt )jx? j = Ljx? j L = " 2 : (84) Now if t = T x we are done. Suppose t < T x. Since we have that (t; x) 2 C for all t 2 [0; T x ], (84) implies that (t; ) is in the interior of C +"B, for all t 2 [0; t]. But the latter contradicts (78). So we must have t = T x. Lemma 11 Let F satisfy the basic conditions on G and let F be locally Lipschitz on a neighborhood of x 2 G. Then for each v 2 F (x) there exists a solution 2 S(x) satisfying (t; x) = x + t(v + r(t)) 8t 2 [0; T ) (85) for some T > 0 and for some function r(t) that is continuous on [0; T ) and satises lim t!0 + r(t) = 0. Proof. (See also [6, proof of Lemma 4.8]). As in the previous proof, for each in a neighborhood of x, let g() 2 F () be the unique closest point in the compact convex set F () to the vector v. Again, the function g is well-dened and continuous on a neighborhood of x since F is locally Lipschitz on a neighborhood of x. Let (t; x) be a solution to the dierential equation _ = g() (86) starting at x dened on [0; T ). Since g() 2 F (), is also a solution of _x 2 F (x). Since g(x) = v, the result follows.
23 Converse Lyapunov Functions for Inclusions Derivatives of locally Lipschitz functions First we recall the denition of the Dini subderivate of a function V : O! R (O open), at a point x 2 O in the direction v 2 R n : DV (x; v) := From [7, Exercise 3.4.1]), we have : V (x + "w)? V (x) lim inf w!v;"!0 + " : (87) Lemma 12 If V is a locally Lipschitz function on an open set O of R n, then we have DV (x; v) = hrv (x); vi (88) for all x 2 O such that the gradient of V, denoted rv (x), exists. The set of points where the gradient exists is characterized by Rademacher's Theorem (see [28, Denition VIII.3.2, Corollary VIII.3.1] and [7, p.147]) : Lemma 13 If V is a locally Lipschitz function on an open set O of R n, it has a gradient rv at almost all points x 2 O. Finally, like in [6], to establish the Lipschitz property we use the following result from [8, Corollary 3.7] : Lemma 14 Let the function V : O! (?1; 1] be lower semicontinuous. Let U O be open and convex. The function V is Lipschitz with Lipschitz constant M on U if and only if DV (x; v) Mjvj 8x 2 U ; 8v 2 R n : (89) 4.5 Smoothing continuous and locally Lipschitz functions A standard approximation result is the following: Lemma 15 Let O R n be open and let : O! (0; 1) be continuous. Suppose V : O! R is continuous. Then there exists a smooth function V s : O! R such that, for all x 2 O, jv (x)? V s (x)j (x) : (90) The next result is similar to [6, Lemma 5.1] which is based on similar results in [15], [38] and [18, Theorem B.1]. Lemma 16 Let O R n be open and let the three functions : O! R and ; : O! (0; 1) be continuous. Suppose V : O! R is locally Lipschitz on O, and the set-valued map F satises the basic conditions on O and is locally Lipschitz on O, and for almost all x 2 O, max hrv (x); wi (x) : (91) w2f (x)
Abstract. Previous characterizations of iss-stability are shown to generalize without change to the
On Characterizations of Input-to-State Stability with Respect to Compact Sets Eduardo D. Sontag and Yuan Wang Department of Mathematics, Rutgers University, New Brunswick, NJ 08903, USA Department of Mathematics,
More informationTHE area of robust feedback stabilization for general
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 52, NO. 11, NOVEMBER 2007 2103 Hybrid Feedback Control Robust Stabilization of Nonlinear Systems Christophe Prieur, Rafal Goebel, Andrew R. Teel Abstract In
More informationOn reduction of differential inclusions and Lyapunov stability
1 On reduction of differential inclusions and Lyapunov stability Rushikesh Kamalapurkar, Warren E. Dixon, and Andrew R. Teel arxiv:1703.07071v5 [cs.sy] 25 Oct 2018 Abstract In this paper, locally Lipschitz
More information1 Lyapunov theory of stability
M.Kawski, APM 581 Diff Equns Intro to Lyapunov theory. November 15, 29 1 1 Lyapunov theory of stability Introduction. Lyapunov s second (or direct) method provides tools for studying (asymptotic) stability
More informationON THE ASYMPTOTIC STABILITY IN TERMS OF TWO MEASURES FOR FUNCTIONAL DIFFERENTIAL EQUATIONS. G. Makay
ON THE ASYMPTOTIC STABILITY IN TERMS OF TWO MEASURES FOR FUNCTIONAL DIFFERENTIAL EQUATIONS G. Makay Student in Mathematics, University of Szeged, Szeged, H-6726, Hungary Key words and phrases: Lyapunov
More informationCongurations of periodic orbits for equations with delayed positive feedback
Congurations of periodic orbits for equations with delayed positive feedback Dedicated to Professor Tibor Krisztin on the occasion of his 60th birthday Gabriella Vas 1 MTA-SZTE Analysis and Stochastics
More informationHybrid Systems Techniques for Convergence of Solutions to Switching Systems
Hybrid Systems Techniques for Convergence of Solutions to Switching Systems Rafal Goebel, Ricardo G. Sanfelice, and Andrew R. Teel Abstract Invariance principles for hybrid systems are used to derive invariance
More informationA framework for stabilization of nonlinear sampled-data systems based on their approximate discrete-time models
1 A framework for stabilization of nonlinear sampled-data systems based on their approximate discrete-time models D.Nešić and A.R.Teel Abstract A unified framework for design of stabilizing controllers
More informationNonlinear Systems and Control Lecture # 12 Converse Lyapunov Functions & Time Varying Systems. p. 1/1
Nonlinear Systems and Control Lecture # 12 Converse Lyapunov Functions & Time Varying Systems p. 1/1 p. 2/1 Converse Lyapunov Theorem Exponential Stability Let x = 0 be an exponentially stable equilibrium
More informationConverse Lyapunov theorem and Input-to-State Stability
Converse Lyapunov theorem and Input-to-State Stability April 6, 2014 1 Converse Lyapunov theorem In the previous lecture, we have discussed few examples of nonlinear control systems and stability concepts
More informationAn important method in stability and ISS analysis of continuous-time systems is based on the use class-kl and class-k functions (for classical results
Formulas relating KL stability estimates of discrete-time and sampled-data nonlinear systems D. Nesic Department of Electrical and Electronic Engineering, The University of Melbourne, Parkville, 3052,
More informationInput to state set stability for pulse width modulated control systems with disturbances
Input to state set stability for pulse width modulated control systems with disturbances A.R.eel and L. Moreau and D. Nešić Abstract New results on set stability and input-to-state stability in pulse-width
More information3 Stability and Lyapunov Functions
CDS140a Nonlinear Systems: Local Theory 02/01/2011 3 Stability and Lyapunov Functions 3.1 Lyapunov Stability Denition: An equilibrium point x 0 of (1) is stable if for all ɛ > 0, there exists a δ > 0 such
More informationPassivity-based Stabilization of Non-Compact Sets
Passivity-based Stabilization of Non-Compact Sets Mohamed I. El-Hawwary and Manfredi Maggiore Abstract We investigate the stabilization of closed sets for passive nonlinear systems which are contained
More informationOutput Input Stability and Minimum-Phase Nonlinear Systems
422 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 47, NO. 3, MARCH 2002 Output Input Stability and Minimum-Phase Nonlinear Systems Daniel Liberzon, Member, IEEE, A. Stephen Morse, Fellow, IEEE, and Eduardo
More informationAn asymptotic ratio characterization of input-to-state stability
1 An asymptotic ratio characterization of input-to-state stability Daniel Liberzon and Hyungbo Shim Abstract For continuous-time nonlinear systems with inputs, we introduce the notion of an asymptotic
More informationUCLA Chemical Engineering. Process & Control Systems Engineering Laboratory
Constrained Innite-Time Nonlinear Quadratic Optimal Control V. Manousiouthakis D. Chmielewski Chemical Engineering Department UCLA 1998 AIChE Annual Meeting Outline Unconstrained Innite-Time Nonlinear
More informationnamics Conclusions are given in Section 4 2 Redesign by state feedback We refer the reader to Sontag [2, 3] for the denitions of class K, K and KL fun
Robust Global Stabilization with Input Unmodeled Dynamics: An ISS Small-Gain Approach Λ Zhong-Ping Jiang y Murat Arcak z Abstract: This paper addresses the global asymptotic stabilization of nonlinear
More informationComments on integral variants of ISS 1
Systems & Control Letters 34 (1998) 93 1 Comments on integral variants of ISS 1 Eduardo D. Sontag Department of Mathematics, Rutgers University, Piscataway, NJ 8854-819, USA Received 2 June 1997; received
More informationA converse Lyapunov theorem for discrete-time systems with disturbances
Systems & Control Letters 45 (2002) 49 58 www.elsevier.com/locate/sysconle A converse Lyapunov theorem for discrete-time systems with disturbances Zhong-Ping Jiang a; ; 1, Yuan Wang b; 2 a Department of
More informationUniform weak attractivity and criteria for practical global asymptotic stability
Uniform weak attractivity and criteria for practical global asymptotic stability Andrii Mironchenko a a Faculty of Computer Science and Mathematics, University of Passau, Innstraße 33, 94032 Passau, Germany
More information1. Introduction The nonlinear complementarity problem (NCP) is to nd a point x 2 IR n such that hx; F (x)i = ; x 2 IR n + ; F (x) 2 IRn + ; where F is
New NCP-Functions and Their Properties 3 by Christian Kanzow y, Nobuo Yamashita z and Masao Fukushima z y University of Hamburg, Institute of Applied Mathematics, Bundesstrasse 55, D-2146 Hamburg, Germany,
More informationGarrett: `Bernstein's analytic continuation of complex powers' 2 Let f be a polynomial in x 1 ; : : : ; x n with real coecients. For complex s, let f
1 Bernstein's analytic continuation of complex powers c1995, Paul Garrett, garrettmath.umn.edu version January 27, 1998 Analytic continuation of distributions Statement of the theorems on analytic continuation
More informationConvergence Rate of Nonlinear Switched Systems
Convergence Rate of Nonlinear Switched Systems Philippe JOUAN and Saïd NACIRI arxiv:1511.01737v1 [math.oc] 5 Nov 2015 January 23, 2018 Abstract This paper is concerned with the convergence rate of the
More informationUniversity of California. Berkeley, CA fzhangjun johans lygeros Abstract
Dynamical Systems Revisited: Hybrid Systems with Zeno Executions Jun Zhang, Karl Henrik Johansson y, John Lygeros, and Shankar Sastry Department of Electrical Engineering and Computer Sciences University
More informationonly nite eigenvalues. This is an extension of earlier results from [2]. Then we concentrate on the Riccati equation appearing in H 2 and linear quadr
The discrete algebraic Riccati equation and linear matrix inequality nton. Stoorvogel y Department of Mathematics and Computing Science Eindhoven Univ. of Technology P.O. ox 53, 56 M Eindhoven The Netherlands
More informationAn introduction to Mathematical Theory of Control
An introduction to Mathematical Theory of Control Vasile Staicu University of Aveiro UNICA, May 2018 Vasile Staicu (University of Aveiro) An introduction to Mathematical Theory of Control UNICA, May 2018
More informationMetric Spaces and Topology
Chapter 2 Metric Spaces and Topology From an engineering perspective, the most important way to construct a topology on a set is to define the topology in terms of a metric on the set. This approach underlies
More informationA unified framework for input-to-state stability in systems with two time scales
1 A unified framework for input-to-state stability in systems with two time scales Andrew R. Teel and Luc Moreau and Dragan Nešić Abstract This paper develops a unified framework for studying robustness
More informationNear-Potential Games: Geometry and Dynamics
Near-Potential Games: Geometry and Dynamics Ozan Candogan, Asuman Ozdaglar and Pablo A. Parrilo January 29, 2012 Abstract Potential games are a special class of games for which many adaptive user dynamics
More informationInput-Output-to-State Stability Mikhail Krichman and Eduardo D. Sontag y Dep. of Mathematics, Rutgers University, NJ
Input-Output-to-State Stability Mikhail Krichman and Eduardo D. Sontag y Dep. of Mathematics, Rutgers University, NJ fkrichman,sontagg@math.rutgers.edu Yuan Wang z Dept. of Mathematics, Florida Atlantic
More informationChapter 13 Internal (Lyapunov) Stability 13.1 Introduction We have already seen some examples of both stable and unstable systems. The objective of th
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A. Dahleh George Verghese Department of Electrical Engineering and Computer Science Massachuasetts Institute of Technology 1 1 c Chapter
More informationFOR linear time-invariant systems with outputs, there are
154 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 50, NO. 2, FEBRUARY 2005 Nonlinear Norm-Observability Notions Stability of Switched Systems João P. Hespanha, Senior Member, IEEE, Daniel Liberzon, Senior
More informationSTOCHASTIC DIFFERENTIAL EQUATIONS WITH EXTRA PROPERTIES H. JEROME KEISLER. Department of Mathematics. University of Wisconsin.
STOCHASTIC DIFFERENTIAL EQUATIONS WITH EXTRA PROPERTIES H. JEROME KEISLER Department of Mathematics University of Wisconsin Madison WI 5376 keisler@math.wisc.edu 1. Introduction The Loeb measure construction
More informationL 2 -induced Gains of Switched Systems and Classes of Switching Signals
L 2 -induced Gains of Switched Systems and Classes of Switching Signals Kenji Hirata and João P. Hespanha Abstract This paper addresses the L 2-induced gain analysis for switched linear systems. We exploit
More informationFOR OVER 50 years, control engineers have appreciated
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 49, NO. 7, JULY 2004 1081 Further Results on Robustness of (Possibly Discontinuous) Sample Hold Feedback Christopher M. Kellett, Member, IEEE, Hyungbo Shim,
More informationIntroduction to Nonlinear Control Lecture # 3 Time-Varying and Perturbed Systems
p. 1/5 Introduction to Nonlinear Control Lecture # 3 Time-Varying and Perturbed Systems p. 2/5 Time-varying Systems ẋ = f(t, x) f(t, x) is piecewise continuous in t and locally Lipschitz in x for all t
More informationNonlinear Control. Nonlinear Control Lecture # 8 Time Varying and Perturbed Systems
Nonlinear Control Lecture # 8 Time Varying and Perturbed Systems Time-varying Systems ẋ = f(t,x) f(t,x) is piecewise continuous in t and locally Lipschitz in x for all t 0 and all x D, (0 D). The origin
More information(x k ) sequence in F, lim x k = x x F. If F : R n R is a function, level sets and sublevel sets of F are any sets of the form (respectively);
STABILITY OF EQUILIBRIA AND LIAPUNOV FUNCTIONS. By topological properties in general we mean qualitative geometric properties (of subsets of R n or of functions in R n ), that is, those that don t depend
More informationLocal strong convexity and local Lipschitz continuity of the gradient of convex functions
Local strong convexity and local Lipschitz continuity of the gradient of convex functions R. Goebel and R.T. Rockafellar May 23, 2007 Abstract. Given a pair of convex conjugate functions f and f, we investigate
More informationContinuous and Piecewise Affine Lyapunov Functions using the Yoshizawa Construction
Continuous and Piecewise Affine Lyapunov Functions using the Yoshizawa Construction Sigurður Hafstein, Christopher M Kellett, Huijuan Li Abstract We present a novel numerical technique for the computation
More informationLecture 4. Chapter 4: Lyapunov Stability. Eugenio Schuster. Mechanical Engineering and Mechanics Lehigh University.
Lecture 4 Chapter 4: Lyapunov Stability Eugenio Schuster schuster@lehigh.edu Mechanical Engineering and Mechanics Lehigh University Lecture 4 p. 1/86 Autonomous Systems Consider the autonomous system ẋ
More informationProblem Description The problem we consider is stabilization of a single-input multiple-state system with simultaneous magnitude and rate saturations,
SEMI-GLOBAL RESULTS ON STABILIZATION OF LINEAR SYSTEMS WITH INPUT RATE AND MAGNITUDE SATURATIONS Trygve Lauvdal and Thor I. Fossen y Norwegian University of Science and Technology, N-7 Trondheim, NORWAY.
More informationOn Coarse Geometry and Coarse Embeddability
On Coarse Geometry and Coarse Embeddability Ilmari Kangasniemi August 10, 2016 Master's Thesis University of Helsinki Faculty of Science Department of Mathematics and Statistics Supervised by Erik Elfving
More information1 The Observability Canonical Form
NONLINEAR OBSERVERS AND SEPARATION PRINCIPLE 1 The Observability Canonical Form In this Chapter we discuss the design of observers for nonlinear systems modelled by equations of the form ẋ = f(x, u) (1)
More informationMidterm 1. Every element of the set of functions is continuous
Econ 200 Mathematics for Economists Midterm Question.- Consider the set of functions F C(0, ) dened by { } F = f C(0, ) f(x) = ax b, a A R and b B R That is, F is a subset of the set of continuous functions
More informationr( = f 2 L 2 (1.2) iku)! 0 as r!1: (1.3) It was shown in book [7] that if f is assumed to be the restriction of a function in C
Inverse Obstacle Problem: Local Uniqueness for Rougher Obstacles and the Identication of A Ball Changmei Liu Department of Mathematics University of North Carolina Chapel Hill, NC 27599 December, 1995
More informationMax-Planck-Institut fur Mathematik in den Naturwissenschaften Leipzig Uniformly distributed measures in Euclidean spaces by Bernd Kirchheim and David Preiss Preprint-Nr.: 37 1998 Uniformly Distributed
More informationStrong Lyapunov Functions for Systems Satisfying the Conditions of La Salle
06 IEEE TRANSACTIONS ON AUTOMATIC CONTROL, VOL. 49, NO. 6, JUNE 004 Strong Lyapunov Functions or Systems Satisying the Conditions o La Salle Frédéric Mazenc and Dragan Ne sić Abstract We present a construction
More informationgrowth rates of perturbed time-varying linear systems, [14]. For this setup it is also necessary to study discrete-time systems with a transition map
Remarks on universal nonsingular controls for discrete-time systems Eduardo D. Sontag a and Fabian R. Wirth b;1 a Department of Mathematics, Rutgers University, New Brunswick, NJ 08903, b sontag@hilbert.rutgers.edu
More informationStochastic Nonlinear Stabilization Part II: Inverse Optimality Hua Deng and Miroslav Krstic Department of Mechanical Engineering h
Stochastic Nonlinear Stabilization Part II: Inverse Optimality Hua Deng and Miroslav Krstic Department of Mechanical Engineering denghua@eng.umd.edu http://www.engr.umd.edu/~denghua/ University of Maryland
More informationComputing Continuous and Piecewise Ane Lyapunov Functions for Nonlinear Systems
Computing Continuous and Piecewise Ane Lyapunov Functions for Nonlinear Systems Siguržur Hafstein Christopher M. Kellett Huijuan Li March 18, 2015 Abstract We present a numerical technique for the computation
More informationConvex Analysis and Optimization Chapter 2 Solutions
Convex Analysis and Optimization Chapter 2 Solutions Dimitri P. Bertsekas with Angelia Nedić and Asuman E. Ozdaglar Massachusetts Institute of Technology Athena Scientific, Belmont, Massachusetts http://www.athenasc.com
More informationIdentication and Control of Nonlinear Systems Using. Neural Network Models: Design and Stability Analysis. Marios M. Polycarpou and Petros A.
Identication and Control of Nonlinear Systems Using Neural Network Models: Design and Stability Analysis by Marios M. Polycarpou and Petros A. Ioannou Report 91-09-01 September 1991 Identication and Control
More informationSubdifferential representation of convex functions: refinements and applications
Subdifferential representation of convex functions: refinements and applications Joël Benoist & Aris Daniilidis Abstract Every lower semicontinuous convex function can be represented through its subdifferential
More informationON TRIVIAL GRADIENT YOUNG MEASURES BAISHENG YAN Abstract. We give a condition on a closed set K of real nm matrices which ensures that any W 1 p -grad
ON TRIVIAL GRAIENT YOUNG MEASURES BAISHENG YAN Abstract. We give a condition on a closed set K of real nm matrices which ensures that any W 1 p -gradient Young measure supported on K must be trivial the
More informationtion. For example, we shall write _x = f(x x d ) instead of _x(t) = f(x(t) x d (t)) and x d () instead of x d (t)(). The notation jj is used to denote
Extension of control Lyapunov functions to time-delay systems Mrdjan Jankovic Ford Research Laboratory P.O. Box 53, MD 36 SRL Dearborn, MI 4811 e-mail: mjankov1@ford.com Abstract The concept of control
More informationHOMEWORK ASSIGNMENT 6
HOMEWORK ASSIGNMENT 6 DUE 15 MARCH, 2016 1) Suppose f, g : A R are uniformly continuous on A. Show that f + g is uniformly continuous on A. Solution First we note: In order to show that f + g is uniformly
More informationExistence and Uniqueness
Chapter 3 Existence and Uniqueness An intellect which at a certain moment would know all forces that set nature in motion, and all positions of all items of which nature is composed, if this intellect
More informationRearrangements and polar factorisation of countably degenerate functions G.R. Burton, School of Mathematical Sciences, University of Bath, Claverton D
Rearrangements and polar factorisation of countably degenerate functions G.R. Burton, School of Mathematical Sciences, University of Bath, Claverton Down, Bath BA2 7AY, U.K. R.J. Douglas, Isaac Newton
More informationPROPERTY OF HALF{SPACES. July 25, Abstract
A CHARACTERIZATION OF GAUSSIAN MEASURES VIA THE ISOPERIMETRIC PROPERTY OF HALF{SPACES S. G. Bobkov y and C. Houdre z July 25, 1995 Abstract If the half{spaces of the form fx 2 R n : x 1 cg are extremal
More informationMarkov processes Course note 2. Martingale problems, recurrence properties of discrete time chains.
Institute for Applied Mathematics WS17/18 Massimiliano Gubinelli Markov processes Course note 2. Martingale problems, recurrence properties of discrete time chains. [version 1, 2017.11.1] We introduce
More informationSOME MEASURABILITY AND CONTINUITY PROPERTIES OF ARBITRARY REAL FUNCTIONS
LE MATEMATICHE Vol. LVII (2002) Fasc. I, pp. 6382 SOME MEASURABILITY AND CONTINUITY PROPERTIES OF ARBITRARY REAL FUNCTIONS VITTORINO PATA - ALFONSO VILLANI Given an arbitrary real function f, the set D
More informationOn Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q)
On Semicontinuity of Convex-valued Multifunctions and Cesari s Property (Q) Andreas Löhne May 2, 2005 (last update: November 22, 2005) Abstract We investigate two types of semicontinuity for set-valued
More informationConvex Analysis and Economic Theory AY Elementary properties of convex functions
Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analysis and Economic Theory AY 2018 2019 Topic 6: Convex functions I 6.1 Elementary properties of convex functions We may occasionally
More informationNear convexity, metric convexity, and convexity
Near convexity, metric convexity, and convexity Fred Richman Florida Atlantic University Boca Raton, FL 33431 28 February 2005 Abstract It is shown that a subset of a uniformly convex normed space is nearly
More information("-1/' .. f/ L) I LOCAL BOUNDEDNESS OF NONLINEAR, MONOTONE OPERA TORS. R. T. Rockafellar. MICHIGAN MATHEMATICAL vol. 16 (1969) pp.
I l ("-1/'.. f/ L) I LOCAL BOUNDEDNESS OF NONLINEAR, MONOTONE OPERA TORS R. T. Rockafellar from the MICHIGAN MATHEMATICAL vol. 16 (1969) pp. 397-407 JOURNAL LOCAL BOUNDEDNESS OF NONLINEAR, MONOTONE OPERATORS
More informationMAT 570 REAL ANALYSIS LECTURE NOTES. Contents. 1. Sets Functions Countability Axiom of choice Equivalence relations 9
MAT 570 REAL ANALYSIS LECTURE NOTES PROFESSOR: JOHN QUIGG SEMESTER: FALL 204 Contents. Sets 2 2. Functions 5 3. Countability 7 4. Axiom of choice 8 5. Equivalence relations 9 6. Real numbers 9 7. Extended
More informationNonlinear Control. Nonlinear Control Lecture # 8 Time Varying and Perturbed Systems
Nonlinear Control Lecture # 8 Time Varying and Perturbed Systems Time-varying Systems ẋ = f(t,x) f(t,x) is piecewise continuous in t and locally Lipschitz in x for all t 0 and all x D, (0 D). The origin
More informationSemi-strongly asymptotically non-expansive mappings and their applications on xed point theory
Hacettepe Journal of Mathematics and Statistics Volume 46 (4) (2017), 613 620 Semi-strongly asymptotically non-expansive mappings and their applications on xed point theory Chris Lennard and Veysel Nezir
More informationA Geometric Framework for Nonconvex Optimization Duality using Augmented Lagrangian Functions
A Geometric Framework for Nonconvex Optimization Duality using Augmented Lagrangian Functions Angelia Nedić and Asuman Ozdaglar April 15, 2006 Abstract We provide a unifying geometric framework for the
More informationBenchmark problems in stability and design of. switched systems. Daniel Liberzon and A. Stephen Morse. Department of Electrical Engineering
Benchmark problems in stability and design of switched systems Daniel Liberzon and A. Stephen Morse Department of Electrical Engineering Yale University New Haven, CT 06520-8267 fliberzon, morseg@sysc.eng.yale.edu
More informationMARKOV CHAINS: STATIONARY DISTRIBUTIONS AND FUNCTIONS ON STATE SPACES. Contents
MARKOV CHAINS: STATIONARY DISTRIBUTIONS AND FUNCTIONS ON STATE SPACES JAMES READY Abstract. In this paper, we rst introduce the concepts of Markov Chains and their stationary distributions. We then discuss
More informationObserver design for a general class of triangular systems
1st International Symposium on Mathematical Theory of Networks and Systems July 7-11, 014. Observer design for a general class of triangular systems Dimitris Boskos 1 John Tsinias Abstract The paper deals
More informationThe Pacic Institute for the Mathematical Sciences http://www.pims.math.ca pims@pims.math.ca Surprise Maximization D. Borwein Department of Mathematics University of Western Ontario London, Ontario, Canada
More informationSemi-Linear Diusive Representations for Non-Linear Fractional Dierential Systems Jacques AUDOUNET 1, Denis MATIGNON 2?, and Gerard MONTSENY 3 1 MIP /
Semi-Linear Diusive Representations for Non-Linear Fractional Dierential Systems Jacques AUDOUNET 1, Denis MATIGNON?, and Gerard MONTSENY 3 1 MIP / CNRS, Universite Paul Sabatier. 118, route de Narbonne.
More informationAutomatica. Robust supervisory control for uniting two output-feedback hybrid controllers with different objectives
Automatica 49 (2013) 1958 1969 Contents lists available at SciVerse ScienceDirect Automatica journal homepage: www.elsevier.com/locate/automatica Robust supervisory control for uniting two output-feedback
More informationTechnical Results on Regular Preferences and Demand
Division of the Humanities and Social Sciences Technical Results on Regular Preferences and Demand KC Border Revised Fall 2011; Winter 2017 Preferences For the purposes of this note, a preference relation
More informationIntroduction to Real Analysis
Introduction to Real Analysis Joshua Wilde, revised by Isabel Tecu, Takeshi Suzuki and María José Boccardi August 13, 2013 1 Sets Sets are the basic objects of mathematics. In fact, they are so basic that
More information(convex combination!). Use convexity of f and multiply by the common denominator to get. Interchanging the role of x and y, we obtain that f is ( 2M ε
1. Continuity of convex functions in normed spaces In this chapter, we consider continuity properties of real-valued convex functions defined on open convex sets in normed spaces. Recall that every infinitedimensional
More informationA LaSalle version of Matrosov theorem
5th IEEE Conference on Decision Control European Control Conference (CDC-ECC) Orlo, FL, USA, December -5, A LaSalle version of Matrosov theorem Alessro Astolfi Laurent Praly Abstract A weak version of
More informationTopic # /31 Feedback Control Systems. Analysis of Nonlinear Systems Lyapunov Stability Analysis
Topic # 16.30/31 Feedback Control Systems Analysis of Nonlinear Systems Lyapunov Stability Analysis Fall 010 16.30/31 Lyapunov Stability Analysis Very general method to prove (or disprove) stability of
More informationARE202A, Fall Contents
ARE202A, Fall 2005 LECTURE #2: WED, NOV 6, 2005 PRINT DATE: NOVEMBER 2, 2005 (NPP2) Contents 5. Nonlinear Programming Problems and the Kuhn Tucker conditions (cont) 5.2. Necessary and sucient conditions
More informationInput to state Stability
Input to state Stability Mini course, Universität Stuttgart, November 2004 Lars Grüne, Mathematisches Institut, Universität Bayreuth Part IV: Applications ISS Consider with solutions ϕ(t, x, w) ẋ(t) =
More informationU e = E (U\E) e E e + U\E e. (1.6)
12 1 Lebesgue Measure 1.2 Lebesgue Measure In Section 1.1 we defined the exterior Lebesgue measure of every subset of R d. Unfortunately, a major disadvantage of exterior measure is that it does not satisfy
More informationg 2 (x) (1/3)M 1 = (1/3)(2/3)M.
COMPACTNESS If C R n is closed and bounded, then by B-W it is sequentially compact: any sequence of points in C has a subsequence converging to a point in C Conversely, any sequentially compact C R n is
More informationTechinical Proofs for Nonlinear Learning using Local Coordinate Coding
Techinical Proofs for Nonlinear Learning using Local Coordinate Coding 1 Notations and Main Results Denition 1.1 (Lipschitz Smoothness) A function f(x) on R d is (α, β, p)-lipschitz smooth with respect
More informationReal Analysis Math 131AH Rudin, Chapter #1. Dominique Abdi
Real Analysis Math 3AH Rudin, Chapter # Dominique Abdi.. If r is rational (r 0) and x is irrational, prove that r + x and rx are irrational. Solution. Assume the contrary, that r+x and rx are rational.
More informationRemarks on multifunction-based. dynamical systems. Bela Vizvari c. RRR , July, 2001
R u t c o r Research R e p o r t Remarks on multifunction-based dynamical systems Gergely KOV ACS a Bela Vizvari c Marian MURESAN b RRR 43-2001, July, 2001 RUTCOR Rutgers Center for Operations Research
More informationarxiv: v3 [math.ds] 22 Feb 2012
Stability of interconnected impulsive systems with and without time-delays using Lyapunov methods arxiv:1011.2865v3 [math.ds] 22 Feb 2012 Sergey Dashkovskiy a, Michael Kosmykov b, Andrii Mironchenko b,
More informationOn integral-input-to-state stabilization
On integral-input-to-state stabilization Daniel Liberzon Dept. of Electrical Eng. Yale University New Haven, CT 652 liberzon@@sysc.eng.yale.edu Yuan Wang Dept. of Mathematics Florida Atlantic University
More informationNonsmooth Analysis in Systems and Control Theory
Nonsmooth Analysis in Systems and Control Theory Francis Clarke Institut universitaire de France et Université de Lyon [January 2008. To appear in the Encyclopedia of Complexity and System Science, Springer.]
More informationStability theory is a fundamental topic in mathematics and engineering, that include every
Stability Theory Stability theory is a fundamental topic in mathematics and engineering, that include every branches of control theory. For a control system, the least requirement is that the system is
More informationRobust distributed linear programming
Robust distributed linear programming Dean Richert Jorge Cortés Abstract This paper presents a robust, distributed algorithm to solve general linear programs. The algorithm design builds on the characterization
More informationEC 521 MATHEMATICAL METHODS FOR ECONOMICS. Lecture 1: Preliminaries
EC 521 MATHEMATICAL METHODS FOR ECONOMICS Lecture 1: Preliminaries Murat YILMAZ Boğaziçi University In this lecture we provide some basic facts from both Linear Algebra and Real Analysis, which are going
More informationExercises from other sources REAL NUMBERS 2,...,
Exercises from other sources REAL NUMBERS 1. Find the supremum and infimum of the following sets: a) {1, b) c) 12, 13, 14, }, { 1 3, 4 9, 13 27, 40 } 81,, { 2, 2 + 2, 2 + 2 + } 2,..., d) {n N : n 2 < 10},
More informationGeneral Theory of Large Deviations
Chapter 30 General Theory of Large Deviations A family of random variables follows the large deviations principle if the probability of the variables falling into bad sets, representing large deviations
More informationEconomics Noncooperative Game Theory Lectures 3. October 15, 1997 Lecture 3
Economics 8117-8 Noncooperative Game Theory October 15, 1997 Lecture 3 Professor Andrew McLennan Nash Equilibrium I. Introduction A. Philosophy 1. Repeated framework a. One plays against dierent opponents
More informationMathematics for Economists
Mathematics for Economists Victor Filipe Sao Paulo School of Economics FGV Metric Spaces: Basic Definitions Victor Filipe (EESP/FGV) Mathematics for Economists Jan.-Feb. 2017 1 / 34 Definitions and Examples
More informationObserver-based quantized output feedback control of nonlinear systems
Proceedings of the 17th World Congress The International Federation of Automatic Control Observer-based quantized output feedback control of nonlinear systems Daniel Liberzon Coordinated Science Laboratory,
More information