By Topic

Analyses of the genetic algorithms in the continuous space

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xiaofeng Qi ; Dept. of Electr. & Syst. Eng., Connecticut Univ., Storrs, CT, USA ; Palmieri, F.

General properties of a class of genetic algorithms in the continuous space are analyzed. Near-convergence behavior is examined under the assumption of a quadratic approximation of the cost function around the optimal point. It is proved that near convergence, the mean of the population of solutions follows a modified Newton's step. The convergence rates for both the mean and the covariance matrix of the random solution vector are determined by the products of the mutation noise power and the eigenvalues of the Hessian of the cost function at the global minimum

Published in:

Neural Networks, 1992. IJCNN., International Joint Conference on  (Volume:4 )

Date of Conference:

7-11 Jun 1992