0410765 20240103182237.620060210235959.9 12 s. cav_un_epca*02567860020-7179748 (2001)845-856Taylor & Francis polynomial methods robust control linear matrix inequalities cav_un_auth*0101104 Henrion Didier UTIA-B Ústav teorie informace a automatizace AV ČR, v. v. i. cav_un_auth*0212659 Bachelier O. FR cav_un_auth*0021057 Šebek M. CZ 09I KSK1019101 GA AV ČR cav_un_auth*0000219 AV0Z1075907 Necessary and sufficient conditions are formulated for the zeros of an arbitrary polynomial matrix to belong to a given region D of the complex plane. The conditons stem from a general optimization methodology mixing quadratic and semidefinite programming, LFRs and rank-one LMIs. They are expressed as an LMI feasibility problem that can be tackled with widespread powerful interior-point methods. BC TŘ http://hdl.handle.net/11104/0130853 UTIA-B 20010234 2001 cav_un_epca*0256786 International Journal of Control 0020-7179 1366-5820 Roč. 74 č. 8 2001 845 856 Taylor & Francis