For discrete-time positive Lur'e systems, incremental l1 and l_infinity gains are upper-bounded by linear programs, and a linear program designs state feedback to regulate the l_infinity gain.
Polyhedral Estimation of L-1 and L-infinity Incremental Gains of Nonlinear Systems
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We provide novel dissipativity conditions for bounding the incremental L-1 gain of systems. Moreover, we adapt existing results on the L-infinity gain to the incremental setting and relate the incremental L-1 and L-infinity gain bounds through system adjoints. Building on work on optimization based approaches to constructing polyhedral Lyapunov functions, we make use of these conditions to obtain a Linear Programming based algorithm that can provide increasingly sharp bounds on the gains as a function of a given candidate polyhedral storage function or polyhedral set. The algorithm is also extended to allow for the design of linear feedback controllers for performance, as measured by the bounds on the incremental gains. We apply the algorithm to a couple of numerical examples to illustrate the power, as well as some limitations, of this approach.
citation-role summary
citation-polarity summary
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Incremental Gain Computation and Regulation of Discrete-time Positive Lur\'e Systems using Linear Programming
For discrete-time positive Lur'e systems, incremental l1 and l_infinity gains are upper-bounded by linear programs, and a linear program designs state feedback to regulate the l_infinity gain.