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

利用几何规划求多项式的下界

Lower bounds for polynomials using geometric programming

Mehdi Ghasemi, Murray Marshall

摘要:

利用Hurwitz和Reznick的一个结果以及Fidalgo和Kovacec的一个结果,给出了偶数次多项式$f\in\mathbb{R}[X_1,...,X_n]$为平方和的一个新的充分条件.这个结果推广了Lasserre的一个结果和Fidalgo和Kovacec的一个结果,也推广了文[6]中这些结果的改进.我们应用这一结果获得一个新的下界$f_{gp}$ $f$,我们解释如何$f_{gp}$可以使用几何规划计算。下界$f_{gp}$一般不如Lasserre和Parrilo和Sturmfels引入的下界$f_{sos}$好,后者是使用半定编程计算的,但运行时比较表明,在实践中,$f_{gp}$的计算要快得多。当$f$的最高次数项具有$\sum_{i=1}^n a_iX_i^{2d}$、$a_i>0$、$i=1,...,n$的形式时,计算最简单。在[6]中建立的$f$的下界是通过在适当的可行点处对几何规划的目标函数求值得到的。

英文摘要:

We make use of a result of Hurwitz and Reznick, and a consequence of this result due to Fidalgo and Kovacec, to determine a new sufficient condition for a polynomial $f\in\mathbb{R}[X_1,...,X_n]$ of even degree to be a sum of squares. This result generalizes a result of Lasserre and a result of Fidalgo and Kovacec, and it also generalizes the improvements of these results given in [6]. We apply this result to obtain a new lower bound $f_{gp}$ for $f$, and we explain how $f_{gp}$ can be computed using geometric programming. The lower bound $f_{gp}$ is generally not as good as the lower bound $f_{sos}$ introduced by Lasserre and Parrilo and Sturmfels, which is computed using semidefinite programming, but a run time comparison shows that, in practice, the computation of $f_{gp}$ is much faster. The computation is simplest when the highest degree term of $f$ has the form $\sum_{i=1}^n a_iX_i^{2d}$, $a_i>0$, $i=1,...,n$. The lower bounds for $f$ established in [6] are obtained by evaluating the objective function of the geometric program at the appropriate feasible points.

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

↑