Stochastic convergence of random search methods to fixed size Pareto front approximations
From MaRDI portal
Publication:545118
DOI10.1016/J.EJOR.2011.03.039zbMATH Open1222.90054OpenAlexW2015549289MaRDI QIDQ545118FDOQ545118
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
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
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- The space complexity of approximating the frequency moments
- Title not available (Why is that?)
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Title not available (Why is that?)
- Evolutionary multi-criterion optimization. 6th international conference, EMO 2011, Ouro Preto, Brazil, April 5--8, 2011. Proceedings
- Tight bounds for the approximation ratio of the hypervolume indicator
- Small approximate Pareto sets for biobjective shortest paths and other 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
- On the convergence of multiobjective evolutionary algorithms
- Convergence of stochastic search algorithms to finite size Pareto set approximations
- Approximating multiobjective knapsack problems
- \(\epsilon\)-optimality for bicriteria programs and its application to minimum cost flows
- A (slightly) faster algorithm for klee's measure problem
- Approximately dominating representatives
- Title not available (Why is that?)
- An approximation method for the efficiency set of multiobjective programming problems
- A multiobjective evolutionary algorithm for approximating the efficient set
- On several concepts for \(\varepsilon\)-efficiency
- Title not available (Why is that?)
Cited In (8)
- Non-dominated sorting on performance indicators for evolutionary many-objective optimization
- Linear Convergence of Comparison-based Step-size Adaptive Randomized Search via Stability of Markov Chains
- On the estimation of Pareto fronts from the point of view of copula theory
- Anytime Pareto local search
- Minimizing the area of a Pareto confidence region
- Bi-goal evolution for many-objective optimization problems
- Convergence of stochastic search algorithms to finite size Pareto set approximations
- Covers and approximations in multiobjective optimization
Uses Software
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)
