arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1902.10325math.OC
收藏

鲁棒Optimization和无穷规划问题的遍历方法

Ergodic Approach to Robust Optimization and Infinite Programming Problems

Pedro Pérez-Aros

摘要:

在这项工作中,我们展示了一种方法的一致性,用于解决强大的最优化问题,使用遍历保测变换产生的子问题序列。本文的主要结果是子问题的极小值和最优值在某种意义下分别收敛于原问题的极小值和最优值。我们的结果特别暗示了情景方法对于非凸最优化问题的一致性。最后,我们表明,我们的方法也可以用来解决无限规划问题。

英文摘要:

In this work, we show the consistency of an approach for solving robust optimization problems using sequences of sub-problems generated by ergodic measure preserving transformations. The main result of this paper is that the minimizers and the optimal value of the sub-problems converge, in some sense, to the minimizers and the optimal value of the initial problem, respectively. Our result particularly implies the consistency of the scenario approach for nonconvex optimization problems. Finally, we show that our method can also be used to solve infinite programming problems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑