On the sample complexity of randomized approaches to the analysis and design under uncertainty

Proceedings of the 2010 American Control Conference, ACC 2010

Volumn , Issue , 2010, Pages 4671-4676

  Alamo, T ^a   Tempo, R ^b   Luque, A ^a  

^a UNIVERSIDAD DE SEVILLA   (Spain)

^b POLITECNICO DI TORINO   (Italy)

Author keywords

Probabilistic robustness; Randomized algorithms; Sample complexity; Uncertain systems

Indexed keywords

CONVEX OPTIMIZATION; UNCERTAIN SYSTEMS; UNCERTAINTY ANALYSIS;

BINOMIAL DISTRIBUTION; CONVEX OPTIMIZATION PROBLEMS; DESIGN OF ROBUST CONTROLLERS; DESIGN UNDER UNCERTAINTY; PROBABILISTIC ROBUSTNESS; PROBABILISTIC SPECIFICATIONS; RANDOMIZED ALGORITHMS; SAMPLE COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 77957780977     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/acc.2010.5531078     Document Type: Conference Paper

References (15)

1. T. Alamo, R. Tempo, and E.F. Camacho. Randomized strategies for probabilistic solutions of uncertain feasibility and optimization problems. IEEE Transactions on Automatic Control, 54(11): 2545- 2559, 2009.
2. T. Alamo, R. Tempo, and A. Luque. On the sample complexity of probabilistic analysis and design methods. Perspectives in Mathematical System Theory, Control, and Signal Processing. Lecture Notes in Control and Information Sciences, Preliminary entry 399. Springer, accepted for publication, 2010.
3. E. Bai, H. Cho, R. Tempo and Y. Ye. Optimization with few violated constraints for linear bounded error parameter estimation. IEEE Transactions on Automatic Control, 47(7):1067-1077, 2002.
4. G. Calafiore and M.C. Campi. The scenario approach to robust control design. IEEE Transactions on Automatic Control, 51(5):742-753, 2006.
5. M.C. Campi and S. Garatti. The exact feasibility of randomized solutions of robust convex programs. SIAM Journal on Optimization, 19:1211-1230, 2008.
6. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Mathematical Statistics, 23:493-507, 1952.
7. Y. Fujisaki and Y. Kozawa. Probabilistic robust controller design: probable near minimax value and randomized algorithms. In G. Calafiore and F. Dabbene, editors, Probabilistic and Randomized Methods for Design under Uncertainty. Springer, London, 2006.
8. 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.
9. J. Luedtke, and S. Ahmed. A sample approximation approach for optimization with probabilistic constraints. SIAM Journal of Optimization, 19(2):674-699, 2008.
10. M. Okamoto. Some inequalities relating to the partial sum of binomial probabilities. Annals of the Institute of Statistical Mathematics, 10(1):29-35, 1959.
11. R. Tempo, E.W. Bai, and F. Dabbene. Probabilistic robustness analysis: explicit bounds for the minimum number of samples. Systems & Control Letters, 30:237-242, 1997.
12. 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.
13. V.N. Vapnik. Statistical Learning Theory. John Wiley & Sons, New York, 1998.
14. M. Vidyasagar. A Theory of Learning and Generalization: with Applications to Neural Networks and Control Systems. Springer, London, 1997.
15. M. Vidyasagar. Randomized algorithms for robust controller synthesis using statistical learning theory. Automatica, 37:1515-1528, 2001. (Pubitemid 32737008)