Imagen de Portada

A Bi-Objective Optimization Based Acquisition Strategy for Batch Bayesian Global Optimization

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Carciaghi, Francesco, Magistri, Simone, Mansueto, Pierluigi, Schoen, Fabio
Formato:	Preprint
Publicado:	2024
Materias:	Optimization and Control 62C10, 90C29, 90C30
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A Nonmonotone Front Descent Method for Bound-Constrained Multi-Objective Optimization
por: Mansueto, Pierluigi
Publicado: (2025)

Cardinality-Constrained Multi-Objective Optimization: Novel Optimality Conditions and Algorithms
por: Lapucci, Matteo, et al.
Publicado: (2023)

Effective Front-Descent Algorithms with Convergence Guarantees
por: Lapucci, Matteo, et al.
Publicado: (2024)

Memetic Differential Evolution Methods for Semi-Supervised Clustering
por: Mansueto, Pierluigi, et al.
Publicado: (2024)

Bi-Objective Optimization over the Efficient Set of Multi-Objective Integer Quadratic Problem
por: Bencheikh, Ali, et al.
Publicado: (2024)

Combining Gradient Information and Primitive Directions for High-Performance Mixed-Integer Optimization
por: Lapucci, Matteo, et al.
Publicado: (2024)

A heavy-ball type curve search method for smooth convexly constrained optimization
por: Donnini, Federica, et al.
Publicado: (2026)

A Subspace Minimization Barzilai-Borwein Method for Multiobjective Optimization Problems
por: Chen, Jian, et al.
Publicado: (2024)

Scaled Proximal Gradient Methods for Multiobjective Optimization: Improved Linear Convergence and Nesterov's Acceleration
por: Chen, Jian, et al.
Publicado: (2024)

First-order Methods for Unconstrained Vector Optimization Problems: A Unified Majorization-Minimization Perspective
por: Chen, Jian, et al.
Publicado: (2024)

Projection-based curve pattern search for black-box optimization over smooth convex sets
por: Jia, Xiaoxi, et al.
Publicado: (2025)

On the Computation of the Efficient Frontier in Advanced Sparse Portfolio Optimization
por: Annunziata, Arturo, et al.
Publicado: (2025)

Objective-Function Free Multi-Objective Optimization: Rate of Convergence and Performance of an Adagrad-like algorithm
por: De Santis, Marianna, et al.
Publicado: (2026)

Measure This, Not That: Optimizing the Cost and Model-Based Information Content of Measurements
por: Wang, Jialu, et al.
Publicado: (2024)

Generalized Reduced Jacobian Method
por: Maghri, M. El, et al.
Publicado: (2025)

Worst-case complexity analysis of derivative-free methods for multi-objective optimization
por: Liuzzi, Giampaolo, et al.
Publicado: (2025)

Sublinear Scalarizations for Proper and Approximate Proper Efficient Points in Nonconvex Vector Optimization
por: García-Castaño, Fernando, et al.
Publicado: (2024)

Efficient globalization of heavy-ball type methods for unconstrained optimization based on curve searches
por: Donnini, Federica, et al.
Publicado: (2025)

Existence and Density Theorems of Henig Global Proper Efficient Points
por: García-Castaño, Fernando, et al.
Publicado: (2024)

Binno: A 1st-order method for Bi-level Nonconvex Nonsmooth Optimization for Matrix Factorizations
por: Selicato, Laura, et al.
Publicado: (2025)

An accelerated primal-dual flow for linearly constrained multiobjective optimization
por: Luo, Hao, et al.
Publicado: (2025)

Low-Rank Multi-Objective Linear Programming
por: Löhne, Andreas, et al.
Publicado: (2025)

The SCIP Optimization Suite 9.0
por: Bolusani, Suresh, et al.
Publicado: (2024)

The SCIP Optimization Suite 10.0
por: Hojny, Christopher, et al.
Publicado: (2025)

Characterization of Highly Robust Solutions in Multi-Objective Programming in Banach Spaces
por: Rahimi, Morteza, et al.
Publicado: (2025)

On the Relationship Between the Value Function and the Efficient Frontier of a Mixed Integer Linear Optimization Problem
por: Fallah, Samira, et al.
Publicado: (2023)

Warm-starting outer approximation for parametrized convex MINLP
por: Tamm, Erik, et al.
Publicado: (2025)

A Decision-Making Method in Polyhedral Convex Set Optimization
por: Löhne, Andreas
Publicado: (2024)

Process-Based Lagrange Multipliers for Nonconvex Set-Valued Optimization
por: García-Castaño, Fernando, et al.
Publicado: (2026)

A New Linear Programming Approach and a New Backtracking Strategy for Multiple-Gradient Descent in Multi-Objective Optimization
por: Della Santa, Francesco
Publicado: (2024)

Finite Representation of Quantile Sets for Multivariate Data via Vector Linear Programming
por: Löhne, Andreas, et al.
Publicado: (2023)

On Computing and Pricing of Adjustable Robust Chemical Process Designs
por: Schwientek, Jan, et al.
Publicado: (2025)

A Unified Zeroth-Order Proximal Newton-Type Framework for Composite Optimization
por: Liu, Zekun, et al.
Publicado: (2026)

Entropic Risk-Averse Generalized Momentum Methods
por: Can, Bugra, et al.
Publicado: (2022)

A Benson-Type Algorithm for Bounded Convex Vector Optimization Problems with Vertex Selection
por: Dörfler, Daniel, et al.
Publicado: (2020)

Global Descent Method for Non-convex Multi-objective Optimization Problems
por: Adhikary, Bikram, et al.
Publicado: (2025)

Low Rank Convex Clustering For Matrix-Valued Observations
por: Lin, Meixia, et al.
Publicado: (2024)

Damage Location in Mechanical Structures by Multi-Objective Pattern Search
por: Günther, Christian, et al.
Publicado: (2024)

Perpertual Coupled Simulated Annealing for Continuous Optimization
por: Gonçalves-e-Silva, Kayo, et al.
Publicado: (2018)

Inference for max-linear Bayesian networks with noise
por: Adams, Mark, et al.
Publicado: (2025)