Random convex programs part 2

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

Volumn , Issue , 2010, Pages 1546-1552

  Calafiore, Giuseppe Carlo ^a  

^a POLITECNICO DI TORINO   (Italy)

Author keywords

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

Indexed keywords

ARBITRARY LEVELS; ASYMPTOTIC BOUNDS; CHANCE-CONSTRAINED; CHANCE-CONSTRAINED OPTIMIZATIONS; CONSTRAINT VIOLATION; CONVEX PROGRAMS; HIGH PROBABILITY; OPTIMAL CONSTRAINT; POSTERIORI; RANDOMIZED METHODS; ROBUST CONVEX OPTIMIZATION; SCENARIO OPTIMIZATION; UPPER BOUND;

COMPUTER CONTROL SYSTEMS; CONVEX OPTIMIZATION; PROBABILITY; REMOTE CONTROL; SYSTEMS ANALYSIS;

CONSTRAINED OPTIMIZATION;

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

References (31)

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), 2009.
2. E. Bai, H. Cho, and R. Tempo. Optimization with few violated constraints for linear bounded error parameter estimation. IEEE Transactions on Automatic Control, 47:1067-1077, 2002.
3. A. Ben-Tal and A. Nemirovski. Robust convex optimization. Mathematics of Operations Research, 23:769-805, 1998.
4. A. Ben-Tal and A. Nemirovski. Robust optimization: Methodology and applications. Mathematical Programming, 92:453-480, 2002.
5. G.C. Calafiore. Random convex programs - part 1. In IEEE Multi-Conference on Systems and Control (MSC), Yokoama, Japan, 2010.
6. G.C. Calafiore and M.C. Campi. Uncertain convex programs: randomized solutions and confidence levels. Mathematical Programming, 102(1):25-46, 2005.
7. G.C. Calafiore and M.C. Campi. The scenario approach to robust control design. IEEE Transactions on Automatic Control, 51(5):742-753, 2006.
8. M.C. Campi and G.C. Calafiore. Notes on the scenario design approach. IEEE Transactions on Automatic Control, 54(2):382-385, 2009.
9. M.C. Campi, G.C. Calafiore, and S. Garatti. New results on the identification of interval predictor models. In Proceedings of the IFAC World Congress, Prague, 2005.
10. M.C. Campi, G.C. Calafiore, and S. Garatti. Interval predictor models: Identification and reliability. Automatica, 45(2):382-392, 2009.
11. 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.
12. M.C. Campi and S. Garatti. Chance-constrained optimization via randomization: feasibility and optimality. Optimization Online, Sept. 2008.
13. A. Charnes and W.W. Cooper. Deterministic equivalents for optimizing and satisfying under chance constraints. Operations Research, 11:18-39, 1963.
14. 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.
15. D.P. de Farias and B. Van Roy. On constraint sampling in the linear programming approach to approximate dynamic programming. Mathematics of Operations Research, 29(3):462-478, 2004.
16. D. Dentcheva, A. Prékopa, and A. Ruszczyński. Concavity and efficient points of discrete distributions in probabilistic programming. Mathematical Programming, 89:55-77, 2000.
17. A. Desolneux, L. Moisan, and J.-M. Morel. Estimating the binomial tail. In From Gestalt Theory to Image Analysis, Series in Interdisciplinary Applied Mathematics, pages 47-63. Springer, New York, 2008.
18. L. El Ghaoui and H. Lebret. Robust solutions to uncertain semidefinite programs. SIAM Journal on Optimization, 9(1):33-52, 1998.
19. C. M. Lagoa, X. Li, and M. Sznaier. Probabilistically constrained linear programs and risk-adjusted controller design. SIAM Journal on Optimization, 15:938-951, 2005.
20. J. Luedtke and S. Ahmed. A sample approximation approach for optimization with probabilistic conststraints. SIAM Journal on Optimization, 19(2):674-699, 2008.
21. J. Matoušek. On enclosing k points by a circle. Information Processing Letters, 53:217-221, 1995.
22. J. Matoušek. On geometric optimization with few violated constraints. Discrete Computational Geometry, 14:365-384, 1994.
23. A. Nemirovski and A. Shapiro. Convex approximations of chance constrained programs. SIAM Journal on Optimization, 17(4):969-996, 2006.
24. A. Nemirovski and A. Shapiro. Scenario approximations of chance constraints. In G.C. Calafiore and F. Dabbene, editors, Probabilistic and Randomized Methods for Design under Uncertainty, pages 3-47. Springer-Verlag, London, 2006.
25. A. Prékopa. On probabilistic constrained programming. In Proceedings of the Princeton Symposium on Mathematical Programming, pages 113-138. Princeton University Press, Princeton, New Jersey, 1970.
26. A. Prékopa. Stochastic Programming. Kluwer Academic Publishers, Dordrecht, 1995.
27. A. Prékopa. Probabilistic programming. In A. Rusczyński and A. Shapiro, editors, Stochastic Programming, volume 10 of Handbooks in Operations Research and Management Science. Elsevier, Amsterdam, 2003.
28. A. Rusczyński and A. Shapiro. Optimization of risk measures. In G.C. Calafiore and F. Dabbene, editors, Probabilistic and Randomized Methods for Design under Uncertainty, pages 117-158. Springer-Verlag, London, 2006.
29. A. Ruszczyński and A. Shapiro (editors). Stochastic Programming, volume 10 of Handbooks in Operations Research and Management Science. Elsevier, Amsterdam, 2003.
30. 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.
31. V.N. Vapnik. Statistical Learning Theory. Wiley, New York, 1998.