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...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | English en |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1828/198 |