Adaptive dipole-like parameter calibration of complex black-box continuous processes

Avi Herbon (), Mauro Gaggero, Eugene Khmelnitsky and Marcello Sanguineti
Additional contact information
Avi Herbon: Bar-Ilan University
Mauro Gaggero: National Research Council of Italy
Eugene Khmelnitsky: Tel Aviv University
Marcello Sanguineti: University of Genoa

Computational Optimization and Applications, 2025, vol. 91, issue 3, No 9, 1309-1338

Abstract: Abstract Large-scale systems such as flexible manufacturing, chemical production facilities, and traffic networks aim to maximize measures related to profit, health and safety, throughput, and service level. Due to the complexity of such systems, the mechanism that connects the input parameters to performance outputs is often unavailable, and optimization methods based on convexity or even differentiability of the objective function may not be applicable. Since these systems are characterized by heavy costs per unit time, the system manager has to resort to black-box approaches for optimization, where a set of parameters is tuned in order to maximize an accumulated performance measure of the process. In this paper, a novel mechanism is proposed for real-time calibration of parameters in continuous search spaces. The developed algorithm seeks the global optimum by means of solution exploitation, and adapts dynamically according to environmental changes. The solution method builds a sequence of random pairs of trials, called “dipoles”, which are used to adapt online the probability density function of the unknown parameters. The proposed method is characterized by the following advantages: (1) it does not depend on subjective coefficients setting; (2) solution exploitation starts from the first iteration; (3) the algorithm is effective also for systems with high dimensionality; (4) since sampling only involves two trials, exploitation is based on recent data rather than on data that extends far back in time. Several illustrative numerical examples are provided to show the applicability and efficiency of the proposed method.

Keywords: Black-box optimization; Online parameter calibration; Random sampling; Global optimization (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10589-025-00677-w Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:91:y:2025:i:3:d:10.1007_s10589-025-00677-w

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-025-00677-w

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().