Tuesday, May 11

Rigorous Deterministic Search in Global Optimization

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

10:45-11:10 Underestimation Techniques in Global Optimization
Arnold Neumaier and Hermann Schichl, University of Vienna, Austria
11:15-11:40 The GLOPT-2 Branch and Bound Package
Hermann Schichl and Arnold Neumaier, University of Vienna, Austria
11:45-12:10 The GlobSol Project: Rigorous Global Solution
George F. Corliss, Marquette University; and R. Baker Kearfott, Organizer
12:15-12:40 Warning! Containment and Existence Conflict
G. William Walster, Sun Microsystems

OP99 Home


Program Updates

Speaker Index




MMD, 12/21/98