arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1404.6145math.OCmath.AG
收藏

超立方体上多项式Optimization的Putinar型表示的误差界

Error Bounds for Polynomial Optimization over the Hypercube using Putinar type Representations

Victor Magron

摘要:

考虑优化问题$p_{\min, Q} := \min_{\mathbf{x} \in Q} p(\mathbf{x})$,其中$p$是次数$m$多元多项式,$Q := [0, 1]^n$是超立方体。我们提供了明确的程度和误差界的平方和逼近的$p_{\min, Q}$对应的Positivstellenance的Putinar。我们的方法使用Bernstein多元多项式近似,按照德克勒克和劳伦特的方法,在超立方体上提供Schmüdgen型阳性证书的误差界。我们给出了新的界限Putinar型表示的二次模和预序相关的多项式$g_i := x_i (1 - x_i), \: i=1,\dots,n$,描述超立方体$Q$。

英文摘要:

Consider the optimization problem $p_{\min, Q} := \min_{\mathbf{x} \in Q} p(\mathbf{x})$, where $p$ is a degree $m$ multivariate polynomial and $Q := [0, 1]^n$ is the hypercube. We provide explicit degree and error bounds for the sums of squares approximations of $p_{\min, Q}$ corresponding to the Positivstellensatz of Putinar. Our approach uses Bernstein multivariate approximation of polynomials, following the methodology of De Klerk and Laurent to provide error bounds for Schmüdgen type positivity certificates over the hypercube. We give new bounds for Putinar type representations by relating the quadratic module and the preordering associated with the polynomials $g_i := x_i (1 - x_i), \: i=1,\dots,n$, describing the hypercube $Q$.

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

↑