Certification of real inequalities: templates and sums of squares
DOI10.1007/s10107-014-0834-5zbMath1328.90101arXiv1403.5899OpenAlexW2074930141MaRDI QIDQ2349133
Xavier Allamigeon, Victor Magron, Benjamin Werner, Stéphane Gaubert
Publication date: 19 June 2015
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1403.5899
semidefinite programmingpolynomial optimization problemscertified global optimizationmaxplus approximationnonlinear template methodsemialgebraic relaxations
Semidefinite programming (90C22) Nonconvex programming, global optimization (90C26) Sums of squares and representations by other particular quadratic forms (11E25) Approximation methods and heuristics in mathematical programming (90C59) Best approximation, Chebyshev systems (41A50) Approximation by polynomials (41A10)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptive cubic regularisation methods for unconstrained optimization. I: Motivation, convergence and numerical results
- An interval Newton method
- Exact certification in global polynomial optimization via sums-of-squares of rational functions with rational coefficients
- Semiconcave functions, Hamilton-Jacobi equations, and optimal control
- A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems
- Max-plus methods for nonlinear control and estimation.
- Reduced vertex set result for interval semidefinite optimization problems
- The status of the Kepler conjecture
- An introduction to \(\Gamma\)-convergence
- Convex underestimators of polynomials
- Computing sum of squares decompositions with rational coefficients
- Sharpening interval computations
- A proof of the Kepler conjecture
- Global Optimization with Polynomials and the Problem of Moments
- Certification of Bounds of Non-linear Functions: The Templates Method
- NLCertify: A Tool for Formal Nonlinear Optimization
- Coupling policy iteration with semi-definite relaxation to compute accurate numerical invariants in static analysis
- Rigorous global search using taylor models
- Positivity and Optimization for Semi-Algebraic Functions
- A Curse-of-Dimensionality-Free Numerical Method for Solution of Certain HJB PDEs
- The Max-Plus Finite Element Method for Solving Deterministic Optimal Control Problems: Basic Properties and Convergence Analysis
- A Max-Plus-Based Algorithm for a Hamilton--Jacobi--Bellman Equation of Nonlinear Filtering
- Formal Proofs for Nonlinear Optimization
- Convex and Discrete Geometry
- Numerical Methods for Special Functions
- Sums of Squares and Semidefinite Program Relaxations for Polynomial Optimization Problems with Structured Sparsity
- Convex Analysis
- Verification, Model Checking, and Abstract Interpretation
- Sollya: An Environment for the Development of Numerical Codes
