Interval methods for global optimization

Interval methods for global optimization

We propose interval arithmetic and interval constraint algorithms for global optimization. Both of these compute lower and upper bounds of a function over a box, and return a lower and an upper bound for the global minimum. In interval arithmetic methods, the bounds are computed using interval arit...

Full description

Bibliographic Details
Main Author: Moa, Belaid
Other Authors: van Emden, Maarten H.
Language:English
en
Published: 2007
Subjects:
Interval constraints
Interval analysis
Interval arithmetic
constraint processing
reliable computing
numerical analysis
global optimization
bounding methods
point methods
exploration
UVic Subject Index::Sciences and Engineering::Applied Sciences::Computer science
Online Access:http://hdl.handle.net/1828/198

Internet

http://hdl.handle.net/1828/198

Similar Items