Convex Lyapunov Functions for Switched Discrete-Time Systems by Linear Programming

We present a novel method to compute convex Lyapunov functions for discrete-time, switched systems. The individual subsystems are assumed to be linear. The method uses linear programming to construct continuous piecewise affine and convex Lyapunov functions for the switched system. We demonstrate the applicability of our method with two examples from the literature.