Lyapunov stability analysis of linear time-invariant systems: Convex optimization approach

Author

Wang, Jianhong ; Zhang, Zhenjuan ; Gao, Yanbo ; Lu, Guoping

Author_Institution

Sch. of Sci., Nantong Univ., Nantong

fYear

2008

fDate

25-27 June 2008

Firstpage

4129

Lastpage

4131

Abstract

Theorem of alternatives based on the separation theorems are proposed to provide systematic and unified proofs of necessary and sufficient conditions for solvability of Lyapunov inequality on P. As an application of the theorem of alternatives, we investigate the conditions for the existence of feasible solutions to Lyapunov inequality on P and obtain a restatement of the celebrated Lyapunov stability theorem for linear time-invariant systems.

Keywords

Lyapunov methods; computability; convex programming; linear systems; stability; Lyapunov stability analysis; convex optimization approach; linear time-invariant system; separation theorem; solvability; Automation; Control theory; Eigenvalues and eigenfunctions; Intelligent control; Linear matrix inequalities; Lyapunov method; Optimal control; Stochastic processes; Sufficient conditions; Vectors; Convex optimization; Linear matrix inequality; Linear time-invariant systems; Lyapunov stability; Theorem of alternatives;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Control and Automation, 2008. WCICA 2008. 7th World Congress on

Conference_Location

Chongqing

Print_ISBN

978-1-4244-2113-8

Electronic_ISBN

978-1-4244-2114-5

Type

conf

DOI

10.1109/WCICA.2008.4593586

Filename

4593586