Wednesday, May 22

MS40
Interval Methods in Optimization: II

9:45 AM - 11:45 AM
Room: Pier 7 & 8

For Part I, see MS22

The two suggested minisymposia cover algorithmic improvements on interval arithmetic based optimization techniques. The addressed problem set is global optimization, where verified solution is necessary. The talks summarize results on several aspects of the related methods, and application fields.

Purpose: to discuss the state of the art in verified techniques of nonlinear optimization.

Audience: The anticipated audience is researchers interested in verified nonlinear optimization.

Organizer: Tibor Csendes
University of Szeged, Hungary
R. Baker Kearfott
University of Louisiana, Lafayette

9:45-10:10 Interval Linear and Nonlinear Regression -- New Paradigms, Implementations, and Experiments

Jie Yang and R. Baker Kearfott, University of Louisiana, Lafayette

10:15-10:40 New Interval Methods for Constrained Global Optimization

Tibor Csendes and Mihaly Markot, University of Szeged, Hungary; Jose Fernandez Hernandez, University of Murcia, Spain; Leocadio Gonzalez Casado, University of Almeria, Spain

10:45-11:10 Taylor Model Methods and Their Heuristics for Global Optimization

Martin Berz, Michigan State University

11:15-11:40 A Strategy for Computing Inner and Outer Approximations of the Range of a Lipschitz Function on a Box

Gerhard Heindl, University of Wuppertal, Germany