A bi-objective optimization based acquisition strategy for batch Bayesian global optimization

DOI10.1007/S10589-025-00696-7MaRDI QIDQ6937400zbMATH OpenFDO

Authors Francesco Carciaghi, Simone Magistri, Pierluigi Mansueto, Fabio Schoen

Publication date 27 August 2025

Published in Computational Optimization and Applications (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S10589-025-00696-7

zbMATH Keywords

global optimizationbi-objective optimizationfirst-order informationacquisition functionbatch Bayesian methods

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Bayesian problems; characterization of Bayes procedures (62C10) Nonlinear programming (90C30)

Cites work

• scientific article; zbMATH DE number 3705806 (Why is no real title available?)
• scientific article; zbMATH DE number 3742519 (Why is no real title available?)
• scientific article; zbMATH DE number 3487202 (Why is no real title available?)
• scientific article; zbMATH DE number 7626750 (Why is no real title available?)
• scientific article; zbMATH DE number 7415103 (Why is no real title available?)
• scientific article; zbMATH DE number 6433488 (Why is no real title available?)
• A Heuristic Method for Finding Most Extrema of a Nonlinear Functional
• A limited memory quasi-Newton approach for multi-objective optimization
• A literature survey of benchmark functions for global optimisation problems
• A memetic procedure for global multi-objective optimization
• A method for constrained multiobjective optimization based on SQP techniques
• A multiobjective optimization based framework to balance the global exploration and local exploitation in expensive optimization
• A novel population initialization method for accelerating evolutionary algorithms
• A projected gradient method for vector optimization problems
• A quasi-Newton method with Wolfe line searches for multiobjective optimization
• Algorithm 778: L-BFGS-B
• Algorithm AS 136: A K-Means Clustering Algorithm
• Bayesian optimization
• Benchmarking optimization software with performance profiles.
• Cluster analysis and mathematical programming
• Direct Multisearch for Multiobjective Optimization
• Efficient global optimization of expensive black-box functions
• Evolutionary Multi-Criterion Optimization
• Gaussian processes for machine learning.
• Global optimization
• Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting
• Least squares quantization in PCM
• Newton's method for multiobjective optimization
• On the convergence of steepest descent methods for multiobjective optimization
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• Parallel Bayesian global optimization of expensive functions
• Quantifying uncertainty with ensembles of surrogates for blackbox optimization
• SMAC3: a versatile Bayesian optimization package for hyperparameter optimization
• Some experiments in global optimization
• Steepest descent methods for multicriteria optimization.
• The Greatest of a Finite Set of Random Variables
• The knowledge-gradient algorithm for sequencing experiments in drug discovery
• Widely Convergent Method for Finding Multiple Solutions of Simultaneous Nonlinear Equations

This page was built for publication: A bi-objective optimization based acquisition strategy for batch Bayesian global optimization

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