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

实不等式的证明--模板与平方和

Certification of Real Inequalities -- Templates and Sums of Squares

Xavier Allamigeon, Stéphane Gaubert, Victor Magron, Benjamin Werner

摘要:

本文研究实值多元超越函数的下界证明问题。我们正在处理的功能是非线性的,涉及半代数运算,以及一些超越功能,如$\cos$,$\arctan$,$\exp$等,我们的总体框架是使用不同的近似方法放松到多项式最优化问题,我们解决了稀疏平方和松弛。特别是,我们结合的想法maxplus估计(最初引入最优控制)和线性模板(最初引入静态分析的抽象解释)。非线性模板控制的复杂性的半代数松弛的代价是粗糙的maxplus近似。通过这种方式,我们得到了一种新的基于模板的认证全局最优化方法,该方法利用了平方和松弛的精度和抽象方法的可扩展性。我们分析了该方法的性能问题的全局优化文献,以及中等大小的不等式从Flyspeck项目。

英文摘要:

We consider the problem of certifying lower bounds for real-valued multivariate transcendental functions. The functions we are dealing with are nonlinear and involve semialgebraic operations as well as some transcendental functions like $\cos$, $\arctan$, $\exp$, etc. Our general framework is to use different approximation methods to relax the original problem into polynomial optimization problems, which we solve by sparse sums of squares relaxations. In particular, we combine the ideas of the maxplus estimators (originally introduced in optimal control) and of the linear templates (originally introduced in static analysis by abstract interpretation). The nonlinear templates control the complexity of the semialgebraic relaxations at the price of coarsening the maxplus approximations. In that way, we arrive at a new - template based - certified global optimization method, which exploits both the precision of sums of squares relaxations and the scalability of abstraction methods. We analyze the performance of the method on problems from the global optimization literature, as well as medium-size inequalities issued from the Flyspeck project.

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

↑