Local Stability and Stabilization of Quadratic-Bilinear Systems using Petersen's Lemma
Amir Enayati Kafshgarkolaei, Maziar S. Hemati
TL;DR
The paper addresses scalable local stability analysis and stabilization of quadratic-bilinear (QB) systems by exploiting Petersen's Lemma to convert nonconvex sign-definiteness conditions into tractable LMIs. The authors derive a main synthesis result that yields a static state-feedback gain $K = Y P^{-1}$ ensuring stability inside an ellipsoid $\hat{\mathcal{E}} = \{ x : x^T P^{-1} x \le 1 \}$ with a Lyapunov function $V(x)= x^T P^{-1} x$, and a corollary provides ellipsoidal ROA estimates for autonomous QB systems. The approach scales quadratically with the state dimension and is demonstrated on three benchmark problems, showing competitive accuracy to existing tools while enabling analysis of systems with hundreds of states. This framework offers a practical path to apply QB models across domains by providing scalable stability certificates and stabilizing controllers that were previously limited by computational complexity.
Abstract
Quadratic-bilinear (QB) systems arise in many areas of science and engineering. In this paper, we present a scalable approach for designing locally stabilizing state-feedback control laws and certifying the local stability of QB systems. Sufficient conditions are established for local stability and stabilization based on quadratic Lyapunov functions, which also provide ellipsoidal inner-estimates for the region of attraction and region of stabilizability of an equilibrium point. Our formulation exploits Petersen's Lemma to convert the problem of certifying the sign-definiteness of the Lyapunov condition into a line search over a single scalar parameter. The resulting linear matrix inequality (LMI) conditions scale quadratically with the state dimension for both stability analysis and control synthesis, thus enabling analysis and control of QB systems with hundreds of state variables without resorting to specialized implementations. We demonstrate the approach on three benchmark problems from the existing literature. In all cases, we find our formulation yields comparable approximations of stability domains as determined by other established tools that are otherwise restricted to systems with up to tens of state variables.
