Title :
Randomized min-max optimization: The exact risk of multiple cost levels
Author :
Care, Algo ; Garatti, Simone ; Campi, Marco C.
Author_Institution :
Dipt. di Ing. dell´´Inf., Univ. di Brescia, Brescia, Italy
Abstract :
In this paper, we present a theoretical result that applies to convex optimization problems in the presence of an uncertain stochastic parameter. We consider the min-max sample-based solution, i.e. the min-max solution computed over a finite sample of instances of the uncertain stochastic parameter, and the costs incurred by this solution in correspondence of the sampled parameter instances. Our goal is to evaluate the risks associated to the various costs, where the risk associated to a cost is the probability that the cost is exceeded when a new uncertainty instance is seen. The theoretical result proven in this paper is that the risks form a random vector whose probability distribution is always an ordered Dirichlet distribution, irrespective of the probability measure of the uncertain stochastic parameter. This evaluation characterizes completely the risks associated to the costs, and represents a full-fledged result on the reliability of the min-max sample-based solution.
Keywords :
convex programming; minimax techniques; randomised algorithms; statistical distributions; vectors; convex optimization problem; minmax sample-based solution; multiple cost level exact risk; ordered Dirichlet distribution; probability distribution; random vector; randomized minmax optimization; sampled parameter instances; uncertain stochastic parameter; Distribution functions; Joints; Optimization; Probability distribution; Reliability; Uncertainty; Vectors; Optimization; Optimization Algorithms; Randomized Algorithms;
Conference_Titel :
Decision and Control and European Control Conference (CDC-ECC), 2011 50th IEEE Conference on
Conference_Location :
Orlando, FL
Print_ISBN :
978-1-61284-800-6
Electronic_ISBN :
0743-1546
DOI :
10.1109/CDC.2011.6161308