A new method for global optimization is being developed. It is based on the same principles as the well established interval branch-and-bound method but without so severe limitations on the objective function. It only needs to be a smooth function (i.e. twice differentiable), calculated by a "black box" procedure. Stochastic methods, like simulated annealing and genetic algorithms also are used as sources of inspiration. Parallel processing is appplied.
|Effective start/end date||01/08/1990 → …|