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

仅使用初等计算的有界约束多项式optimization

Bound-constrained polynomial optimization using only elementary calculations

Etienne de Klerk, Jean Lasserre, Monique Laurent, Zhao Sun

摘要:

我们提供了一个单调非增序列的上界$f^H_k$($k\ge 1$)收敛到一个简单的集合,如单位超立方体上的多项式$f$的全局最小值。文[J. B. Lasserre,A new look at nonnegativity on closed sets and polynomial optimization,SIAM J. Optim. 21,pp. 864- 885,2010]的优点是只需要基本的计算。对于超立方体上的优化问题,我们证明了新的边界$f^H_k$在$O(1/\sqrt {k})$中具有一定的收敛速度。此外,我们表现出更强的收敛速度在$O(1/k)$的二次多项式和更一般的多项式有一个合理的极小超立方体。相比之下,所有合理的网格点与分母$k$的评估产生的界的收敛速度在$O(1/k^2)$,但在$O(k^n)$功能评估的成本,而新的界$f^H_k$只需要$O(n^k)$基本计算。

英文摘要:

We provide a monotone non increasing sequence of upper bounds $f^H_k$ ($k\ge 1$) converging to the global minimum of a polynomial $f$ on simple sets like the unit hypercube. The novelty with respect to the converging sequence of upper bounds in [J.B. Lasserre, A new look at nonnegativity on closed sets and polynomial optimization, SIAM J. Optim. 21, pp. 864--885, 2010] is that only elementary computations are required. For optimization over the hypercube, we show that the new bounds $f^H_k$ have a rate of convergence in $O(1/\sqrt {k})$. Moreover we show a stronger convergence rate in $O(1/k)$ for quadratic polynomials and more generally for polynomials having a rational minimizer in the hypercube. In comparison, evaluation of all rational grid points with denominator $k$ produces bounds with a rate of convergence in $O(1/k^2)$, but at the cost of $O(k^n)$ function evaluations, while the new bound $f^H_k$ needs only $O(n^k)$ elementary calculations.

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

↑