31 December 2021 in IEEE Transactions on Control Systems Technology
Preference-based global optimization algorithms minimize an unknown objective function only based on whether the function is better, worse, or similar for given pairs of candidate optimization vectors. Such optimization problems arise in many real-life examples, such as finding the optimal calibration of the parameters of control law. The calibrator can judge whether a particular combination of parameters leads to a better, worse, or similar closed-loop performance. Often, the search for the optimal parameters is also subject to unknown constraints. For example, the vector of calibration parameters must not lead to closed-loop instability. This article extends an active preference learning algorithm introduced recently to handle unknown constraints. The proposed method, called C-GLISp, looks for an optimizer of the problem only based on preferences expressed on pairs of candidate vectors and on whether a given vector is reported feasible and/or satisfactory. C-GLISp learns a surrogate of the underlying objective function based on the expressed preferences and a surrogate of the probability that a sample is feasible and/or satisfactory based on whether each of the tested vectors was judged as such. The surrogate functions are used iteratively to propose a new candidate vector to test and judge. Numerical benchmarks and a semiautomated control calibration task demonstrate the effectiveness of C-GLISp, showing that it can reach near-optimal solutions within a small number of iterations.
28 October 2024 in Digital Discovery
We present a surrogate-based optimization technique for experimental design that handles discrete and mixed-variable constraints. Using MILP reformulation at the acquisition step, feasible samples can be proposed to facilitate experimental planning.
23 February 2026 in Digital Discovery
XEXenophon Evangelopoulos
Reasoning models (LLMs) were used as optimisers for a 10-D chemistry problem and a 7-D physics simulation. The best performance was achieved using iterative closed-loop reasoning with a batch size of one.
25 April 2023 in IEEE Control Systems Letters
Global optimization problems over a multi-agent network is addressed in the paper. The objective function, possibly subject to global constraints, is not analytically known, but can only be evaluated at any query point. It is assumed that the cost function to be minimized is the sum of local cost functions, each of which can be evaluated by the associated agent only. The proposed algorithm asks the agents at each iteration first to fit a surrogate function to local samples, and subsequently to minimize, in a cooperative fashion, an acquisition function, in order to generate new samples to query. In this paper we build the acquisition function as the sum of the local surrogates, in order to exploit the knowledge of these estimates, plus another term that drives the minimization procedure towards unexplored regions of the feasible space, where better values of the objective function might be present. The proposed scheme is a distributed version of the existing algorithm GLIS (GLobal optimization based on Inverse distance weighting and Surrogate radial basis functions), and share with it the same low-complexity and competitiveness, with respect to, for instance, Bayesian Optimization (BO). Experimental results on benchmark problems and on distributed calibration of Model Predictive Controllers (MPC) for autonomous driving applications demonstrate the effectiveness of the proposed method.
8 January 2025 in Journal of Optimization Theory and Applications