Desigualtats matricials lineals amb valors complexos

Sovint ens trobem davant de desigualtats matricials lineals (LMIs) on les matrius involucrades prenen valors complexos. Es ben conegut que tota LMI complexa es pot reduir a una LMI real. En aquest treball establim les propietats que permeten fer el proces de reduccio de LMI complexa a LMI real de manera el mes simplicada possible.

[1]  Shinji Hara,et al.  Generalized KYP lemma: unified frequency domain inequalities with design applications , 2005, IEEE Transactions on Automatic Control.

[2]  E. Yaz.  Linear Matrix Inequalities In System And Control Theory , 1998, Proceedings of the IEEE.

[3]  R. Chiang,et al.  Robust control toolbox , 1996 .

[4]  Edoardo Mosca,et al.  Efficient Computation of Frame Bounds Using LMI-Based Optimization , 2008, IEEE Transactions on Signal Processing.

[5]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[6]  Jean-Philippe Chancelier,et al.  Modeling and Simulation in Scilab/Scicos , 2006 .

[7]  Yurii Nesterov,et al.  Interior-point polynomial algorithms in convex programming , 1994, Siam studies in applied mathematics.

[8]  Arkadi Nemirovski,et al.  The projective method for solving linear matrix inequalities , 1997, Math. Program..

[9]  Dimitri Peaucelle,et al.  S-Variable Approach to LMI-Based Robust Control , 2014 .