基于多元超几何分布的单形上多项式optimization的误差分析
An error analysis for polynomial optimization over the simplex based on the multivariate hypergeometric distribution
摘要:
研究了单形上定次多项式的极小化问题。这个问题是众所周知的NP-难,因为它包含了图论中的最大稳定集问题作为一个特殊情况。在本文中,我们考虑了一个有理逼近,通过采取最小的规则网格,其中包括有理点与分母$r$(对于给定的$r$)。我们表明,相关的收敛速度是$O(1/r^2)$二次多项式。对于一般多项式,如果在单纯形上存在有理全局极小,我们证明了收敛速度也是$O(1/r^2)$阶。我们的结果回答了De Klerk et al.(2013)提出的一个问题,并改进了二次情况下先前已知的$O(1/r)$界。
英文摘要:
We study the minimization of fixed-degree polynomials over the simplex. This problem is well-known to be NP-hard, as it contains the maximum stable set problem in graph theory as a special case. In this paper, we consider a rational approximation by taking the minimum over the regular grid, which consists of rational points with denominator $r$ (for given $r$). We show that the associated convergence rate is $O(1/r^2)$ for quadratic polynomials. For general polynomials, if there exists a rational global minimizer over the simplex, we show that the convergence rate is also of the order $O(1/r^2)$. Our results answer a question posed by De Klerk et al. (2013) and improves on previously known $O(1/r)$ bounds in the quadratic case.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。