A Characterization of Semiglobal, Practical, Asymptotic Stability for Gain-Parametrized Systems
Karla Kvaternik

TL;DR
This paper introduces a new stability concept called semiglobal, practical, asymptotic stability (SPAS) for gain-parametrized nonlinear discrete-time systems, providing a Lyapunov-based characterization without requiring an attractor.
Contribution
It defines SPAS for a broad class of systems and offers a Lyapunov criterion that does not depend on the existence of a stable attractor.
Findings
SPAS is characterized via Lyapunov functions.
The theorem applies to systems without stable attractors.
Provides a new stability analysis framework for gain-parametrized systems.
Abstract
We consider a general class of nonlinear, constrained, discrete-time systems whose dynamics are parametrized by a set of gains. We define the semiglobal, practical, asymptotic stability (SPAS) of compact sets for this class of systems, and we provide a Lyapunov characterization of such sets. A set A that is SPAS with respect to a given system need not be an attractor for that system. Relative to existing characterizations of similar qualitative behaviors, our SPAS theorem does not require the existence of an asymptotically stable attractor associated to a nominal counterpart of the given dynamics.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed Control Multi-Agent Systems · Stability and Controllability of Differential Equations · Gene Regulatory Network Analysis
A Characterization of Semiglobal, Practical, Asymptotic Stability for Gain-Parametrized Systems
Karla Kvaternik K. Kvaternik is with the Department of Mechanical and Aerospace Engineering, Princeton University. e-mail: ([email protected]). This research was supported by the Army Research Office Grant W911NF-14-1-0431.
Abstract
We consider a general class of nonlinear, constrained, discrete-time systems whose dynamics are parametrized by a set of gains. We define the semiglobal, practical, asymptotic stability (SPAS) of compact sets for this class of systems, and we provide a Lyapunov characterization of such sets. A set that is SPAS with respect to a given system need not be an attractor for that system. Relative to existing characterizations of similar qualitative behaviors, our SPAS theorem does not require the existence of an asymptotically stable attractor associated to a nominal counterpart of the given dynamics.
I Introduction
We propose an explicit definition of semiglobal, practical, asymptotic stability (SPAS) of compact sets for a class of nonlinear, constrained, discrete-time systems parametrized by a set of tunable gains. Our main contribution is a theorem that characterizes SPAS directly in terms of certain properties of a Lyapunov function.
In the literature, SPAS is most often associated with dynamical systems affected by non-vanishing perturbations, and is typically characterized as a consequence of a robustness property of the stability of their “nominal” counterparts. The application of existing SPAS theorems usually entails identifying an attractor for a nominal system, and establishing its asymptotic stability. Then, it may be concluded that for any arbitrarily large set (contained in the basin of attraction of for the nominal system), and for any arbitrarily small set containing , there exists a (sufficiently small) non-vanishing perturbation of the nominal dynamics and a set , such that is asymptotically stable for the perturbed system, with a basin of attraction . Examples of existing SPAS theorems include Theorem 17 in [1], Corollary 1 in [2] and Theorem 10 in [3].
In this literature, the word “semiglobal” refers to the fact that , the basin of attraction of the perturbed system, can be arbitrarily large within , while “practical” typically refers to the fact that can be arbitrarily small (so long as it contains ), provided the perturbation of the nominal dynamics is sufficiently small. This literature provides a variety of characterizations of SPAS-like qualitative behaviors, and it is not always clear that these are equivalent.
Instead of characterizing the qualitative behavior of SPAS as a consequence of the asymptotic stability of a nominal attractor, we provide an explicit definition of SPAS sets, and characterize the SPAS property directly in terms of a set of conditions on a Lyapunov-like function. We thereby avoid the need to identify a nominal system and establish the asymptotic stability of its attractor.
We phrase our definition of SPAS in terms of a set of gains parametrizing the system dynamics. Such gains may for example model fixed step-sizes in iterative optimization algorithms or gradient estimation schemes. We say that a set is SPAS for a given system if for some neighborhood of , and for every arbitrarily large set , there exists a set of gains such that for all systems with gains in this set, trajectories initialized inside are asymptotically attracted to and never deviate far from (q.v. II, for a more precise definition).
Our definition thus retains the general intent of existing SPAS characterizations, while our SPAS theorem provides an alternative means for establishing the qualitative behavior that SPAS implies. This alternative characterization of SPAS is potentially useful in situations where a nominal version of a given system and its associated attractor may be difficult to identify or analyse (q.v. Examples III.3 and III.1 in III). In fact, a set that satisfies the conditions of our SPAS theorem need not constitute a set of fixed points for the given dynamics.
For gain-parametrized systems having an obvious nominal counterpart with an asymptotically stable attractor, existing SPAS characterizations apply, and lead to conclusions that are consistent with our own; in such cases a Lyapunov function and attractor for the nominal system will often satisfy the conditions of our SPAS theorem, and the actual system dynamic can be expressed as a perturbed version of the nominal dynamic. However, whereas existing characterizations typically posit the existence of a non-vanishing perturbation corresponding to the desired size of the aforementioned sets and , our formulation is tantamount to assuming that a disturbance is given, and that its size is not subject to design. Instead, our SPAS theorem posits the existence of a set of gains for which SPAS holds. In this sense, the SPAS characterization provided here is less abstract, for the class of gain-parametrized systems.
In the proof of our SPAS Theorem II.1, we draw on some of the analytic techniques found in 5.14 of [4], where a related notion of “practical stability” is considered. In particular, we model the invariance arguments used in the proof of Theorem II.1 on the proof of Theorem 4.14.2 in [4]. Our SPAS theorem can be viewed as a generalization of Theorem 4.14.2 and Corollary 5.14.3 in [4] to parametrized systems whose parameter valuations control the size of the basin of attraction and the size of the neighborhood to which trajectories initiated in this basin ultimately converge.
This paper is organized as follows. In II we describe the class of systems under consideration, state a definition of SPAS sets for such systems, and we state a set of conditions characterizing the SPAS property in Theorem II.1. In III we demonstrate the utility and application of Theorem II.1 through a number of examples, and in IV we provide the proof of Theorem II.1. We conclude the paper in V.
Notation and Preliminaries
Throughout this paper we use the Euclidean vector norm . If is closed and , then
[TABLE]
is the orthogonal projection of onto . The set of non-negative real numbers is denoted by , while the set of positive real numbers is denoted by . For a point , and , and . For a compact set , \bar{B}_{r}(S)=\{x\in\mathbb{R}^{n}\;\big{|}\;\|x-\mathbf{P}_{S}(x)\|\leq r\}, while B_{r}(S)=\{x\in\mathbb{R}^{n}\;\big{|}\;\|x-\mathbf{P}_{S}(x)\|<r\}. The set of continuous (resp. continuously differentiable) functions from into is denoted by (resp. ). We say that a function is positive definite with respect to a closed set on a set if, , and for all . A function on is radially unbounded with respect to a closed set , if for any , there exists an such that , for all . The gradient of a differentiable function is denoted by . For a sequence we use to stand for , and to stand for . For , is its convex hull.
II Semiglobal, Practical, Asymptotic Stability
We consider a class of discrete-time dynamical systems of the form
[TABLE]
where is a closed, convex set, and parametrizes the function .
We define semiglobal, practical, asymptotic stability (SPAS) of compact sets for (2) in Definitions II.1 to II.4, and in Theorem II.1 we provide a Lyapunov characterization of SPAS. We discuss these definitions and characterization in the remarks that follow.
Definition II.1*.*
A set is practically stable for (2) if for some , and for any , there exists a positive, real number and a set , such that whenever and , , for all .
Definition II.2*.*
A compact set is uniformly attractive for (2) on a compact , if for every for which , there exists a number such that , whenever and .
Remark II.1*.*
If a compact set is uniformly attractive for (2) on every compact , then satisfies the usual definition of attractivity for (2).
Definition II.3*.*
A compact set is semiglobally, practically attractive for (2) if for some , and for any , with , there exists a set such that whenever , the set is uniformly attractive for (2) on .
Definition II.4*.*
A set is semiglobally practically asymptotically stable (SPAS) for (2) if it is practically stable and semiglobally, practically attractive for (2).
The following theorem characterizes SPAS in terms of a Lyapunov function with certain properties.
Theorem II.1*.*
Consider the system (2), and suppose there exists a function which is radially unbounded and positive definite with respect to a compact set on . Suppose that for some and for any positive, real , and (with ) there exists a set and a function such that whenever :
- •
P1: for all ,
- •
P2: , for all , and
- •
P3: , for all .
Then, is SPAS for (2), with Lyapunov function .
The proof is given in IV.
Remark II.2*.*
To satisfy the SPAS definition, the numbers and in Definitions II.1 and II.3 need not coincide, nor do the sets and .
Remark II.3*.*
As shown in the upcoming Examples III.1 and III.3, the set need not be an attractor for (2).
Remark II.4* ( determines and ).*
The numbers and in Definitions II.1 and II.3 are determined by the number in the statement of Theorem II.1. More specifically, in the proof of Theorem II.1, we construct as , and as increasing with and depending additionally only on the properties of the function .
Depending on the application, may relate to the size of a given non-vanishing disturbance whose effect cannot be affected by any of the gain parameters. Examples of systems for which are considered in [5].
In contrast to , the number in the statement of Theorem II.1 relates to those components of errors, typically arising within the Lyapunov analysis itself, whose size can be modulated through some of the system gains (q.v. Example III.1).
Remark II.5* (Relating a conventional definition of stability to Definition II.1).*
A conventional definition of set stability would apply to a particular -instance of (2), and might read as follows:
Definition II.5*.*
A compact set is stable for a system \xi^{+}=\mathbf{P}_{\Xi}\big{[}f(\xi;\pi_{o})\big{]} if for every there exists a such that for all , whenever .
Definition II.1, which pertains to a parametrized family of dynamical systems, cannot be directly compared to Definition II.5, even for the case in which . Specifically, for any given (analogous to in Definition II.5), Definition II.1 requires the existence of a , and only a sub-family of (2) to generate trajectories that never exit when initialized within . In other words, Definition II.1 allows the instantiations of (2) to depend on the given .
However, in terms of the conditions of Theorem II.1 (and based on the analytic techniques employed in the invariance arguments in its proof) conventional stability is obtained for the special case in which P1 to P3 hold with , and independently of . An example of a system for which this happens is given in Example 3.3 in [5].
Remark II.6* (Related notions of SPAS).*
There is a variety of characterizations of SPAS in the literature. For example, Corollary 1 of [2], which applies to continuous-time differential inclusions, can be paraphrased as follows: if the compact set is asymptotically stable with basin of attraction for the nominal system , and the multifunction satisfies certain technical conditions, then, for any arbitrarily large set and any arbitrarily small set (contained in , and containing ), there exists a non-vanishing perturbation of size and a compact set
[TABLE]
such that is asymptotically stable for the perturbed system
[TABLE]
with a basin of attraction containing .
Another example is Theorem 17 in [1], which applies to a very general class of hybrid systems. This theorem can be paraphrased (and specialized to difference inclusions only) as follows: if the compact set is asymptotically stable with basin of attraction for the nominal system , and the multifunction satisfies certain technical conditions, then, for any arbitrarily small and any arbitrarily large set , there exists a non-vanishing perturbation of size , a proper indicator function for on (q.v. p53 in [1] for a definition), and a -class function such that all solutions of the perturbed system
[TABLE]
initialized inside , satisfy
[TABLE]
One difference between characterizations such as these and the characterization provided in Definition II.4 and Theorem II.1, is that the latter does not require the existence of an asymptotically stable attractor for a nominal counterpart to (2). This alternative characterization could therefore be useful in the analysis of systems for which a nominal counterpart and its associated attractor may be difficult to identify and analyse, and for which it is easier to directly identify a set that might approximate the attractor of the given system. As noted in Remark II.3, the set in the statement of Theorem II.1 need not be an actual attractor for (2). In Example III.1 we consider an iterative numerical method that exemplifies this situation.
For the class of gain-parametrized systems (2) for which a nominal dynamic and an asymptotically stable nominal attractor can be easily identified, existing SPAS characterizations do apply, but lead to conclusions that are different, though consistent with those of Theorem II.1. Specifically, whereas existing characterizations of SPAS typically posit the existence of a non-vanishing perturbation corresponding to the desired size of the sets and in (3), or the number in (5), we assume that a disturbance is given and that its size, which relates to in Theorem II.1, is not subject to design. Instead, Theorem II.1 posits the existence of a set of gains for which (2) exhibits the qualitative behavior specified by Definition II.4. In this sense, for the class of gain-parametrized systems represented by (2), the SPAS characterization that we provide is less abstract than existing SPAS characterizations.
III Examples
In the following three examples, we motivate Theorem II.1 and demonstrate its application.
Example III.1* (Generic iterative numerical methods).*
Consider an iterative numerical method of the form
[TABLE]
where is a closed, convex subset of , is a tunable gain, , and is locally Lipschitz continuous.
Suppose we know that for some compact set and number , the following hold:
[TABLE]
This can happen, for example, when is a set of minima of some strongly convex function, and is an approximation of its gradient. We can then use Theorem II.1 to conclude that is SPAS for (6) despite the fact that does not constitute a set of fixed points for (6), and therefore cannot be an attractor for (6).
Specifically, we let and . By expanding the expression for and using the properties of the projection operator (q.v. Lemma 4.1, [5]), it can be shown that
[TABLE]
Using (7), Young’s inequality and the fact that is locally Lipschitz continuous, we have that for any , there exists a number such that
[TABLE]
for all .
Since and is compact, the number
[TABLE]
exists, and is positive. Therefore, for all ,
[TABLE]
and we see that for any given , and , the conditions of Theorem II.1 are satisfied with and
[TABLE]
by taking , where , and
[TABLE]
Example III.2* (Iterative methods with SPSP search directions).*
Another motivation for the way in which Theorem II.1 is formulated is that it is particularly well suited to the analysis of a large class of iterative methods employing semiglobal, practical, strictly pseudogradient (SPSP) search directions. This class of systems takes the form
[TABLE]
where at every , the search direction can be any element of a multifunction that has the SPSP property, which is defined as follows [5]:
A multifunction is SPSP on a set with respect to a differentiable function , which is positive definite and radially unbounded with respect to a compact set , if for some and , and for any (with ),
[TABLE]
and there exists a function which is positive on \Xi\cap\big{(}\bar{B}_{\sigma}(\mathcal{A})\backslash B_{\epsilon}(\mathcal{A})\big{)} and radially unbounded with respect to on , such that
[TABLE]
In [5], we consider a number of optimization-related examples of iterative methods that fall within this class, we show that under a variety of standard additional assumptions on the search directions, the set is SPAS for this class of algorithms, and we prove that the SPSP property is robust under absolute and relative deterministic errors on the search directions.
Example III.3* (Consensus Optimization).*
Consider a system of the form
[TABLE]
where , and is differentiable and strictly convex, and is stochastic, symmetric, and such that there exists a number for which
[TABLE]
whenever , where . The strict convexity of implies the existence of a unique minimizer . Algorithm (14) is a special case of a decentralized optimization method originating in [6], and further studied in [7].
Unless it happens to be the case that the individual optima coincide, the actual equilibrium of (14) may be difficult to identify. An equilibrium of (14) is a fixed point of the mapping
[TABLE]
where , and . From this expression it is evident that a point , satisfying , is not an equilibrium for (14) unless ; the properties of imply that only for . On the other hand for , it is not generally the case that .
One way to analyse this system is to resolve its dynamics along the so-called “agreement subspace” and its orthogonal complement. To that end, it can be shown (see 3.4.1 in [7]) that the variables and , where , evolve according to
[TABLE]
and
[TABLE]
We observe that , where denotes the sum of individual objectives , and we note that if is strictly convex for each , then is strictly convex, and has a unique minimizer .
Therefore, when , (17) takes the form of (6), with and . Moreover, has the strict pseudogradient property (a special case of the SPSP property, defined in [5]) with respect to either or , as shown in Example 3.1 in [5]. This observation, together with (15), is exploited in 3.6 of [7] to show that the function satisfies the conditions of Theorem II.1. We are thereby able to conclude that the set , though not generally an equilibrium, is SPAS for (17)-(18).
IV Proof of Theorem II.1
In order to satisfy Definition II.4, we must demonstrate that given the hypotheses of Theorem II.1 and any numbers , and , there exist parameter sets and , and numbers and for which the behavior of (2) specified in Definitions II.1 and II.3 is guaranteed.
IV-1 Preliminaries
For any , we let denote the set \{\xi\in\mathbb{R}^{n}\;\big{|}\;V(\xi)\leq r\} while denotes its boundary \{\xi\in\mathbb{R}^{n}\;\big{|}\;V(\xi)=r\}. We observe that since is assumed to be radially unbounded with respect to , and is assumed to be compact, all the sublevel sets are compact. Moreover, for any , the intersection is nonempty since is a subset of both and .
We begin with a set construction and a claim which are applied in the proofs of both practical stability and semiglobal, practical attractivity.
Construction IV.1* (Picking and from ).*
Let be an arbitrarily large, positive, real number, and let be the smallest sublevel set of containing – i.e.,
[TABLE]
Let be the smallest ball containing – i.e.,
[TABLE]
Construction IV.1 is illustrated in Figure 1
The following claim states that certain sublevel sets of can be made forward invariant for (2) under an appropriate restriction on the gains .
Claim IV.1* (Forward invariance of ).*
Let and be any positive, real numbers such that , and use Construction IV.1 to generate the numbers and from . Then, for any , with constructed so that is the smallest sublevel set of containing – i.e.,
[TABLE]
there exists a parameter set such that whenever , is forward invariant for (2).
Proof.
By the hypotheses of Theorem II.1, there exists a parameter set , corresponding to the choice , such that
[TABLE]
whenever .
Let . We will show that if for some , , then necessarily . Suppose that . Then, either , or .
If , then , meaning that . By (22), , and therefore , meaning that .
On the other hand if , then , while , by (23). Therefore, , implying that . The conclusion then follows from the principle of induction.
IV-2 Practical Stability
To show that (2) exhibits practical stability at , we first construct the requisite number , and then apply Construction IV.3 and Claim IV.1 to generate the parameter set .
Construction IV.2* (Constructing from ).*
Let be as in the theorem statement, and let be the smallest sublevel set of containing – i.e.,
[TABLE]
Let be the smallest ball containing – i.e.,
[TABLE]
Let be the smallest sublevel set of containing – i.e.,
[TABLE]
Let be the smallest ball containing – i.e.,
[TABLE]
Construction IV.2 is depicted in Figure 2.
We use the next construction to generate the number in Definition II.1 from the given . We also construct the numbers and , which are used as inputs to the Claim IV.1 to generate a parameter set .
Construction IV.3* (Picking , and from ).*
Use Construction IV.2 to generate the number , and let be arbitrary, as in Definition II.1.
Let be the largest sublevel set of that is contained inside – i.e.,
[TABLE]
Let be the largest ball contained inside – i.e.,
[TABLE]
Let be the largest sublevel set of that is contained inside – i.e.,
[TABLE]
Let be the largest ball contained inside – i.e.,
[TABLE]
Construction IV.3 is summarized by the following set containment relationships:
[TABLE]
which are depicted in Figure 3.
Remark IV.1*.*
From the preceding constructions, we make the following observations. For , Construction IV.3 coincides with Construction IV.2, in the sense that , and . Whenever , evidently and . Moreover, for any , the construction of in (28) obeys .
The practical stability of for (2) follows from Constructions IV.2 and IV.3, and by applying Claim IV.1. Specifically, generate the number using Construction IV.2, and the numbers , and using Construction IV.3. Then, apply Claim IV.1, with , , and 111Note that in the proof of Claim IV.1, Construction IV.1 is applied with , generating the number , which, according to (28), coincides with .. This generates the parameter set such that is forward invariant for (2) whenever . We observe that Definition II.1 is satisfied since trajectories initialized inside never leave , and therefore always remain within .
IV-3 Semiglobal, Practical Attractivity
Our second task is to show that under the hypotheses of the Theorem, is semiglobally, practically attractive for (2), in the sense of Definition II.3.
We pick . As in Definition II.3, let and be arbitrary, with . Use Construction IV.1, with , to generate the numbers and . Generate a parameter set by applying Claim IV.1, with , and . Thus, by choosing , we ensure that is forward invariant for (2), and that
[TABLE]
In order to show that is semiglobally, practically attractive for (2) on , we will show that is uniformly attractive for (2) on , whenever . Let be arbitrary, but such that . Since is continuous, it attains a minimum value on the compact set . Let
[TABLE]
By (34), on , and therefore is strictly positive. It follows from (33) and the fact that , that whenever , the inequality
[TABLE]
holds for all for which . Solving (36), we obtain that
[TABLE]
which, together with the positive definiteness of , shows that no sequence , generated by (2) and initialized inside can remain in
forever. The forward invariance of implies that no such sequence can leave , and we therefore conclude that enters in finitely many iterations, showing that is attractive for (2) on .
Since and are chosen arbitrarily (but such that ), we have shown that is semiblobally practically attractive for (2).
Having shown that is both practically stable and semiglobally, practically attractive for (2), we conclude that is semiglobally, practically, asymptotically stable for (2), and the theorem is proved. .
V Conclusions
We considered a general class of constrained, nonlinear, discrete-time, gain-parametrized systems, and we contributed a tool for the qualitative analysis of such systems. We provided a definition of semiglobal, practical, asymptotic stability of compact sets under a given dynamic, and a theorem that characterizes this property in terms of conditions on a Lyapunov-like function. The SPAS theorem we provided does not require the existence of an asymptotically stable attractor for a nominal counterpart to a given system dynamic, and a set having the SPAS property for a given system need not constitute a set of fixed points for that system.
Acknowledgments
The author would like to thank Professor Andrew Teel for valuable feedback, and to Professor Naomi Leonard for her support and encouragement.
The reference list from the paper itself. Each links out to its DOI / PubMed record.
- 1[1] R. Goebel, R.G. Sanfelice, and A.R. Teel. Hybrid dynamical systems. IEEE Control Systems Magazine , pages 28–93, 2009.
- 2[2] A.R. Teel. Lyapunov methods in nonsmooth optimization, part 1: quasi-newton algorithms for lipschitz, regular functions. Proceedings of the 39th IEEE Conference on Decision and Control , pages 112–117, 2000.
- 3[3] C.M. Kellet and A.R. Teel. Smooth lyapunov functions and robustness of stability for difference inclusions. Systems and Control Letters , 52:395–405, 2004.
- 4[4] R.P. Agarwal. Difference equations and inequalities - theory, methods and applications . Marcel Dekker, 2000.
- 5[5] K. Kvaternik. A semiglobal, practical, strict pseudogradient property for iterative methods. Arxiv , 2017.
- 6[6] A. Nedić and A. Ozdaglar. Distributed subgradient methods for multi-agent optimization. IEEE Transactions on Automatic Control , 54:48–60, 2009.
- 7[7] K. Kvaternik. Decentralized coordination control for dynamic multiagent systems . Ph D thesis, University of Toronto, 2015.
