Polyhedral Approximation of Multivariate Polynomials Using Handelman’s Theorem
From MaRDI portal
Publication:2796046
DOI10.1007/978-3-662-49122-5_8zbMath1475.68093OpenAlexW2296148279MaRDI QIDQ2796046
Tim King, Michael Périn, Alexandre Maréchal, David Monniaux, Alexis Fouilhé
Publication date: 23 March 2016
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-49122-5_8
Applications of mathematical programming (90C90) Computational aspects related to convexity (52B55) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Optimization modulo non-linear arithmetic via incremental linearization, Invariant Checking of NRA Transition Systems via Incremental Reduction to LRA with EUF, Refinement to certify abstract interpretations: illustrated on linearization for polyhedra, Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings, A Survey of Satisfiability Modulo Theory
Uses Software
