Constrained multiobjective optimization of expensive black-box functions using a heuristic branch-and-bound approach

DOI10.1007/s10898-023-01336-2OpenAlexW4390505054MaRDI QIDQ6123558

Donald R. Jones, Alberto Lovison

Publication date: 5 April 2024

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-023-01336-2

zbMATH Keywords

DIRECTmultiobjective optimizationdeterministicderivative-freenonlinear constraintsblack-boxLipschitzian optimization

Mathematics Subject Classification ID

Mathematical programming (90Cxx)

Cites Work

• Methods for multi-objective optimization: an analysis
• Multi objective optimization of computationally expensive multi-modal functions with RBF surrogates and multi-rule selection
• Efficient global optimization of expensive black-box functions
• Nonlinear multiobjective optimization
• Lipschitzian optimization without the Lipschitz constant
• On the extension of the \textsc{direct} algorithm to multiple objectives
• A new \texttt{DIRECT-GLh} algorithm for global optimization with hidden constraints
• \texttt{PAINT-SICon}: constructing consistent parametric representations of Pareto sets in nonconvex multiobjective optimization
• Non-convex multi-objective optimization
• An algorithm for finding the absolute extremum of a function
• Branch-and-Bound Methods: A Survey
• A Sequential Method Seeking the Global Maximum of a Function

This page was built for publication: Constrained multiobjective optimization of expensive black-box functions using a heuristic branch-and-bound approach