An iterative localization method for probabilistic feasibility of uncertain LMIs

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2006, Pages 4157-4162

  Calafiore, G ^a   Dabbene, F ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; ITERATIVE METHODS; PROBABILITY; PROBLEM SOLVING; ROBUST CONTROL; UNCERTAIN SYSTEMS;

CONVEX FEASIBILITY PROGRAMS; INEQUALITIES; ROBUST FEASIBILITY;

LINEAR MATRIX INEQUALITIES;

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

References (29)

1. D.S. Atkinson and P.M. Vaidya. A cutting plane algorithm for convex programming that uses analytic centers. Mathematical Programming, Series B. 69:1-43, 1995.
2. A. Ben-Tal and A. Nemirovski. Robust convex optimization. Mathematics of Operations Research, 23:769-805, 1998.
3. 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.
4. P.-A. Bliman. A convex approach to robust stability for linear systems with uncertain scalar parameters. SIAM Journal on Control and Optimization, 42(6):2016-2042, 2004.
5. S. Boyd and L. El Ghaoui, Method of centers for minimizing generalized eigenvalues. Linear Algebra and its Applications, Special Issue on Systems and Control, 188:63-111, 1993.
6. S. Boyd and L. Vandenberghe, Convex Optimization, Cambridge. 2004.
7. G. Calafiore. Cutting plane methods for probabilistically-robust feasibility problems. In Proceedings of Mathematical Theory of Networks and Systems. 2006.
8. G. Calafiore and M.C. Campi. Uncertain convex programs: randomized solutions and confidence levels. Mathematical Programming, 102(0:25-46, 2005.
9. G. Calafiore and M.C. Campi, The scenario approach to robust control design. IEEE Transactions on Automatic Control, 51(5):742-753. 2006.
10. G. Calafiore and F. Dabbene. A probabilistic analytic center cutting plane method for feasibility of uncertain lmis. Technical Report IEIIT-002, IEIIT-CNR. 2006.
11. G. Calafiore and F. Dabbene (Eds.). Probabilistic and Randomized Methods for Design under Uncertainty. Springer-Verlag, London. 2006.
12. G. Calafiore and B.T. Polyak. Stochastic algorithms for exact and approximate feasibility of robust LMIs. IEEE Transactions on Automatic Control, 46:1755-1759, 2001.
13. L. El Ghaoui. F. Oustry. and H. Lebret, Robust solutions to uncertain semidefinite programs. SIAM Journal on Optimization, 9:33-52, 1998.
14. L. El Ghaoui and H. Lebret. Robust solutions to uncertain semidefinite programs. SIAM J. Optim., 9(1):33-52, 1998.
15. J.-L. Goffin. Z.Q. Luo. and Y. Ye. Complexity analysis of an interior point cutting plane method for convex feasibility problems. SIAM Journal on Optimization, 6:638-652, 1996.
16. J.-L. Goffin and J.-P Vial. Convex non-differentiable optimization: a survey focused on the analytic center cutting plane method. Optimization Methods & Software,17:805-867, 2002.
17. S. Kanev. B. De Schutter, and M. Verhaegen. An ellipsoid algorithm for probabilistic robust controller design. Systems & Control Letters. 49:365-375, 2003.
18. S. Kanev and M. Verhaegen. The randomized ellipsoid algorithm for constrained robust least squares problems. In Probabilistic and Randomized Methods for Design under Uncertainty, pages 223-242. Springer-Verlag. London, 2006.
19. L.G. Khachiyan. A polynomial time algorithm for linear programming. Soviet Math. Doklady. 20:191194, 1979.
20. L. Lovász. M. Grötschel. and A. Schrijver. Geometric Algorithms and Combinatorial Optimization. Springer-Verlag, New York, 1993.
21. J.E. Mitchell, Polynomial interior point cutting plane methods. Optimization Methods & Software. 18:507-534, 2003.
22. A.S. Nemirovski and D.B. Yudin. Problem Complexity and Method Efficiency in Optimization. Wiley. New York. 1983.
23. Y. Oishi. Probabilistic design of a robust state-feedback controller based on parameter-dependent Lyapunov functions. In Proceedings of the IEEE Conference on Decision and Control. 2003.
24. Y. Oishi and H. Kimura. Computational complexity of randomized algorithms for solving parameter-dependent linear matrix inequalities. Automatica. 39:2149-2156, 2003.
25. O. Péton. The Homogeneous Analytic Center Cutting Plane Method. Ph.D. Thesis. Université de Genève. 2002.
26. B.T. Polyak and R. Tempo. Probabilistic robust design with linear quadratic regulators. Systems & Control Letters. 43:343-353, 2001.
27. C.W. Scherer. Relaxations for robust linear matrix inequality problems with verifications for exactness. SIAM Journal on Matrix Analysis and Applications. 27(2):365-395, 2005.
28. N.Z. Shor, Utilization of the operation of space dilatation in the minimization of convex functions. Cybernetics. 13:94-96, 1970.
29. R. Tempo. G. Calafiore. and F. Dabbene. Randomized Algorithms for Analysis and Control of Uncertain Systems. Communications and Control Engineering Series. Springer-Verlag. London, 2004.