arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1307.3231cs.SCcs.LO
收藏

非线性函数界的证明:模板法

Certification of Bounds of Non-linear Functions: the Templates Method

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

摘要:

这项工作的目的是证明下界的实值多元函数,定义的半代数或超越表达式。最终,证书必须在Coq之类的证明系统中是可正式证明的。这种工具的应用范围很广,例如黑尔斯对开普勒猜想的证明就产生了数千个不等式。我们介绍了一种近似算法,它结合了最大加基方法(最优控制)和Manna等人开发的线性模板方法(静态分析)的思想。该算法包括在边界的一些成分的功能的上确界的二次形式具有良好的选择曲率。这导致半代数优化问题,解决平方和松弛。模板限制了这些弛豫的爆破,代价是使近似粗糙化。我们说明了我们的框架的效率,从文献中的各种例子,并讨论了与Coq的接口。

英文摘要:

The aim of this work is to certify lower bounds for real-valued multivariate functions, defined by semialgebraic or transcendental expressions. The certificate must be, eventually, formally provable in a proof system such as Coq. The application range for such a tool is widespread; for instance Hales' proof of Kepler's conjecture yields thousands of inequalities. We introduce an approximation algorithm, which combines ideas of the max-plus basis method (in optimal control) and of the linear templates method developed by Manna et al. (in static analysis). This algorithm consists in bounding some of the constituents of the function by suprema of quadratic forms with a well chosen curvature. This leads to semialgebraic optimization problems, solved by sum-of-squares relaxations. Templates limit the blow up of these relaxations at the price of coarsening the approximation. We illustrate the efficiency of our framework with various examples from the literature and discuss the interfacing with Coq.

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

↑