An Exact, Finite Dimensional Representation for Full-Block, Circle Criterion Multipliers
Felix Biertümpfel, Bin Hu, Geir Dullerud, Peter Seiler
TL;DR
The paper introduces a finite-dimensional, copositivity-based representation for the complete set of full-block circle-criterion multipliers in the interconnection of a discrete-time LTI system with a non-repeated, sector-bounded nonlinearity. It establishes that the set of incremental input/output pairs of a specially constructed piecewise-linear function coincides with the set of input/output pairs of all non-repeated nonlinearities, enabling a finite characterization of the multipliers via copositivity constraints. The authors prove an exact equivalence between the newly defined $\mathcal{M}_{\text{inc}}$ and the traditional full-block set $\mathcal{M}_{fb}$, with exact results available for input/output dimension $m\le4$, and demonstrate improved conservatism over standard diagonal or vertex relaxations through a numerical example. The approach yields a practical SDP framework to certify internal stability and induced $\ell_2$-gain with reduced computational burden for small-scale nonlinearities, while highlighting the need for copositive checks or relaxations in higher dimensions.
Abstract
This paper provides the first finite-dimensional characterization for the complete set of full-block, circle criterion multipliers. We consider the interconnection of a discrete-time, linear time-invariant system in feedback with a non-repeated, sector-bounded nonlinearity. Sufficient conditions for stability and performance can be derived using: (i) dissipation inequalities, and (ii) Quadratic Constraints (QCs) that bound the input/output pairs of the nonlinearity. Larger classes of QCs (or multipliers) reduce the conservatism of the conditions. Full-block, circle criterion multipliers define the complete set of all possible QCs for non-repeated, sector-bounded nonlinearities. These provide the least conservative conditions. However, full-block multipliers are defined by an uncountably infinite number of constraints and hence do not lead to computationally tractable solutions if left in this raw form. This paper provides a new finite-dimensional characterization for the set of full-block, circle criterion multipliers. The key theoretical insight is: the set of all input/output pairs of non-repeated sector-bounded nonlinearities is equal to the set of all incremental pairs for an appropriately constructed piecewise linear function. Our new description for the complete set of multipliers only requires a finite number of matrix copositivity constraints. These conditions have an exact, computationally tractable implementation for problems where the nonlinearity has small input/output dimensions $(\le 4)$. We illustrate the use of our new characterization via a simple example.
