Convergence Rates of (1+1) Evolutionary Multiobjective Optimization Algorithms-Reference-Cited by-同舟云学术

Convergence Rates of (1+1) Evolutionary Multiobjective Optimization Algorithms

Published:2010 Issue: Volume: Page:597-606
ISSN:
Container-title:Parallel Problem Solving from Nature, PPSN XI
language:
Short-container-title:

Author:

Beume Nicola,Laumanns Marco,Rudolph Günter

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-15844-5_60

Reference11 articles.

1. Rudolph, G.: On a multi–objective evolutionary algorithm and its convergence to the Pareto set. In: Proceedings of the 1998 IEEE International Conference on Evolutionary Computation, pp. 511–516. IEEE Press, Piscataway (1998)

2. Hanne, T.: On the convergence of multiobjective evolutionary algorithms. European Journal of Operational Research 117(3), 553–564 (1999)

3. Teytaud, O.: On the hardness of offline multi-objective optimization. Evolutionary Computation 15(4), 475–491 (2007)

4. Jägersküpper, J.: How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms. Theoretical Computer Science 361(1), 38–56 (2006)

5. Jägersküpper, J.: Algorithmic analysis of a basic evolutionary algorithm for continuous optimization. Theoretical Computer Science 379(3), 329–347 (2007)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Hypervolume in biobjective optimization cannot converge faster than Ω(1/ p );Proceedings of the Genetic and Evolutionary Computation Conference;2021-06-26

2. Understanding measure-driven algorithms solving irreversibly ill-conditioned problems;Natural Computing;2021-02-20

3. Evolutionary Multi-Agent Systems;Studies in Computational Intelligence;2017

4. Toward Step-Size Adaptation in Evolutionary Multiobjective Optimization;Lecture Notes in Computer Science;2017

5. On the Computational Cost and Complexity of Stochastic Inverse Solvers;Computer Science;2016