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

具有相关稀疏性的矩松弛中的有限收敛和极小值提取

Finite convergence and minimizer extraction in moment relaxations with correlative sparsity

Friedrich–Alexander Universität Erlangen–Nürnberg(埃尔朗根-纽伦堡大学);Pontificia Universidad Católica de Chile(智利天主教 Pontificia 大学)

Giovanni Fantuzzi, Federico Fuentes

AI总结:

研究多项式优化问题矩松弛有限收敛新条件,源于截断矩问题相关稀疏解,要求矩矩阵有平坦扩展等,还给出满足条件时提取极小值的算法。

摘要:

我们确定了具有相关稀疏性的多项式优化问题的矩松弛有限收敛的一个新的充分条件。这个条件来自于经典截断矩问题的相关稀疏版本的一个解,要求某些矩矩阵允许一个平坦扩展,并且支撑松弛的变量团满足一个“运行交集”属性。我们还描述了一种算法,当这些条件满足时,该算法为原始多项式优化问题提取的极小值至少与松弛中矩矩阵的最大秩一样多。我们的结果以及运行交集属性的必要性通过例子来说明。

英文摘要:

We identify a new sufficient condition for the finite convergence of moment relaxations of polynomial optimization problems with correlative sparsity. This condition, which follows from a solution to a correlatively sparse version of the classical truncated moment problem, requires that certain moment matrices admit a flat extension and that the variable cliques underpinning the relaxation satisfy a "running intersection" property. We also describe an algorithm that, when these conditions are met, extracts at least as many minimizers for the original polynomial optimization problem as the largest rank of the moment matrices in its relaxation. Our results, along with the necessity of the running intersection property, are illustrated with examples.

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

↑