Revisiting statistical learning theory for uncertain feasibility and optimization problems

Proceedings of the IEEE Conference on Decision and Control

Volumn , Issue , 2007, Pages 2135-2140

  Alamo, T ^a   Tempo, R ^b   Camacho, E F ^a  

^a UNIVERSIDAD DE SEVILLA   (Spain)

^b POLITECNICO DI TORINO   (Italy)

Author keywords

Probabilistic robustness; Randomized algorithms; Robust convex optimization; Statistical leaning theory; Uncertain systems

Indexed keywords

LEARNING SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; RANDOM PROCESSES; UNCERTAIN SYSTEMS;

PROBABILISTIC ROBUSTNESS; RANDOMIZED ALGORITHMS; ROBUST CONVEX OPTIMIZATION; STATISTICAL LEANING THEORY;

STATISTICAL METHODS;

EID: 36749052442     PISSN: 07431546     EISSN: 25762370     Source Type: Conference Proceeding    
DOI: 10.1109/CDC.2007.4434625     Document Type: Conference Paper

References (21)

1. T. Alamo, R. Tempo, and E.F. Camacho. Improved sample size bounds for probabilistic robust control: a pack-based strategy. In Proceedings of the 46th IEEE Conference on Decision and Control, New Orleans, USA, December 2007.
2. T. Alamo, R. Tempo, D. Rodríguez, and E.F. Camacho. A sequentially optimal randomized algorithm for robust LMI feasibility problems. In Proceedings of the European Control Conference, 2007, Kos, Greece, July 2007.
3. V. Blondel and J.N. Tsitsiklis. A survey of computational complexity results in system and control. Automatica, 36:1249-1274, 2000.
4. G. Calafiore and M.C. Campi. Uncertain convex programs: randomized solutions and confidence levels. Math. Program, 102:25-46, 2005.
5. G. Calafiore and M.C. Campi. The scenario approach to robust control design. IEEE Transactions on Automatic Control, 51(5):742-753, 2006.
6. G. Calafiore and F. Dabbene. An iterative localization method for probabilistic feasibility of uncertain LMIs. In Proceedings of the 45th IEEE Conference on Decision and Control, San Diego, USA, December 2006.
7. G. Calafiore and B.T. Polyak. Stochastic algorithms for exact and approximate feasibility of robust LMIs. IEEE Transactions on Automatic Control, 46(11):1755-1759, 2001.
8. Y Fujisaki, F. Dabbene, and R. Tempo. Probabilistic design of LPV control systems. Automatica, 39:1323-1337, 2003.
9. L. El Ghaoui, F. Oustry, and M. AitRami. A cone complementary linearization algorithm for static output-feedback and related problems. IEEE Transactions on Automatic Control, 42:1171-1176, 1997.
10. S. Kanev, B. De Schutter, and M. Verhaegen. An ellipsoid algorithm for probabilistic robust controller design. Systems and Control Letters, 49:365-375, 2003.
11. V. Koltchinskii, C.T. Abdallah, M. Ariola, P. Dorato, and D. Panchenko. Improved sample complexity estimates for statistical learning control of uncertain systems. IEEE Transactions on Automatic Control, 45(12):2383-2388, 2000.
12. J.M. Parrando and C. van den Broeck. Vapnik-Chervonenkis bounds for generalization. Journal of Physica A, 26:2211-2223, 1993.
13. B.T. Polyak and R. Tempo. Probabilistic robust design with linear quadratic regulators. Systems & Control Letters, 43:343-353, 2001.
14. N. Sauer. On the density of family of sets. Journal of Combinatorial Theory, 13(A):145-147, 1972.
15. R. Tempo, G. Calafiore, and F. Dabbene. Randomized Algorithms for Analysis and Control of Uncertain Systems. Communications and Control Engineering Series. Springer-Verlag, London, 2005.
16. V.N. Vapnik. Statistical Learning Theory. John Wiley & Sons, New York, 1998.
17. V.N. Vapnik and A. Ya. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16:264-280, 1971.
18. V.N. Vapnik and A. Ya. Chervonenkis. Necessary and sufficient conditions for the uniform convergence of means to their expectations. Theory of Probability and its Applications, 26(3):532-553, 1981.
19. M. Vidyasagar. A Theory of Learning and Generalization: with Applications to Neural Networks and Control Systems. Springer, London, 1997.
20. M. Vidyasagar. Statistical learning theory and randomized algorithms for control. Control Systems Magazine, 18(6):69-85, 1998.
21. M. Vidyasagar and Vincent D. Blondel. Probabilistic solutions to some NP-hard matrix problems. Automatica, 37(9): 1397-1405, 2001.