Polyhedral Lyapunov functions can approximate any norm arbitrarily well. Because of this, they are used to study the stability of linear time varying and linear parameter varying systems without being conservative. However, the computational cost associated with using them grows unbounded as the size of their representation increases. Finding them is also a hard computational problem.Here we present an algorithm that attempts to find polyhedral functions while keeping the size of the representation fixed, to limit computational costs. We do this by measuring the gap from contraction for a given polyhedral set. The solution is then used to find perturbations on the polyhedral set that reduce the contraction gap. The process is repeated until a valid polyhedral Lyapunov function is obtained.The approach is rooted in linear programming. This leads to a flexible method capable of handling additional linear constraints and objectives, and enables the use of the algorithm for control synthesis. D. Kousoulidis is supported by the Engineering and Physical Sciences Research Council (EPSRC) of the United Kingdom. D. Kousoulidis and F. Forni are with the

No abstract

We design and test a cone finding algorithm to robustly address nonlinear system analysis through differential positivity. The approach provides a numerical tool to study multi-stable systems, beyond Lyapunov analysis. The theory is illustrated on two examples: a consensus problem with some repulsive interactions and second order agent dynamics, and a controlled duffing oscillator.

Differential positivity and K-cooperativity, a special case of differential positivity, extend differential approaches to control to nonlinear systems with multiple stable equilibria, such as switches or multi-agent consensus. To apply this theory, we reframe conditions for strict K-cooperativity as an optimization problem. Geometrically, the conditions correspond to finding a cone that a set of linear operators leave invariant. Using this geometric intuition, we construct an iterative cone-finding algorithm centered around Linear Programming (LP) that modifies existing rays instead of adding new ones. This enables us to also tackle the synthesis problem for K-cooperative systems. We demonstrate the effectiveness of this approach on some examples.

No abstract