The concept of dissipativity, as introduced by Jan Willems, is one of the cornerstones of systems and control theory. Typically, dissipativity properties are verified by resorting to a mathematical model of the system under consideration. In this paper, we aim at assessing dissipativity by computing storage functions for linear systems directly from measured data. As our main contributions, we provide conditions under which dissipativity can be ascertained from a finite collection of noisy data samples. Three different noise models will be considered that can capture a variety of situations, including the cases that the data samples are noise-free, the energy of the noise is bounded, or the individual noise samples are bounded. All of our conditions are phrased in terms of data-based linear matrix inequalities, which can be readily solved using existing software packages.
Equilibrium-independent dissipativity (EID) is a recently introduced system property which requires a system to be dissipative with respect to any forced equilibrium configuration. This paper is a detailed examination of EID with quadratic supply rates for a common class of nonlinear control-affine systems. We provide an algebraic characterization of EID for such systems in the spirit of the Hill-Moylan lemma, where the usual stability condition is replaced by an incremental stability condition. Based on this characterization, we state results concerning internal stability, feedback stability,…
A new version of classical S-procedure in system theory is proposed based on duality in the space of positive definite matrices and introduction of matrix Lagrange multipliers. A new proof and extension of the recent results of T.Iwasaki, S. Hara, A. Fradkov ( Systems & Control Letters, 2005. Vol 54 (7), pp 681-691) concerning equivalence between frequency domain inequality on finite frequency range and constrained dissipativity property for linear systems is given. The results of this paper extend S-procedure to allow for analysis and design of systems with matrix inequalities constraints.
This note is concerned with the presentation of new delay-dependent dissipativity-based convex conditions (expressed in the form of linear matrix inequalities) for the design of static output feedback (SOF) stabilizing gains for open-loop unstable discrete-time systems with input time-varying delays. A modified definition of QSR-dissipativity combined with the use of Lyapunov-Krasovskii functionals as storage functions and the application of Finsler's Lemma lead to the gathering of non-interactive design conditions. We show that, differently from most works dealing with controller design for t…
Dissipativity properties of a class of nonlinear time-delay systems via Bessel-Legendre inequalities
Hassan II University of Casablanca（卡萨布兰卡哈桑二世大学）；University of Wuppertal（伍珀塔尔大学）；Fraunhofer IEG, Fraunhofer Research Institution for Energy Infrastructures and Geotechnologies IEG（弗劳恩霍夫能源基础设施和岩土技术研究所IEG）
Output-Feedback Controller Synthesis for Dissipativity and $H_2$ Performance of Autoregressive Systems from Noisy Input-Output Data
Faculty of Mechanical Engineering and Naval Architecture, University of Zagreb（机械与船舶工程学院，萨格勒布大学）；Electrical Engineering Faculty, Eindhoven University of Technology（电气工程学院，埃因霍温理工大学）
In a recent paper it was shown how a matrix S-lemma can be applied to construct controllers from noisy data. The current paper complements these results by proving a matrix version of the classical Finsler's lemma. This matrix Finsler's lemma provides a tractable condition under which all matrix solutions to a quadratic equality also satisfy a quadratic inequality. We will apply this result to bridge known data-driven control design techniques for both exact and noisy data, thereby revealing a more general theory. The result is also applied to data-driven control of Lur'e systems.
Dynamic Output-Feedback Controller Synthesis for Dissipativity and $H_2$ Performance from Noisy Input-Output Data
Faculty of Mechanical Engineering and Naval Architecture, University of Zagreb（机械与船舶工程学院，萨格勒布大学）；Electrical Engineering Faculty, Eindhoven University of Technology（电气工程学院，埃因霍温理工大学）
Dynamic Output-Feedback Controller Synthesis for Dissipativity and $H_2$ Performance from Noisy Input-State Data
Faculty of Mechanical Engineering and Naval Architecture, University of Zagreb（萨格勒布大学机械与船舶工程学院）；Electrical Engineering Faculty, Eindhoven University of Technology（埃因霍温理工大学电气工程学院）
We propose a new method to obtain feedback controllers of an unknown dynamical system directly from noisy input/state data. The key ingredient of our design is a new matrix S-lemma that will be proven in this paper. We provide both strict and non-strict versions of this S-lemma, that are of interest in their own right. Thereafter, we will apply these results to data-driven control. In particular, we will derive non-conservative design methods for quadratic stabilization, H_2 and H_inf control, all in terms of data-based linear matrix inequalities. In contrast to previous work, the dimensions o…
The fundamental lemma by Willems and coauthors facilitates a parameterization of all trajectories of a linear time-invariant system in terms of a single, measured one. This result plays an important role in data-driven simulation and control. Under the hood, the fundamental lemma works by applying a persistently exciting input to the system. This ensures that the Hankel matrix of resulting input/output data has the "right" rank, meaning that its columns span the entire subspace of trajectories. However, such binary rank conditions are known to be fragile in the sense that a small additive nois…
A new version of Farkas lemma of alternative linear systems is proposed. One and the same matrix $A$ and vector $b$ have always been used in alternative linear systems. The paper shows a different way of alternative systems involving application of different matrices with various dimensions, which can be advantageous from computational point of view.
We consider the problem of extending the classical S-lemma from commutative case to noncommutative cases. We show that a symmetric quadratic homogeneous matrix-valued polynomial is positive semidefinite if and only if its coefficient matrix is positive semidefinite. Then we extend the S-lemma to three kinds of noncommutative polynomials: noncommutative polynomials whose coefficients are real numbers, matrix-valued noncommutative polynomials and hereditary polynomials.
We prove an extension of Yuan's Lemma to more than two matrices, as long as the set of matrices has rank at most 2. This is used to generalize the main result of [A. Baccari and A. Trad. On the classical necessary second-order optimality conditions in the presence of equality and inequality constraints. SIAM J. Opt., 15(2):394--408, 2005], where the classical necessary second-order optimality condition is proved under the assumption that the set of Lagrange multipliers is a bounded line segment. We prove the result under the more general assumption that the hessian of the Lagrangian evaluated …
In this paper, the notion of robust strict QSR-dissipativity is applied to solve the static output feedback control problem for a class of continuous-time nonlinear rational systems subject to input saturation and bounded parametric uncertainties. A local dissipativity condition is combined with generalized sector conditions to formulate the synthesis of a stabilizing controller in terms of linear matrix inequalities. The strategy applies to general static output feedback design without any restrictions on the plant output equation. An iterative algorithm based on linear matrix inequalities is…
Various control schemes rely on a solution of a convex optimization problem involving a particular robust quadratic constraint, which can be reformulated as a linear matrix inequality using the well-known $\mathcal{S}$-lemma. However, the computational effort required to solve the resulting semidefinite program may be prohibitively large for real-time applications requiring a repeated solution of such a problem. We use some recent advances in robust optimization that allow us to reformulate such a robust constraint as a set of linear and second-order cone constraints, which are computationally…
This paper studies several problems related to quadratic matrix inequalities (QMI's), i.e., inequalities in the Loewner order involving quadratic functions of matrix variables. In particular, we provide conditions under which the solution set of a QMI is nonempty, convex, bounded, or has nonempty interior. We also provide a parameterization of the solution set of a given QMI. In addition, we state results regarding the image of such sets under linear maps, which characterize a subset of ``structured" solutions to a QMI. Thereafter, we derive matrix versions of the classical S-lemma and Finsler…
The paper considers a linear matrix inequality (LMI) that depends on a parameter varying in a compact topological space. It turns out that if a strict LMI continuously depends on a parameter and is feasible for any value of that parameter, then it has a solution which continuously depends on the parameter. The result holds true for LMIs that arise in S-procedure and Yakubovich lemma. It is shown that the LMI which is polynomially dependent on a vector of parameters can be reduced to a parameter-independent LMI of a higher dimension. The result is based on the recent generalization of Yakubovic…
We address the problem of designing a stabilizing closed-loop control law directly from input and state measurements collected in an open-loop experiment. In the presence of noise in data, we have that a set of dynamics could have generated the collected data and we need the designed controller to stabilize such set of data-consistent dynamics robustly. For this problem of data-driven control with noisy data, we advocate the use of a popular tool from robust control, Petersen's lemma. In the cases of data generated by linear and polynomial systems, we conveniently express the uncertainty captu…
We here specialize the well known Positive Real Lemma (also known as the Kalman-Yakubovich-Popov Lemma) to complex matrix-valued rational functions, (i) generalized positive even and (ii) odd. On the way we characterize the (non) minimality of realization of arbitrary systems through (i) the corresponding state matrix and (ii) moving the poles by applying static output feedback. We then explore the application of static output feedback to both generalized positive even and to odd functions.
In this paper we investigate data-driven predictive control of discrete-time linear descriptor systems. Specifically, we give a tailored variant of Willems' fundamental lemma, which shows that for descriptor systems the non-parametric modelling via a Hankel matrix requires less data compared to linear time-invariant systems without algebraic constraints. Moreover, we use this description to propose a data-driven framework for optimal control and predictive control of discrete-time linear descriptor systems. For the latter, we provide a sufficient stability condition for receding-horizon contro…
We consider the problem of efficiently computing the maximum likelihood estimator in Generalized Linear Models (GLMs) when the number of observations is much larger than the number of coefficients ($n \gg p \gg 1$). In this regime, optimization algorithms can immensely benefit from approximate second order information. We propose an alternative way of constructing the curvature information by formulating it as an estimation problem and applying a Stein-type lemma, which allows further improvements through sub-sampling and eigenvalue thresholding. Our algorithm enjoys fast convergence rates, re…
The Johnson-Lindenstrauss Lemma states that there exist linear maps that project a set of points of a vector space into a space of much lower dimension such that the Euclidean distance between these points is approximately preserved. This lemma has been previously used to prove that we can randomly aggregate, using a random matrix whose entries are drawn from a zero-mean sub-Gaussian distribution, the equality constraints of an Linear Program (LP) while preserving approximately the value of the problem. In this paper we extend these results to the inequality case by introducing a random matrix…
Farkas' lemma is a fundamental result from linear programming providing linear certificates for infeasibility of systems of linear inequalities. In semidefinite programming, such linear certificates only exist for strongly infeasible linear matrix inequalities. We provide nonlinear algebraic certificates for all infeasible linear matrix inequalities in the spirit of real algebraic geometry. More precisely, we show that a linear matrix inequality is infeasible if and only if -1 lies in the quadratic module associated to it. We prove exponential degree bounds for the corresponding algebraic cert…
