Certification of bounds of non-linear functions: the templates method

Authors:
Xavier Allamigeon;Stéphane Gaubert;Victor Magron;Benjamin Werner
Affiliations:
INRIA and CMAP, École Polytechnique, Palaiseau, France;INRIA and CMAP, École Polytechnique, Palaiseau, France;INRIA and LIX, École Polytechnique, Palaiseau, France;INRIA and LIX, École Polytechnique, Palaiseau, France
Venue:
CICM'13 Proceedings of the 2013 international conference on Intelligent Computer Mathematics
Year:
2013

Citing 17
Cited 0

A Max-Plus-Based Algorithm for a Hamilton--Jacobi--Bellman Equation of Nonlinear Filtering

SIAM Journal on Control and Optimization
Global Optimization with Polynomials and the Problem of Moments

SIAM Journal on Optimization
A Numerical Evaluation of Several Stochastic Algorithms on Selected Continuous Global Optimization Test Problems

Journal of Global Optimization
Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity

SIAM Journal on Optimization
A Curse-of-Dimensionality-Free Numerical Method for Solution of Certain HJB PDEs

SIAM Journal on Control and Optimization
The Max-Plus Finite Element Method for Solving Deterministic Optimal Control Problems: Basic Properties and Convergence Analysis

SIAM Journal on Control and Optimization
Algorithm 883: SparsePOP---A Sparse Semidefinite Programming Relaxation of Polynomial Optimization Problems

ACM Transactions on Mathematical Software (TOMS)
Computing sum of squares decompositions with rational coefficients

Theoretical Computer Science
MetiTarski: An Automatic Theorem Prover for Real-Valued Special Functions

Journal of Automated Reasoning
Fast reflexive arithmetic tactics the linear case and beyond

TYPES'06 Proceedings of the 2006 international conference on Types for proofs and programs
Verifying nonlinear real formulas via sums of squares

TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Chebyshev interpolation polynomial-based tools for rigorous computing

Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation
Adaptive cubic regularisation methods for unconstrained optimization. Part I: motivation, convergence and numerical results

Mathematical Programming: Series A and B
On the generation of positivstellensatz witnesses in degenerate cases

ITP'11 Proceedings of the Second international conference on Interactive theorem proving
Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients

Journal of Symbolic Computation
Positivity and Optimization for Semi-Algebraic Functions

SIAM Journal on Optimization
Scalable analysis of linear systems using mathematical programming

VMCAI'05 Proceedings of the 6th international conference on Verification, Model Checking, and Abstract Interpretation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.