DocumentCode
2998865
Title
The discrete gradient evolutionary strategy method for global optimization
Author
Abbass, Hussein A. ; Bagirov, A.M. ; Zhang, J.
Author_Institution
Sch. of Inf. Technol. & Electr. Eng., New South Wales Univ., Canberra, ACT, Australia
Volume
1
fYear
2003
fDate
8-12 Dec. 2003
Firstpage
435
Abstract
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.
Keywords
evolutionary computation; gradient methods; search problems; computational mathematics; deterministic approaches; discrete gradient evolutionary strategy; discrete gradient method; free local search; global optimization; heuristic approaches; hybrid method; method hybridization; Australia; Euclidean distance; Gradient methods; Informatics; Information technology; Mathematics; Optimization methods; Polynomials; Robots; Search methods;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2003. CEC '03. The 2003 Congress on
Print_ISBN
0-7803-7804-0
Type
conf
DOI
10.1109/CEC.2003.1299608
Filename
1299608
Link To Document