Implementation of a randomized algorithm for solving parameter-dependent linear matrix inequalities

Proceedings of the IEEE International Conference on Control Applications

Volumn 2, Issue , 2004, Pages 1183-1188

  Oishi, Yasuaki ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Computational complexity; Optimization; Parameter dependent linear matrix inequality; Probabilistic solution; Randomized algorithm; Stopping rule

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; EIGENVALUES AND EIGENFUNCTIONS; LINEAR SYSTEMS; OPTIMIZATION; PARAMETER ESTIMATION; PROBABILISTIC LOGICS; ROBUSTNESS (CONTROL SYSTEMS);

PARAMETER-DEPENDENT LINEAR MATRIX INEQUALITY; PROBABILISTIC SOLUTION; RANDOMIZED ALGORITHM; STOPPING RULE;

ALGORITHMS;

EID: 17744374360     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (25)

1. P. Apkarian, P. Gabinet, and G. Becker, Automatica, vol. 31, pp. 1251-1261, 1995.
2. G. Becker and A. Packard, Syst. Contr. Lett, vol. 23, pp. 205-215, 1994.
3. R. G. Bland, D. Goldfarb, and M. J. Todd, Operations Research, vol. 29, pp. 1039-1091, 1981.
4. G. Calafiore and M. C. Campi, Math. Prog., to appear.
5. G. Calafiore, F. Dabbene, and R. Tempo, in Proc. 42nd IEEE Conf. Decision Contr., Maui, USA, 2003, pp. 1908-1913.
6. G. Calafiore and B. Polyak, IEEE Trans. Automat. Contr., vol. 46, pp. 1755-1759, 2001.
7. Y. Fujisaki, F. Dabbene, and R. Tempo, Automatica, vol. 39, pp. 1323-1337, 2003.
8. P. Gahinet, P. Apkarian, and M. Chilali, IEEE Trans. Automat. Contr., vol. 41, pp. 436-442, 1996.
9. J.-B. Hiriart-Urruty and C. Lemaréchal, Fundamentals of Convex Analysis. Berlin, Germany: Springer, 2001.
10. S. Kanev, B. De Schutter, and M. Verhaegen, Syst. Contr. Lett., vol. 49, pp. 365-375, 2003.
11. P. Khargonekar and A. Tikku, in Proc. 35th IEEE Conf. Decision Contr., Kobe, Japan, 1996, pp. 3470-3475.
12. D. Liberzon and R. Tempo, in Proc. 42nd IEEE Conf. Decision Contr., Maui, USA, 2003, pp. 4782-4787.
13. A. Ohara and Y. Sasaki, in Proc. 1st SICE Annual Conf. Contr. Syst., Kyoto, Japan, 2001, pp. 61-64.
14. Y. Oishi, in Proc. 3rd SICE Annual Conf. Contr. Syst., Kobe, Japan, 2003, pp. 473-476.
15. Y. Oishi, in Proc. 32nd SICE Symp. Contr. Theory, Hamamatsu, Japan, 2003, pp. 13-18.
16. Y. Oishi, in Proc. 42nd IEEE Conf. Decision Contr., Maui, USA, 2003, pp. 1920-1925.
17. Y. Oishi, Technical Note METR 2004-23, Department of Mathematical Informatics, The University of Tokyo, Japan, May 2004, http://www.keisu.t. utokyo.ac.jp/Research/techrep.0.html
18. Y. Oishi and H. Kimura, Automatica, vol. 39, pp. 2149-2156, 2003.
19. 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.
20. B. T. Polyak and R. Tempo, Syst. Contr. Lett., vol. 43, pp. 343-353, 2001.
21. C. W. Scherer, in Proc. 42nd IEEE Conf. Decision Contr., Maui, USA, 2003, pp. 4652-4657.
22. A. N. Shiryaev, Probability, second ed. New York, USA: Springer, 1996.
23. K. Takagi and H. Nishimura, JSME Int. J., ser. C, vol. 42, pp. 914-921, 1999.
24. R. Tempo, E. W. Bai, and F. Dabbene, Syst. Contr. Lett., vol. 30, pp. 237-242, 1997.
25. R. Watanabe, K. Uchida, M. Fujita, and E. Shimemura, in Proc. 33rd IEEE Conf. Decision Contr., Lake Buena Vista, USA, 1994, pp. 1412-1414.