Degree bounds for polynomial verification of the matrix cube problem

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2006, Pages 4405-4410

  Chen, Been Der ^a   Lall, Sanjay ^a  

^a 496 Lomita Mall   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

LINEAR MATRIX INEQUALITIES; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

POSITIVSTELLENSATZ REFUTATIONS; SEMI-ALGEBRAIC SET;

VERIFICATION;

EID: 39549097057     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/cdc.2006.376783     Document Type: Conference Paper

References (23)

1. K. Anstreicher and H. Wolkowicz. On Lagrangian relaxation of quadratic matrix constraints. Siam J. matrix anal., 22:41-55, 2000.
2. H. P. Horisberger; P. R. Belanger. Regulators for linear, time invariant plants with uncertain parameters. IEEE Transactions on Automatic Control, 21(5):705-708, 1976.
3. A. Ben-Tal and A. Nemirovski. Robust convex optimization. Mathematics of operational reserch, 23:769-805, 1998.
4. A. Ben-Tal and A. Nemirovski. On tractable approximations of uncertain linear matrix inequalities affected by interval uncertainty. SIAM Journal On Optimization, 12(3):811-833, 2002.
5. S. Boyd and Q. Yang. Structured and simultaneous Lyapunov functions for system stability problems. International Journal of Control, 49:2215-2240, 1989.
6. S. Boyd and Q. Young. Structured and simultaneous Lyapunov functions for system stability problems. Int. J. Control, 49:2215-2240, 1989.
7. S. Boyd; L. E. Ghaoui; E. Feron. Linear Matrix Inequalities in System and Control Theory. SIAM, 1994.
8. M. Goemans and D. Williamson. Improved approximation algorithm for maximum cut. and satisfiability problems using semidefinite programming. J. Assoc. Comput. Mach, 42:1115-1142, 1995.
9. M. X. Goemans. Semidefinite programming in combinatorial optimization. Math. Programming, 79:143-162, 1997.
10. ∞control theory. IEEE Transactions on Automatic Control, 35(3):356-361, 1990.
11. Jean B. Lasserre. Global optimization with polynomials and the problem of moments. SIAM J. optim., 11:796-817, 2001.
12. Jean B. Lasserre. Global optimization with polynomials and the problem of moments. Lecture Notes in Computer Science, 2081:293-303, 2001.
13. L. Lovász and A. Schrijver. Cones of matrices and set-functions and 0-1 optimization. SIAM J. Optim., 1:166-190, 1991.
14. A. Nemirovski. Several NP-hard problems arising in robust stability analysis. Math. Control Signals Systems, 6:99-105, 1993.
15. I. R. Petersen. Notions of stabilizability and controllability for a class of uncertain linear systems. Int. J Control, 46:409-422, 1987.
16. V. Popov. Nouveaux criterium de stabilite pour les systems automatiques nonlineares. Revue d'Electrotechnique et d'Energetique, 5(1):72-88, 1960.
17. M. Putinar. Positive polynomial on compact semialgebraic sets. Indiana Unversity Mathematics Journal, 42:969-984, 1993.
18. M.A. Rotea, M. Corless, D. Da, and I.R. Petersen. Systems with structured uncertainty: relations between quadratic and robust stability. IEEE Transactions on Automatic Control, 38(5):799-803, 1993.
19. M.G. Safonov. Optimal diagonal scaling for infinitynorm optimization. Syst. Control Letters, 7:257-260, 1986.
20. C. Scherer and C. Hol. Asymptotically exact relaxations for robust lmi problems based on matrix-valued sum-of-squares. In Proceedings of the 16th Mathematical Theory of Networks and Systems Conference, 2004.
21. N.Z. Shor. Quadratic optimization problems. Tekhnicheskaya Kibernetika, 222:128-139, 1987.
22. F. Wu and S. Prajna. A new solution approach to polynomial lpv system analysis and synthesis. In Proc. American Control Conference, volume 2, pages 1362-1367, 2004.
23. P.M. Young. Structured singular value approach for systems with parametric uncertainty. Int. J. Robust Nonlinear Control, 11:653-680, 2001.