Dynamic algorithm selection for Pareto optimal set approximation
DOI10.1007/s10898-016-0420-xzbMath1359.90133OpenAlexW2289854391WikidataQ62033272 ScholiaQ62033272MaRDI QIDQ506461
Ingrida Steponavičė, Rob Hyndman, Laura Villanova, Kate A. Smith-Miles
Publication date: 1 February 2017
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-016-0420-x
classificationfeaturesmultiobjective optimizationmachine learningalgorithm selectionexpensive black-box functionhypervolume metric
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Implementing the Nelder-Mead simplex algorithm with adaptive parameters
- Survey of multi-objective optimization methods for engineering
- Dynamic algorithm selection for Pareto optimal set approximation
- Efficient global optimization of expensive black-box functions
- Nonlinear multiobjective optimization
- A multiobjective optimization based framework to balance the global exploration and local exploitation in expensive optimization
- Effect of dimensionality on the Nelder–Mead simplex method
- Adaptive Constraint Satisfaction: The Quickest First Principle
- Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
- A Simplex Method for Function Minimization
- Global optimization
- Random forests
This page was built for publication: Dynamic algorithm selection for Pareto optimal set approximation
