Random convex programs part 1

Proceedings of the IEEE International Symposium on Computer-Aided Control System Design

Volumn , Issue , 2010, Pages 1539-1545

  Calafiore, Giuseppe Carlo ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

Chance constrained optimization; Randomized methods; Robust convex optimization; Scenario optimization

Indexed keywords

BASIC CONCEPTS; CHANCE-CONSTRAINED; CHANCE-CONSTRAINED OPTIMIZATIONS; CONSTRAINT VIOLATION; CONVEX OPTIMIZATION PROBLEMS; CONVEX PROGRAMS; FINITE NUMBER; OPTIMAL SOLUTIONS; PROBABILISTIC ASSESSMENTS; RANDOMIZED METHODS; ROBUST CONVEX OPTIMIZATION; SCENARIO OPTIMIZATION; UPPER BOUND;

COMPUTER CONTROL SYSTEMS; CONSTRAINED OPTIMIZATION; PROBABILITY DISTRIBUTIONS; RANDOM VARIABLES; REMOTE CONTROL; SYSTEMS ANALYSIS;

CONVEX OPTIMIZATION;

EID: 78649874950     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CACSD.2010.5612842     Document Type: Conference Paper

References (15)

1. T. Alamo, R. Tempo, and A. Luque. On the sample complexity of probabilistic analysis and design methods. In J.C. Willems and al., editors, Perspectives in Mathematical System Theory, Control, and Signal Processing, volume 398/2010 of Lecture Notes in Control and Information Sciences, pages 39-50. Springer-Verlag, Berlin, 2010.
2. G.C. Calafiore. On the expected probability of constraint violation in sampled convex programs. Journal of Optimization Theory and Applications, 143(2), 2009.
3. G.C. Calafiore. Random convex programs - part 2. In IEEE Multi- Conference on Systems and Control (MSC), Yokoama, Japan, 2010.
4. G.C. Calafiore and M.C. Campi. Uncertain convex programs: randomized solutions and confidence levels. Mathematical Programming, 102(1):25-46, 2005.
5. G.C. Calafiore and M.C. Campi. The scenario approach to robust control design. IEEE Transactions on Automatic Control, 51(5):742-753, 2006.
6. M.C. Campi and G.C. Calafiore. Notes on the scenario design approach. IEEE Transactions on Automatic Control, 54(2):382-385, 2009.
7. M.C. Campi, G.C. Calafiore, and S. Garatti. Interval predictor models: Identification and reliability. Automatica, 45(2):382-392, 2009.
8. M.C. Campi and S. Garatti. The exact feasibility of randomized solutions of robust convex programs. SIAM Journal on Optimization, 19(3):1211-1230, 2008.
9. H. Edelsbrunner and E.P. Mucke. Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph., 9:66-104, 1990.
10. I. Emiris and J. Canny. An efficient approach to removing geometric degeneracies. In Proc. 8th Annual ACM Symposium Comput. Geom., pages 74-82, 1992.
11. B. Gärtner and E. Welzl. A simple sampling lemma: analysis and applications in geometric optimization. Discrete and Computational Geometry, 25:569-590, 2001.
12. J. Matoušek. On geometric optimization with few violated constraints. Discrete Computational Geometry, 14:365-384, 1994.
13. R.T. Rockafellar. Convex Analysis. Princeton University Press, Princeton, NJ, 1970.
14. M. Sharir and E. Welzl. A combinatorial bound for linear programming and related problems. volume 577 of Lecture Notes In Computer Science, pages 569-579. Springer-Verlag, London, 1992.
15. R. Tempo, G.C. Calafiore, and F. Dabbene. Randomized Algorithms for Analysis and Control of Uncertain Systems. Communications and Control Engineering Series. Springer-Verlag, London, 2005.