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

Moment-SOS层级

The Moment-SOS hierarchy

Jean Lasserre

摘要:

Moment-SOS层次最初于2000年在优化中引入,基于K-矩问题及其对偶对应物的理论,即K上为正的多项式。结果表明,该方法也可以应用于解决具有正性约束“f(x)$\ge$ 0 for all x $\in$ K“和/或Borel测度上的线性约束的问题。这些问题可以被看作是“广义矩问题”(GPM)的具体实例,GPM在各个领域的重要应用是无止境的。我们描述了这种方法,并概述了它在各个领域的应用。

英文摘要:

The Moment-SOS hierarchy initially introduced in optimization in 2000, is based on the theory of the K-moment problem and its dual counterpart, polynomials that are positive on K. It turns out that this methodology can be also applied to solve problems with positivity constraints " f (x) $\ge$ 0 for all x $\in$ K " and/or linear constraints on Borel measures. Such problems can be viewed as specific instances of the " Generalized Problem of Moments " (GPM) whose list of important applications in various domains is endless. We describe this methodology and outline some of its applications in various domains.

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

↑