arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2109.03208math.OC
收藏

欧氏向量空间上的Pareto鲁棒optimization

Pareto Robust optimization on Euclidean vector spaces

Dennis Adelhuette, Christian Biefel, Martina Kuchlbauer, Jan Rolfes

摘要:

鲁棒线性规划的Pareto有效性由Iancu和Trichakis在[9]中引入。我们将他们的方法和理论结果推广到具有仿射不确定性的欧几里得空间中的鲁棒最优化问题。此外,我们证明了这种方法在鲁棒半定规划(SDP)领域的示范性方式的价值。特别是,我们证明了计算Pareto鲁棒最优解的鲁棒SDP是易于处理的,并说明了这样的解决方案的好处,在最大本征值问题的例子。此外,我们修改了Goemans和Williamson [8]的著名算法,以便计算鲁棒最大割问题的割,从而在非最坏情况下产生改进的近似保证。

英文摘要:

Pareto efficiency for robust linear programs was introduced by Iancu and Trichakis in [9]. We generalize their approach and theoretical results to robust optimization problems in Euclidean spaces with affine uncertainty. Additionally, we demonstrate the value of this approach in an exemplary manner in the area of robust semidefinite programming (SDP). In particular, we prove that computing a Pareto robustly optimal solution for a robust SDP is tractable and illustrate the benefit of such solutions at the example of the maximal eigenvalue problem. Furthermore, we modify the famous algorithm of Goemans and Williamson [8] in order to compute cuts for the robust max-cut problem that yield an improved approximation guarantee in non-worst-case scenarios.

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

↑