Certification of Linear Inclusions for Nonlinear Systems
Yehia Abdelsalam, Sebastian Engell
TL;DR
The paper tackles certifying that a given set of vertex linear systems forms a polytopic Linear Difference Inclusion (LDI) for a nonlinear system around an equilibrium inside a region $\mathcal{Z}$. It introduces a Farkas' lemma–based optimization problem that yields a Yes/No certificate: a negative optimum proves the candidate vertex set is not an LDI, while a nonnegative global optimum (for all $c>0$) confirms it. The framework analyzes deviations $\delta x$ and $\delta u$, enforcing nonnegative weights $\alpha(x,u)$ with sum 1 to realize the inclusion, and can reduce conservatism in LDI enclosures even when the equilibrium is not at the origin. Because the resulting problem is non-convex, it relies on global solvers or multi-start strategies, and the paper demonstrates both limitations and improvements through illustrative examples, suggesting directions for more reliable and tighter LDI determinations.
Abstract
In this work, we propose novel method for certifying if a given set of vertex linear systems constitute a linear difference inclusion for a nonlinear system. The method relies on formulating the verification of the inclusion as an optimization problem in a novel manner. The result is a Yes/No certificate. We illustrate how the method can be useful in obtaining less conservative linear enclosures for nonlinear systems.
