Related papers: Lifted polytope methods for stability analysis of …
This paper proposes a bilevel hierarchy of strengthened complex moment relaxations for complex polynomial optimization. The key trick entails considering a class of positive semidefinite conditions that arise naturally in characterizing the…
In this paper, we propose a distributed computing approach to solving large-scale robust stability problems on the simplex. Our approach is to formulate the robust stability problem as an optimization problem with polynomial variables and…
This paper deals with input/output-to-state stability (IOSS) of switched nonlinear systems in the discrete-time setting. We present an algorithm to construct periodic switching signals that obey pre-specified restrictions on admissible…
We study point-line configurations through the lens of projective geometry and matroid theory. Our focus is on their realisation spaces, where we introduce the concepts of liftable and quasi-liftable configurations, exploring cases in which…
We build on the stability-preserving school choice model introduced and studied recently in [MV18]. We settle several of their open problems and we define and solve a couple of new ones.
This paper provides sufficient conditions for stability of switched linear systems under dwell-time switching. Piece-wise quadratic functions are utilized to characterize the Lyapunov functions and bilinear matrix inequalities conditions…
This paper studies finite-time stability of a class of hybrid systems. We present sufficient conditions in terms of multiple generalized Lyapunov functions for the origin of the hybrid system to be finite-time stable. More specifically, we…
For interval polynomial matrices, we identify the minimal testing set, whose stability can guarantee that of the whole uncertain set. Our results improve the conclusions given by Kamal and Dahleh.
These notes derive a number of technical results on nonlinear contraction theory, a comparatively recent tool for system stability analysis. In particular, they provide new results on the preservation of contraction through system…
This paper studies data-driven stabilization of a class of unknown polynomial systems using data corrupted by bounded noise. Existing work addressing this problem has focused on designing a controller and a Lyapunov function so that a…
We establish the uniform in time stability, w.r.t. the marginals, of the Iterative Proportional Fitting Procedure, also known as Sinkhorn algorithm, used to solve entropy-regularised Optimal Transport problems. Our result is quantitative…
In this paper we first study the fixed-time stabilizability of discrete-time switched linear control systems. Using a geometric approach, we derive conditions under which such systems can be stabilized within a prescribed number of steps,…
This paper addresses the stabilization issue for fractional order switching systems. Common Lyapunov method is generalized for fractional order systems and frequency domain stability equivalent to this method is proposed to prove the…
Symmetry is the essential element of lifted inference that has recently demon- strated the possibility to perform very efficient inference in highly-connected, but symmetric probabilistic models models. This raises the question, whether…
Two distinct algorithms are presented to extract (schemata of) resolution proofs from closed tableaux for propositional schemata. The first one handles the most efficient version of the tableau calculus but generates very complex…
In real world applications, uncertain parameters are the rule rather than the exception. We present a reachability algorithm for linear systems with uncertain parameters and inputs using set propagation of polynomial zonotopes. In contrast…
We consider kinetic systems and prove their stability working in weighted spaces in which the systems are symmetric. We prove stability for various explicit and implicit semi-discrete and fully discrete schemes. The applications include…
Characterization of classes of switching signals that ensure stability of switched systems occupies a significant portion of the switched systems literature. This article collects a multitude of stabilizing switching signals under an…
Lifted probabilistic inference exploits symmetries in a probabilistic model to allow for tractable probabilistic inference with respect to domain sizes. To apply lifted inference, a lifted representation has to be obtained, and to do so,…
We present a model for exact recursive Bayesian filtering based on lifted multiset states. Combining multisets with lifting makes it possible to simultaneously exploit multiple strategies for reducing inference complexity when compared to…