Merge of Evolutionary Computation with Gradient Based Method for Optimization Problems

The paper describes an optimization method which combines advantages of both evolutionary computation and gradient based methods. The proposed method follows the general concept of evolutionary computation, but uses an approximated gradient for generating subsequent populations. The gradient is not explicitly computed, but is instead estimated using minimum solutions from neighboring populations. Experimental data shows that the proposed method is not only robust, but is also comparable to gradient methods with respect to speed of convergence.

[1]  Shigeo Abe,et al.  Neural Networks and Fuzzy Systems , 1996, Springer US.

[2]  Jinyu Wen,et al.  Pseudo-gradient based evolutionary programming , 2003 .

[3]  Milos Manic,et al.  Random weights search in compressed neural networks using overdetermined pseudoinverse , 2003, 2003 IEEE International Symposium on Industrial Electronics ( Cat. No.03TH8692).

[4]  Peter Sincak,et al.  Combining Gradient and Evolutionary Approaches to the Artificial Neural Networks Training According to Principles of Support Vector Machines , 2006, The 2006 IEEE International Joint Conference on Neural Network Proceedings.

[5]  Adil M. Bagirov,et al.  The discrete gradient evolutionary strategy method for global optimization , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..

[6]  Milos Manic,et al.  Robust neural network training using partial gradient probing , 2003, IEEE International Conference on Industrial Informatics, 2003. INDIN 2003. Proceedings..

[7]  Xiaolin Hu,et al.  Hybridization of the multi-objective evolutionary algorithms and the gradient-based algorithms , 2003, The 2003 Congress on Evolutionary Computation, 2003. CEC '03..