Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities

Yasuaki Oishi، نويسنده , , Hidenori Kimura، نويسنده ,

روزنامه با شماره پیاپی سال 2003

8

2149

2156

Randomized algorithms , Parameter-dependent linear matrix inequalities , Curse of dimensionality , Linear parameter-varying systems , computational complexity , Conservatism

Automatica

2003

Automatica

369860