Dynamic algorithm selection for Pareto optimal set approximation

DOI10.1007/S10898-016-0420-XzbMATH Open1359.90133OpenAlexW2289854391WikidataQ62033272 ScholiaQ62033272MaRDI QIDQ506461FDOQ506461

Kate A. Smith-Miles, Ingrida Steponavičė, Rob J. Hyndman, Laura Villanova

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

zbMATH Keywords

classificationmachine learningfeaturesmultiobjective optimizationalgorithm selectionexpensive black-box functionhypervolume metric

Mathematics Subject Classification ID

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

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Efficient global optimization of expensive black-box functions
• Convergence Properties of the Nelder--Mead Simplex Method in Low Dimensions
• Random forests
• A Simplex Method for Function Minimization
• Nonlinear multiobjective optimization
• Multi-objective optimization using evolutionary algorithms
• Survey of multi-objective optimization methods for engineering
• Implementing the Nelder-Mead simplex algorithm with adaptive parameters
• Global optimization
• Effect of dimensionality on the Nelder–Mead simplex method
• A multiobjective optimization based framework to balance the global exploration and local exploitation in expensive optimization
• Adaptive Constraint Satisfaction: The Quickest First Principle
• Dynamic algorithm selection for Pareto optimal set approximation

Cited In (3)

• A PAC Approach to Application-Specific Algorithm Selection
• Convergence of stochastic search algorithms to finite size Pareto set approximations
• Dynamic algorithm selection for Pareto optimal set approximation

Uses Software

• fminsearch
• EGO
• jMetal
• ParEGO
• HypE
• weightedHypervolume

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Convergence of stochastic search algorithms to finite size Pareto set approximations 👍 👎
• Approximating the Pareto optimal set using a reduced set of objective functions 👍 👎
• Approximate Pareto sets of minimal size for multi-objective optimization problems 👍 👎
• Pareto optimization for subset selection with dynamic cost constraints 👍 👎
• On the approximation of a pareto set 👍 👎
• Approximation of a set of Pareto-optimal solutions 👍 👎
• An algorithm for approximating the Pareto set of the multiobjective set covering problem 👍 👎

This page was built for publication: Dynamic algorithm selection for Pareto optimal set approximation

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