A region-dividing approach to robust semidefinite programming and its error bound

Proceedings of the American Control Conference

Volumn 2006, Issue , 2006, Pages 123-129

  Oishi, Yasuaki ^a  

^a UNIVERSITY OF TOKYO   (Japan)

Author keywords

Approximation; Computational complexity; Conservatism; Linear matrix inequalities; Polynomial optimization; Robust semidefinite programming

Indexed keywords

COMPUTATIONAL COMPLEXITY; ERROR ANALYSIS; MATHEMATICAL PROGRAMMING; OPTIMIZATION; PARAMETER ESTIMATION; POLYNOMIAL APPROXIMATION; UNCERTAIN SYSTEMS;

CONSERVATISM; POLYNOMIAL OPTIMIZATION; ROBUST SEMIDEFINITE PROGRAMMING;

ROBUSTNESS (CONTROL SYSTEMS);

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

References (38)

1. P. Apkarian, H. D. Tuan, and J. Bernussou, IEEE Trans. Automat. Contr., vol. 46, pp. 1941-1946, 2001.
2. V. Balakrishnan, S. Boyd, and S. Balemi, Int. J. Robust Nonlinear Contr., vol. 1, pp. 295-317, 1991.
3. A. Ben-Tal and A. Nemirovski, Math. Operations Res., vol. 23, pp. 769-805, 1998.
4. A. Ben-Tal and A. Nemirovski, SIAM J. Optim., vol. 12, pp. 811-833, 2002.
5. A. Ben-Tal and A. Nemirovski, Math. Programming, vol. 92, pp. 453-480, 2002.
6. P.-A. Bliman, SIAM J. Contr. Optim., vol. 42, pp. 2016-2042, 2004.
7. P.-A. Bliman, "On robust semidefinite programming," in Proc. MTNS2004, Leuven, Belgium, 2004.
8. S. Boyd, L. El Ghaoui, E. Feron, and V. Balakrishnan, Linear Matrix Inequalities in System and Control Theory. Philadelphia, USA: SIAM, 1994.
9. G. Calafiore and M. C. Campi, in Proc. 43rd CDC, Paradise Island, The Bahamas, 2004, pp. 5328-5333.
10. G. Calafiore and M. C. Campi, Math. Programming, vol. 102, pp. 25-46, 2005.
11. Y.-Y. Cao and Z. Lin, IEEE Trans. Automat. Contr., vol. 49, pp. 2081-2084, 2004.
12. G. Chen and H. Shibata, Systems, Control and Information, vol. 47, pp. 211-216, 2003 (in Japanese).
13. R. R. E. de Gaston and M. G. Safonov, IEEE Trans. Automat. Contr., vol. 33, pp. 156-171, 1988.
14. M. C. de Oliveira, J. Bernussou, and J. C. Geromel, Syst. Contr. Lett., vol. 37, pp. 261-265, 1999.
15. M. Dettori and C. W. Scherer, in Proc. 39th CDC, Sydney, Australia, 2000, pp. 4187-4192.
16. Y. Ebihara and T. Hagiwara, Automatica, vol. 40, pp. 2003-2009, 2004.
17. L. El Ghaoui and S.-I. Niculescu, in Advances in Linear Matrix Inequality Methods in Control, L. El Ghaoui and S.-I. Niculescu, Eds. Philadelphia, USA: SIAM, 2000, pp. 3-37.
18. L. El Ghaoui, F. Oustry, and H. Lebret, SIAM J. Optim., vol. 9, pp. 33-52, 1998.
19. K. Emoto and Y. Oishi, Trans. SICE, vol. 41, pp. 314-321, 2005 (in Japanese).
20. K. Fujisawa, Y. Futakata, M. Kojima, S. Matsuyama, S. Nakamura, K. Nakata, and M. Yamashita, Technical Report B-359, revised version, Department of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan, 2005, available from http://grid.r.dendai.ac.jp/sdpa/
21. K.-C. Goh, M. G. Safonov, and G. P. Papavassilopoulos, J. Global Optim., vol. 7, pp. 365-380, 1995.
22. J. B. Lasserre, SIAM J. Optim., vol. 11, pp. 796-817, 2001.
23. J. Löfberg, in Proc. CACSD, Taipei, Taiwan, 2004, available from http://control.ee.ethz.ch/~joloef/yalmip.php
24. I. Masubuchi, T. Akiyama, and M. Saeki, in Proc. 42nd CDC, Maui, USA, 2003, pp. 6115-6120.
25. I. Masubuchi, A. Kume, and E. Shimemura, in Proc. 37th CDC, Tampa, USA, 1998, pp. 1753-1758.
26. I. Masubuchi and E. Shimemura, Trans. ISCIE, vol. 12, pp. 390-394, 1999 (in Japanese).
27. A. Nemirovskii, Math. Contr. Signals Syst., vol. 6, pp. 99-105, 1993.
28. A. Ohara and Y. Sasaki, in Proc. 40th CDC, Orlando, USA, 2001, pp 3593-3594.
29. Y. Oishi, Technical Report METR2006-10, Department of Mathematical Informatics, The University of Tokyo, Tokyo, Japan, 2006, available from http://www.keisu.t.u-tokyo.ac.jp/Research/techrep.0.html
30. P. A. Parrilo, Math. Programming, vol. 96, pp. 293-320, 2003.
31. P. A. Parrilo, in Positive Polynomials in Control, D. Henrion and A. Garulli, Eds. Berlin, Germany: Springer, 2005, pp. 181-194.
32. C. W. Scherer, in Proc. 37th CDC, Tampa, USA, 1998, pp. 2216-2221.
33. C. W. Scherer, SIAM J. Matrix Anal. Applicat., vol. 27, pp. 365-395, 2005.
34. C. W. Scherer and C. W. J. Hol, "Matrix sum-of-squares relaxations for robust semi-definite programs," Math. Programming, to appear.
35. U. Shaked, IEEE Trans. Automat. Contr., vol. 46, pp. 652-656, 2001.
36. T. Shimomura, M. Takahashi, and T. Fujii, in Proc. 40th CDC, Orlando, USA, 2001, pp. 2157-2162.
37. R. Tempo, G. Calafiore, and F. Dabbene, Randomized Algorithms for Analysis and Control of Uncertain Systems. London, UK: Springer, 2005.
38. H. Waki, S. Kim, M. Kojima, and M. Muramatsu, "Sums of squares and semidefinite programming relaxations for polynomial optimization problems with structured sparsity," SIAM J. Optim., to appear.