期刊
IEEE TRANSACTIONS ON AUTOMATIC CONTROL
卷 60, 期 1, 页码 46-58出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TAC.2014.2330702
关键词
Chance-constrained programs; performance bound; randomized algorithm; scenario program; semi-infinite programming; uncertain convex optimization
资金
- European Commission under the project MoVeS
- HYCON2 Network of Excellence
- ETH [ETH-1512-2]
We consider the Scenario Convex Program (SCP) for two classes of optimization problems that are not tractable in general: Robust Convex Programs (RCPs) and Chance-Constrained Programs (CCPs). We establish a probabilistic bridge from the optimal value of SCP to the optimal values of RCP and CCP in which the uncertainty takes values in a general, possibly infinite dimensional, metric space. We then extend our results to a certain class of non-convex problems that includes, for example, binary decision variables. In the process, we also settle a measurability issue for a general class of scenario programs, which to date has been addressed by an assumption. Finally, we demonstrate the applicability of our results on a benchmark problem and a problem in fault detection and isolation.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据