Log-linear convergence and divergence of the scale-invariant \((1+1)\)-ES in noisy environments (Q633840): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A comparison of evolution strategies with other direct search methods in the presence of noise / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449264 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global convergence for evolution strategies in spherical problems: Some simple proofs and difficulties. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence results for the (1,\(\lambda\))-SA-ES using the theory of \(\varphi\)-irreducible Markov chains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic analysis of a basic evolutionary algorithm for continuous optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Genetic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2751593 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4370804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Foundations of Genetic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov chains and stochastic stability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability with Martingales / rank
 
Normal rank

Latest revision as of 22:49, 3 July 2024

scientific article
Language Label Description Also known as
English
Log-linear convergence and divergence of the scale-invariant \((1+1)\)-ES in noisy environments
scientific article

    Statements

    Log-linear convergence and divergence of the scale-invariant \((1+1)\)-ES in noisy environments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    30 March 2011
    0 references
    This paper investigates a certain class of noisy problems which use the so-called multiplicative noise, where the noiseless objective function is perturbed by the multiplication with a noise term. The objective of this paper is to address the question of how the properties of the noise distribution relate to convergence or divergence of the \((1+1)\)-ES (evolution strategies). The authors provide a mathematical analysis of the convergence of a \((1+1)\)-ES on unimodal spherical objective functions in the presence of multiplicative noise, prove that for a positive expected value of the noisy objective function, convergence or divergence happens depending on the infimum of the support of the noise. Moreover, they investigate convergence rates and show that log-linear convergence is preserved in presence of noise. These results are an extension of the results presented in [\textit{D. V. Arnold} and \textit{H.-G. Beyer}, Comput. Optim. Appl. 24, No. 1, 135--159 (2003; Zbl 1035.90110)].
    0 references
    numerical optimization
    0 references
    noisy optimization
    0 references
    stochastic optimization algorithms
    0 references
    evolution strategies
    0 references
    convergence
    0 references
    convergence rates
    0 references
    Markov chains
    0 references
    Borel-Cantelli lemma
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references