\texttt{GLISp-r}: a preference-based optimization algorithm with convergence guarantees
type: Item
instance of: scholarly article
title: \texttt{GLISp-r}: a preference-based optimization algorithm with convergence guarantees
arXiv ID: 2202.01125
author: Davide Previtali
author: Mirko Mazzoleni
author: Antonio Ferramosca
author: Fabio Previdi
published in: Computational Optimization and Applications
publication date: 2023-08-03T00:00:00Z
full work available at URL: https://arxiv.org/abs/2202.01125
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 91B16
zbMATH DE Number: 7722203
zbMATH Keywords: global optimization
zbMATH Keywords: preference-based optimization
zbMATH Keywords: surrogate-based methods
zbMATH Keywords: active preference learning
zbMATH Keywords: utility theory
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W4376273190
cites work: Derivative-Free and Blackbox Optimization
cites work: Global optimization via inverse distance weighting and radial basis functions
cites work: Global optimization based on active preference learning with radial basis functions
cites work: A unified framework for closed-form nonparametric regression, classification, preference and mixed problems with skew Gaussian processes
cites work: Q5483032
cites work: Q5588318
cites work: Q3446085
cites work: A Primer on Radial Basis Functions with Applications to the Geosciences
cites work: Preference Learning and Ranking by Pairwise Comparison
cites work: Cases for the nugget in modeling computer experiments
cites work: A radial basis function method for global optimization
cites work: Data mining. Concepts and techniques
cites work: A literature survey of benchmark functions for global optimisation problems
cites work: A taxonomy of global optimization methods based on response surfaces
cites work: Optimizing radial basis functions by d.c. programming and its use in direct search for global derivative-free optimization
cites work: Least squares quantization in PCM
cites work: A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output from a Computer Code
cites work: Numerical Optimization
cites work: Constrained global optimization of expensive black box functions using radial basis functions
cites work: A stochastic radial basis function method for the global optimization of expensive functions
cites work: Global optimization
cites work: A particle swarm pattern search method for bound constrained global optimization
cites work: PSwarm: a hybrid solver for linearly constrained global derivative-free optimization
cites work: Surrogate‐based methods for black‐box optimization
cites work: Q3394879
DOI: 10.1007/S10589-023-00491-2
description: scientific article; zbMATH DE number 7722203