Symbolic preconditioning with Taylor models: Some examples

DOI10.1023/A:1021364526413zbMATH Open1016.65041OpenAlexW146771625MaRDI QIDQ1869602FDOQ1869602

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

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?

zbMATH Keywords

global optimizationpreconditioningnumerical experimentsnonlinear systemsinterval analysisTaylor modelsoverestimationbranch-and-bound methodsinterval Newton methods

Mathematics Subject Classification ID

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

Cited In (5)

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

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)