The Directed Search Method for Pareto Front Approximations with Maximum Dominated Hypervolume
DOI10.1007/978-3-319-01128-8_13zbMATH Open1322.90090OpenAlexW1003214819MaRDI QIDQ2950786FDOQ2950786
Authors: Victor Adrián Sosa Hernández, Oliver Schütze, Günter Rudolph, Heike Trautmann 
Publication date: 9 October 2015
Published in: EVOLVE - A Bridge between Probability, Set Oriented Numerics, and Evolutionary Computation IV (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-01128-8_13
Recommendations
- The Directed Search Method for Unconstrained Parameter Dependent Multi-objective Optimization Problems
- Approximating the Pareto front of multi-criteria optimization problems
- Pareto front approximation through a multi-objective augmented Lagrangian method
- A numerical method for constructing the Pareto front of multi-objective optimization problems
- Worst-case complexity bounds of directional direct-search methods for multiobjective optimization
- A new approach to approximate the bounded Pareto front
- A unified approach for characterizing Pareto optimal solutions of multiobjective optimization problems: The hyperplane method
- Two efficient algorithms for constructing almost even approximations of the Pareto front in multi-objective optimization problems
local searchmulti-objective optimizationevolutionary computationdirected searchdominated hypervolume
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Cites Work
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- Multi-objective optimization using evolutionary algorithms
- Nonlinear multiobjective optimization. A generalized homotopy approach
- Title not available (Why is that?)
- On gradient-based local search to hybridize multi-objective evolutionary algorithms
- Stochastic method for the solution of unconstrained vector optimization problems
Cited In (7)
- Hypervolume maximization via set based Newton's method
- Bi-objective hypervolume-based Pareto optimization
- Linear programming-based directed local search for expensive multi-objective optimization problems: application to drinking water production plants
- Optimization using an evolutionary hyperplane guided approach
- A memetic variant of R-NSGA-II for reference point problems
- The directed search method for multi-objective memetic algorithms
- Hypervolume Subset Selection for Triangular and Inverted Triangular Pareto Fronts of Three-Objective Problems
Uses Software
This page was built for publication: The Directed Search Method for Pareto Front Approximations with Maximum Dominated Hypervolume
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2950786)
