The use of interval arithmetic for constrained and unconstrained global optimization is discussed in this talk. Interval methods allow the localization of global minima even in the presence of discontinuities and singularities. Constraints can be nonlinear.
