Probabilistic design of a robust state-feedback controller based on parameter-dependent Lyapunov functions

Proceedings of the IEEE Conference on Decision and Control

Volumn 2, Issue , 2003, Pages 1920-1925

  Oishi, Yasuaki ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Computational complexity; Parameter dependent Lyapunov functions; Parameterdependent linear matrix inequalities; Randomized algorithms; Reduction of conservatism

Indexed keywords

ALGORITHMS; FUNCTIONS; ITERATIVE METHODS; LYAPUNOV METHODS; MATRIX ALGEBRA; NONLINEAR SYSTEMS; PROBLEM SOLVING; ROBUSTNESS (CONTROL SYSTEMS);

PARAMETER-DEPENDENT LYAPUNOV FUNCTIONS; RANDOMIZED ALGORITHMS; REDUCTION OF CONSERVATION;

FEEDBACK CONTROL;

EID: 1542320265     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (20)

1. P. Apkarian, P. C. Pellanda, and H. D. Tuan, Syst. Contr. Lett., vol. 41, pp. 333-346, 2000.
2. P. Apkarian, H. D. Tuan, and J. Bernussou, IEEE Trans. Automat. Contr., vol. 46, pp. 1941-1946, 2001.
3. R. G. Bland, D. Goldfarb, and M. J. Todd, Operations Research, vol. 29, pp. 1039-1091, 1981.
4. G. Calafiore and B. Polyak, IEEE Trans. Automat. Contr., vol. 46, pp. 1755-1759, 2001.
5. M. C. de Oliveira, J. Bernussou, and J. C. Geromel, Syst. Contr. Lett., vol. 37, pp. 261-265, 1999.
6. M. C. de Oliveira, J. C. Geromel, and J. Bernussou, Int. J. Contr., vol. 75, pp. 666-679, 2002.
7. Y. Ebihara and T. Hagiwara, in Proc. 2002 Amer. Contr. Conf., Anchorage, USA, 2002, pp. 47-52.
8. S. Kanev, B. De Schutter, and M. Verhaegen, Syst. Contr. Lett., vol. 49, pp. 365-375, 2003.
9. P. Khargonekar and A. Tikku, in Proc. 35th IEEE Conf. Decision Contr., Kobe, Japan, 1996, pp. 3470-3475.
10. D. Liberzon and R. Tempo, to be presented at 42nd IEEE Conf. Decision Contr., Maui, USA, 2003.
11. Y. Oishi and H. Kimura, Technical Report METR 2001-04, Department of Mathematical Informatics, The University of Tokyo, Japan, 2001.
12. Y. Oishi and H. Kimura, Automatica, vol. 39, 2003, to appear.
13. B. T. Polyak, in Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, D. Butnariu, Y. Censor, and S. Reich, Eds. Amsterdam, The Netherlands: Elsevier, 2001, pp. 409-422.
14. B. T. Polyak and R. Tempo, Syst. Contr. Lett., vol. 43, pp. 343-353, 2001.
15. U. Shaked, IEEE Trans. Automat. Contr., vol. 46, pp. 652-656, 2001.
16. A. Shapiro, in Handbook of Semidefinite Programming, H. Wolkowicz, R. Saigal, and L. Vandenberghe, Eds. Boston, USA: Kluwer, 2000, pp. 68-92.
17. T. Shimomura, M. Takahashi, and T. Fujii, in Proc. 40th IEEE Conf. Decision Contr., Orlando, USA, 2001, pp. 2157-2162.
18. K. Takagi and H. Nishimura, JSME International Journal, Ser. C, vol. 42, pp. 914-921, 1999.
19. R. Tempo, E. W. Bai, and F. Dabbene, Syst. Contr. Lett., vol. 30, pp. 237-242, 1997.
20. M. Vidyasagar, Learning and Generalization: With Applications to Neural Networks, 2nd ed. London, UK: Springer, 2003.