Taylor Models in Deterministic Global Optimization

  • R. Baker Kearfott
  • Alvard Arazyan


Deterministic global optimization requires a global search with rejection of subregions. To reject a subregion, bounds on the range of the constraints and objective function can be used. Although often effective, simple interval arithmetic sometimes gives impractically large bounds on the ranges. However, Taylor models as developed by Berz et al. may be effective in this context. Efficient incorporation of such models in a general global optimization package is a significant project. Here, we use the system COSY Infinity by Berz et al. to study the bounds on the range of various order Taylor models for certain difficult test problems we have previously encountered. Based on that, we conclude that Taylor models may be useful for some, but not all, problems in verified global optimization. Forthcoming improvements in the COSY Infinity interface will help us reach stronger conclusions.


Global Optimization Interval Arithmetic Global Optimization Algorithm Interval Computation Taylor Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • R. Baker Kearfott
  • Alvard Arazyan

There are no affiliations available

Personalised recommendations