TY - GEN

T1 - Switched stability of nonlinear systems via SOS-convex Lyapunov functions and semidefinite programming

AU - Ahmadi, Amir Ali

AU - Jungers, Raphaël M.

PY - 2013

Y1 - 2013

N2 - We introduce the concept of sos-convex Lyapunov functions for stability analysis of discrete time switched systems. These are polynomial Lyapunov functions that have an algebraic certificate of convexity, and can be efficiently found by semidefinite programming. We show that convex polynomial Lyapunov functions are universal (i.e., necessary and sufficient) for stability analysis of switched linear systems. On the other hand, we show via an explicit example that the minimum degree of an sos-convex Lyapunov function can be arbitrarily higher than a (non-convex) polynomial Lyapunov function. (The proof is omitted.) In the second part, we show that if the switched system is defined as the convex hull of a finite number of nonlinear functions, then existence of a non-convex common Lyapunov function is not a sufficient condition for switched stability, but existence of a convex common Lyapunov function is. This shows the usefulness of the computational machinery of sos-convex Lyapunov functions which can be applied either directly to the switched nonlinear system, or to its linearization, to provide proof of local switched stability for the nonlinear system. An example is given where no polynomial of degree less than 14 can provide an estimate to the region of attraction under arbitrary switching.

AB - We introduce the concept of sos-convex Lyapunov functions for stability analysis of discrete time switched systems. These are polynomial Lyapunov functions that have an algebraic certificate of convexity, and can be efficiently found by semidefinite programming. We show that convex polynomial Lyapunov functions are universal (i.e., necessary and sufficient) for stability analysis of switched linear systems. On the other hand, we show via an explicit example that the minimum degree of an sos-convex Lyapunov function can be arbitrarily higher than a (non-convex) polynomial Lyapunov function. (The proof is omitted.) In the second part, we show that if the switched system is defined as the convex hull of a finite number of nonlinear functions, then existence of a non-convex common Lyapunov function is not a sufficient condition for switched stability, but existence of a convex common Lyapunov function is. This shows the usefulness of the computational machinery of sos-convex Lyapunov functions which can be applied either directly to the switched nonlinear system, or to its linearization, to provide proof of local switched stability for the nonlinear system. An example is given where no polynomial of degree less than 14 can provide an estimate to the region of attraction under arbitrary switching.

UR - http://www.scopus.com/inward/record.url?scp=84902308827&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84902308827&partnerID=8YFLogxK

U2 - 10.1109/CDC.2013.6759968

DO - 10.1109/CDC.2013.6759968

M3 - Conference contribution

AN - SCOPUS:84902308827

SN - 9781467357173

T3 - Proceedings of the IEEE Conference on Decision and Control

SP - 727

EP - 732

BT - 2013 IEEE 52nd Annual Conference on Decision and Control, CDC 2013

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 52nd IEEE Conference on Decision and Control, CDC 2013

Y2 - 10 December 2013 through 13 December 2013

ER -