Volume 38, Number 4, October-December 2004
|Page(s)||277 - 293|
|Published online||15 December 2004|
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; email@example.com.
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.
Key words: Interval analysis / Branch-and-Bound / global optimization / pruning/propagation techniques.
© EDP Sciences, 2004
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.