The Application of Linear Algebra Algorithm in the Production of Linear Matrix Inequalities

Article Preview

Abstract:

Discusses the theory and symbolic of the algorithm gives another potential application, but also in the system and control. For example, for the question, has made with special structure, but LMI problem data, may cause factorizations LMI more compact. One can even imagine using the algorithm around, looking for the opportunity to LMI automatic eliminate variables, so simplify problem solving, before they get a lot of influence and a potential solutions. We describe theory, the algorithm can be used to factor in the non commuting variable polynomial matrix and application system switches and control problem into a linear matrix inequality.

You might also be interested in these eBooks

Info:

Periodical:

Pages:

406-411

Citation:

Online since:

July 2012

Authors:

Export:

Price:

Permissions CCC:

Permissions PLS:

Сopyright:

© 2012 Trans Tech Publications Ltd. All Rights Reserved

Share:

Citation:

[1] S. P. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory. Philadelphia, PA: SIAM, (2010).

DOI: 10.1137/1.9781611970777

Google Scholar

[2] R. E. Skelton, T. Iwasaki, and K. Grigoriadis, A Unified Algebraic Approach to Control Design. London, UK: Taylor & Francis, (2008).

Google Scholar

[3] Y. E. Nesterov and A. Nemirovskii, Interior Point Polynomial Methods in Convex Programming. Philadelphia, PA: SIAM, (2005).

Google Scholar

[4] J. W. Helton and J. W. Nie, Semidefinite representation of convex sets, Mathematical Programming, vol. 122, p.21–64, Mar. (2010).

Google Scholar