Symbolic preconditioning with Taylor models: Some examples

DOI10.1023/A:1021364526413MaRDI QIDQ1869602zbMATH OpenOpenAlexFDO

Authors Ralph Baker Kearfott, G. William Walster

Publication date 28 April 2003

Published in Reliable Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1021364526413

zbMATH Keywords

branch-and-bound methodsglobal optimizationinterval analysisinterval Newton methodsnonlinear systemsnumerical experimentsoverestimationpreconditioningTaylor models

Mathematics Subject Classification ID

Interval and finite arithmetic (65G30) Numerical mathematical programming methods (65K05) Nonlinear programming (90C30) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Rigorous global search using taylor models
• Advances in interval methods for deterministic global optimization in chemical engineering
• On Taylor Model Based Integration of ODEs
• scientific article; zbMATH DE number 2035082
• What can interval analysis do for global optimization?

Cited in

(6)

• Efficient control of the dependency problem based on Taylor model methods
• Global optimization with higher order inclusion function forms. I: A combined Taylor-Bernstein form
• Advances in interval methods for deterministic global optimization in chemical engineering
• Validated constraints solving --- practicalities, pitfalls, and new developments
• Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects
• Solving interval constraints by linearization in computer-aided design

Describes a project that uses

Uses Software

• INTOPT_90
• Cosy

This page was built for publication: Symbolic preconditioning with Taylor models: Some examples

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