The discrete gradient evolutionary strategy method for global optimization
Hussein A. Abbass, Adil Bagirov, Jiapu Zhang · 2003
Global optimization problems continue to be a challenge in computational mathematics. The field is progressing in two streams: deterministic and heuristic approaches. In this paper, we present a hybrid method that uses the discrete gradient method, which is a derivative free local search method, and evolutionary strategies. We show that the hybridization of the two methods is better than each of them in isolation.