Direct search versus simulated annealing on two high dimensional problems
David R. Easterling, Layne T. Watson, Michael L. Madigan · IEEE International Conference on High Performance Computing, Data, and Analytics · 2011
Two global optimization problems with high dimensionality and many local minima are investigated with two different optimization algorithms: DIRECT and simulated annealing. The problems include a difficult biomechanics problem with a great deal of experimental noise and a deterministic integer programming problem with a known global minimum.