Worst-Case Violation of Sampled Convex Programs for Optimization with Uncertainty
Worst-Case Violation of Sampled Convex Programs for Optimization with Uncertainty
复制标题
用于不确定性优化的采样凸规划的最坏情况违规
DOI:
10.1007/s10957-011-9923-2
复制
发表时间:
2012
影响因子:
1.9
通讯作者:
Takafumi Kanamori and Akiko Takeda
中科院分区:
文献类型:
--
作者:
Said Hanafi,橋本英樹,野々部宏司,Michel Vasquez;Yannick Vimont,柳浦睦憲;中邨良樹,大宮望,大場允晶,山本久志,丸山友希夫;Takafumi Kanamori and Akiko Takeda
A deterministic approach called robust optimization has been recently proposed to deal with optimization problems including inexact data, i.e., uncertainty. The basic idea of robust optimization is to seek a solution that is guaranteed to perform well in terms of feasibility and near-optimality for all possible realizations of the uncertain input data. To solve robust optimization problems, Calafiore and Campi have proposed a randomized approach based on sampling of constraints, where the number of samples is determined so that only a small portion of the original constraints is violated by the randomized solution. Our main concern is not only the probability of violation, but also the degree of violation, i.e., the worst-case violation. We derive an upper bound of the worst-case violation for the sampled convex programs and consider the relation between the probability of violation and the worst-case violation. The probability of violation and the degree of violation are simultaneously bounded by a prescribed value when the number of random samples is large enough. In addition, a confidence interval of the optimal value is obtained when the objective function includes uncertainty. Our method is applicable to not only a bounded uncertainty set but also an unbounded one. Hence, the scope of our method includes random sampling following an unbounded distribution such as the normal distribution.