10:45 AM-12:45 PM
Room: Atlanta 3
Deterministic global optimization involves exhaustive search over the domain to find global (in contrast to local) minimizers. Interval arithmetic with directed rounding permits such a search to be mathematically rigorous. Such reliable global optimization algorithms have applications ranging from engineering and scientific model design and refinement to economic and financial analyses. The purpose of this minisymposium is to inform the optimization community as a whole of recent work in software and applications of interval and non-interval-based deterministic global optimization, and to foster interaction between researchers in the area and the optimization community as a whole.
Organizer: R. Baker Kearfott
University of Southwestern Louisiana