Cart (Loading....) | Create Account
Close category search window

On the Convergence of Statistical Search

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

1 Author(s)
Devroye, Luc P. ; Department of Electrical Engineering, Osaka University, Suita-shi, Japan.; Department of Electrical Engineering, University of Texas, Austin, TX. 78712.

The convergence of statistical (random) search for the minimization of an arbitrary multimodal functional Q(w) is dealt with by using the theorems of convergence of random processes of Braverman and Rozonoer. It is shown that random search can be regarded as a gradient algorithm in the Q-domain. Using this gradient to define the minimum of the functional, the convergence to this minimum is discussed at length. The theorems proved in this paper apply as well to discrete as to continuous optimization problems and as such, the developed technique is competitive with stochastic automata with a variable structure. The optimality of the scheme follows from the convergence in probability of the average performance to the minimum. The freedom in the organization of the search within the boundaries outlined by the conditions of convergence is emphasized. Finally, it is pointed out how various mixed random search and hierarchical search systems fall into the domain of application of the theorems.

Published in:

Systems, Man and Cybernetics, IEEE Transactions on  (Volume:SMC-6 ,  Issue: 1 )

Date of Publication:

Jan. 1976

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.