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

使用梯度触角和平方和的多项式的全局optimization

Global optimization of polynomials using gradient tentacles and sums of squares

Markus Schweighofer

摘要:

本文将广义临界值理论与有界元的迭代环(实全纯环)理论相结合。我们考虑的问题,计算的整体下确界的实多项式在几个变量。每一个全局极小点都依赖于梯度簇。如果多项式达到最小值,则等效于寻找其梯度变化的下确界。Nie,Demmel和Sturmfels最近证明了这样的下界的平方和证书的存在性定理。基于这些证书,他们发现任意紧松弛的原始问题,可以制定为半定程序,从而有效地解决。我们在这里处理更一般的情况下,多项式是有界的,但不一定达到最小值。在这种情况下,Nie,Demmel和Sturmfels的方法可能会产生完全错误的结果。为了克服这个问题,我们用更大的半代数集来代替梯度簇,我们称之为梯度触角。现在证明必要的平方和证书的存在变得更加困难。

英文摘要:

In this work, the combine the theory of generalized critical values with the theory of iterated rings of bounded elements (real holomorphy rings). We consider the problem of computing the global infimum of a real polynomial in several variables. Every global minimizer lies on the gradient variety. If the polynomial attains a minimum, it is therefore equivalent to look for the greatest lower bound on its gradient variety. Nie, Demmel and Sturmfels proved recently a theorem about the existence of sums of squares certificates for such lower bounds. Based on these certificates, they find arbitrarily tight relaxations of the original problem that can be formulated as semidefinite programs and thus be solved efficiently. We deal here with the more general case when the polynomial is bounded from belo w but does not necessarily attain a minimum. In this case, the method of Nie, Demmel and Sturmfels might yield completely wrong results. In order to overcome this problem, we replace the gradient variety by larger semialgebraic sets which we call gradient tentacles. It now gets substantially harder to prove the existence of the necessary sums of squares certificates.

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

↑