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

Pareto曲线的半定松弛逼近

Approximating Pareto Curves using Semidefinite Relaxations

CNRS(法国国家科学研究中心);LAAS(法国国家科学研究中心系统分析与架构实验室);Université de Toulouse(图卢兹大学);Czech Technical University in Prague(布拉格捷克理工大学)

Victor Magron, Didier Henrion, Jean-Bernard Lasserre

摘要:

我们考虑与多目标最优化问题$\min_{\mathbf{x} \in \mathbf{S}}\{ (f_1(\mathbf{x}), f_2(\mathbf{x})) \}$相关的Pareto曲线的近似构造问题,其中$f_1$和$f_2$是两个冲突的多项式准则,而$\mathbf{S} \subset \mathbb{R}^n$是一个紧的基本半代数集.我们提供了一个系统的数值方案来近似帕累托曲线。我们首先将初始问题简化为一个标量化多项式最优化问题(POP)。三种标量化方法导致考虑不同的参数POP,即(a)加权凸和近似,(b)加权切比雪夫近似,和(c)参数子水平集近似。对于每一种情况下,我们必须解决一个半定规划(SDP)层次参数化的时刻或等价的程度多项式平方和近似的帕累托曲线。当多项式逼近的次数趋于无穷大时,我们保证方法(a)和(b)收敛于$L^2$ -范数的Pareto曲线,方法(c)收敛于$L^1$ -范数的Pareto曲线。

英文摘要:

We consider the problem of constructing an approximation of the Pareto curve associated with the multiobjective optimization problem $\min_{\mathbf{x} \in \mathbf{S}}\{ (f_1(\mathbf{x}), f_2(\mathbf{x})) \}$, where $f_1$ and $f_2$ are two conflicting polynomial criteria and $\mathbf{S} \subset \mathbb{R}^n$ is a compact basic semialgebraic set. We provide a systematic numerical scheme to approximate the Pareto curve. We start by reducing the initial problem into a scalarized polynomial optimization problem (POP). Three scalarization methods lead to consider different parametric POPs, namely (a) a weighted convex sum approximation, (b) a weighted Chebyshev approximation, and (c) a parametric sublevel set approximation. For each case, we have to solve a semidefinite programming (SDP) hierarchy parametrized by the number of moments or equivalently the degree of a polynomial sums of squares approximation of the Pareto curve. When the degree of the polynomial approximation tends to infinity, we provide guarantees of convergence to the Pareto curve in $L^2$-norm for methods (a) and (b), and $L^1$-norm for method (c).

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

↑