Deterministic global optimization using interval constraint propagation techniques

Laboratoire de Mathématiques Appliquées, FRE 2570, Université de Pau et des Pays de l'Adour, UFR Sciences et Techniques, Département d'Informatique, BP 1155, 64013 Pau Cedex, France; Frederic.Messine@univ-pau.fr; messine@leei.enseeiht.fr.

Abstract

The purpose of this article is to show the great interest of the use of propagation (or pruning) techniques, inside classical interval Branch-and-Bound algorithms. Therefore, a propagation technique based on the construction of the calculus tree is entirely explained and some properties are presented without the need of any formalism (excepted interval analysis). This approach is then validated on a real example: the optimal design of an electrical rotating machine.