Formal Global Optimisation with Taylor Models

DOI10.1007/11814771_35MaRDI QIDQ3613424zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Roland Zumkeller

Publication date 12 March 2009

Published in Automated Reasoning (Search for Journal in Brave)

Full work available at URL http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.680.8497

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Recommendations

• Formal Proofs for Nonlinear Optimization
• Formalization of Bernstein polynomials and applications to global optimization
• Rigorous global search using taylor models
• Certification of bounds of non-linear functions: the templates method
• Formal proofs in real algebraic geometry: from ordered fields to quantifier elimination

Cited in

(8)

• A validated real function calculus
• Formalization of Bernstein polynomials and applications to global optimization
• Certification of bounds of non-linear functions: the templates method
• Rigorous global search using taylor models
• Proving Bounds on Real-Valued Functions with Computations
• The dodecahedral conjecture
• Formal Proofs for Nonlinear Optimization
• Efficient and accurate computation of upper bounds of approximation errors

Describes a project that uses

Uses Software

• Coq
• Automath

This page was built for publication: Formal Global Optimisation with Taylor Models

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