Stabilization of Linear Systems with Structured Perturbations

The problem of stabilization of linear systems with bounded structured uncertainties are considered in this paper. Two notions of stability, denoted quadratic stability (Q-stability) and μ-stability, are considered, and corresponding notions of stabilizability and detectability are defined. In both cases, the output feedback stabilization problem is reduced via a separation argument to two simpler problems: full information (FI) and full control (FC). The set of all stabilizing controllers can be parametrized as a linear fractional transformation (LFT) on a free stable parameter. For Q-stability, stabilizability and detectability can in turn be characterized by Linear Matrix Inequalities (LMIs), and the FI and FC Q-stabilization problems can be solved using the corresponding LMIs. In the standard one-dimensional case the results in this paper reduce to well-known results on controller parametrization using state-space methods, although the development here relies more heavily on elegant LFT machinery and avoids the need for coprime factorizations

System-level, Input-output and New Parameterizations of Stabilizing Controllers, and Their Numerical Computation

It is known that the set of internally stabilizing controller $\mathcal{C}_{\text{stab}}$ is non-convex, but it admits convex characterizations using certain closed-loop maps: a classical result is the {Youla parameterization}, and two recent notions are the {system-level parameterization} (SLP) and the {input-output parameterization} (IOP). In this paper, we address the existence of new convex parameterizations and discuss potential tradeoffs of each parametrization in different scenarios. Our main contributions are: 1) We first reveal that only four groups of stable closed-loop transfer matrices are equivalent to internal stability: one of them is used in the SLP, another one is used in the IOP, and the other two are new, leading to two new convex parameterizations of $\mathcal{C}_{\text{stab}}$. 2) We then investigate the properties of these parameterizations after imposing the finite impulse response (FIR) approximation, revealing that the IOP has the best ability of approximating $\mathcal{C}_{\text{stab}}$ given FIR constraints. 3) These four parameterizations require no \emph{a priori} doubly-coprime factorization of the plant, but impose a set of equality constraints. However, these equality constraints will never be satisfied exactly in numerical computation. We prove that the IOP is numerically robust for open-loop stable plants, in the sense that small mismatches in the equality constraints do not compromise the closed-loop stability. The SLP is known to enjoy numerical robustness in the state feedback case; here, we show that numerical robustness of the four-block SLP controller requires case-by-case analysis in the general output feedback case.Comment: 20 pages; 5 figures. Added extensions on numerial computation and robustness of closed-loop parameterization