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.
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.
In this paper, we show how optimization methods can be used efficiently to determine the parameters of an oscillatory model of handwriting. Because these methods have to be used in real-time applications, this involves that the optimization problems must be rapidely solved. Hence, we developed an original heuristic algorithm, named FHA. This code was validated by comparing it (accuracy/CPU-times) with a multistart method based on Trust Region Reflective algorithm.
Download Results (CSV)