Polyhedral approximation of multivariate polynomials using Handelman's theorem

DOI10.1007/978-3-662-49122-5_8MaRDI QIDQ2796046zbMATH OpenOpenAlexFDO

Authors Alexandre Maréchal, Alexis Fouilhé, Tim King, David Monniaux, M. Perin

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

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Applications of mathematical programming (90C90) Computational aspects related to convexity (52B55) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• scientific article; zbMATH DE number 1948398
• Scalable Minimizing-Operators on Polyhedra via Parametric Linear Programming
• Not necessarily closed convex polyhedra and the double description method
• Refinement to Certify Abstract Interpretations, Illustrated on Linearization for Polyhedra
• Fast polyhedra abstract domain

Cited in

(6)

• Optimization modulo non-linear arithmetic via incremental linearization
• Refinement to certify abstract interpretations: illustrated on linearization for polyhedra
• Invariant checking of NRA transition systems via incremental reduction to LRA with EUF
• Deciding the consistency of non-linear real arithmetic constraints with a conflict driven search using cylindrical algebraic coverings
• A survey of satisfiability modulo theory
• Satisfiability modulo finite fields

Describes a project that uses

Uses Software

• raSAT
• SMT-RAT
• Sollya
• CVC4
• StarExec
• OCaml
• PPL
• z3
• SMT-LIB
• Coq
• Apron

This page was built for publication: Polyhedral approximation of multivariate polynomials using Handelman's theorem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2796046)