Stochastic convergence of random search methods to fixed size Pareto front approximations

DOI10.1016/J.EJOR.2011.03.039MaRDI QIDQ545118zbMATH OpenOpenAlexFDO

Authors Rico Zenklusen, Marco Laumanns

Publication date 22 June 2011

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2011.03.039

zbMATH Keywords

metaheuristicsmultiple criteria analysissearch theory

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Convergence of stochastic search algorithms to finite size Pareto set approximations
• scientific article; zbMATH DE number 1911364
• Archiving strategies for evolutionary multi-objective optimization algorithms
• Approximating Pareto-optimal sets using diversity strategies in evolutionary multi-objective optimization
• Approximating the Pareto front of multi-criteria optimization problems

Cites work

• scientific article; zbMATH DE number 4055390 (Why is no real title available?)
• scientific article; zbMATH DE number 3694968 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 2102226 (Why is no real title available?)
• A (slightly) faster algorithm for klee's measure problem
• A multiobjective evolutionary algorithm for approximating the efficient set
• An approximation method for the efficiency set of multiobjective programming problems
• Approximately dominating representatives
• Approximating multiobjective knapsack problems
• Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
• Approximating the volume of unions and intersections of high-dimensional geometric objects
• Convergence of stochastic search algorithms to finite size Pareto set approximations
• Evolutionary multi-criterion optimization. 6th international conference, EMO 2011, Ouro Preto, Brazil, April 5--8, 2011. Proceedings
• Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
• On several concepts for \(\varepsilon\)-efficiency
• On the convergence of multiobjective evolutionary algorithms
• SMS-EMOA: multiobjective selection based on dominated hypervolume
• Small approximate Pareto sets for biobjective shortest paths and other problems
• The space complexity of approximating the frequency moments
• Tight bounds for the approximation ratio of the hypervolume indicator
• \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows

Cited in

(8)

• Non-dominated sorting on performance indicators for evolutionary many-objective optimization
• Minimizing the area of a Pareto confidence region
• Convergence of stochastic search algorithms to finite size Pareto set approximations
• Linear Convergence of Comparison-based Step-size Adaptive Randomized Search via Stability of Markov Chains
• Bi-goal evolution for many-objective optimization problems
• Anytime Pareto local search
• Covers and approximations in multiobjective optimization
• On the estimation of Pareto fronts from the point of view of copula theory

Describes a project that uses

Uses Software

• SMS-EMOA

This page was built for publication: Stochastic convergence of random search methods to fixed size Pareto front approximations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q545118)