๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Convergence of adaptive algorithms of random search

โœ Scribed by G. S. Tarasenko

Publisher
Springer US
Year
1978
Tongue
English
Weight
329 KB
Volume
13
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Exponential convergence of products of r
Exponential convergence of products of random matrices: Application to adaptive algorithms
โœ George V. Moustakides ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 164 KB ๐Ÿ‘ 1 views

We introduce a novel methodology for analysing well known classes of adaptive algorithms. Combining recent developments concerning geometric ergodicity of stationary Markov processes and long existing results from the theory of Perturbations of Linear Operators we first study the behaviour and conve

Computer-aided optimal design via modifi
Computer-aided optimal design via modified adaptive random-search algorithm
โœ H. Zarefar; S.N. Muthukrishnan ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 715 KB

## A modified adaptive random-search algorithm for the design of helical gears has been developed. The proposed methodology allows for the implementation of nonlinear design functions and constraints without the need for linearization. In addition, the technique has the capability of starting from e

Analysis and parameter selection for an
Analysis and parameter selection for an adaptive random search algorithm
โœ Rajeeva Kumar; Pierre T. Kabamba; David C. Hyland ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 160 KB

This paper presents an analysis of an adaptive random search (ARS) algorithm, a global minimization method. A probability model is introduced to characterize the statistical properties of the number of iterations required to find an acceptable solution. Moreover, based on this probability model, a n