Symbolic preconditioning with Taylor models: Some examples

DOI10.1023/A:1021364526413zbMath1016.65041OpenAlexW146771625MaRDI QIDQ1869602

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

global optimizationnonlinear systemsnumerical experimentsinterval analysispreconditioningoverestimationTaylor modelsbranch-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)

Related Items (3)

Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects ⋮ Solving interval constraints by linearization in computer-aided design ⋮ Validated constraints solving --- practicalities, pitfalls, and new developments

Uses Software

• INTOPT_90
• Cosy

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