Saved in:
Bibliographic Details
Main Authors: Ahmad, Maaz, Karimi, Iftekhar A.
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2601.07442
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866918283756699648
author Ahmad, Maaz
Karimi, Iftekhar A.
author_facet Ahmad, Maaz
Karimi, Iftekhar A.
contents Global optimization of large-scale, complex systems such as multi-physics black-box simulations and real-world industrial systems is important but challenging. This work presents a novel Surrogate-Based Optimization framework based on Clustering, SBOC for global optimization of such systems, which can be used with any surrogate modeling technique. At each iteration, it uses a single surrogate model for the entire domain, employs k-means clustering to identify unexplored domain, and exploits a local region around the surrogate optimum to potentially add three new sample points in the domain. SBOC has been tested against sixteen promising benchmarking algorithms using 52 analytical test functions of varying input dimensionalities and shape profiles. It successfully identified a global minimum for most test functions with substantially lower computational effort than other algorithms. It worked especially well on test functions with four or more input variables. It was also among the top six algorithms in approaching a global minimum closely. Overall, SBOC is a robust, reliable, and efficient algorithm for global optimization of box-constrained systems.
format Preprint
id arxiv_https___arxiv_org_abs_2601_07442
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Surrogate-based Optimization via Clustering for Box-Constrained Problems
Ahmad, Maaz
Karimi, Iftekhar A.
Machine Learning
Optimization and Control
Global optimization of large-scale, complex systems such as multi-physics black-box simulations and real-world industrial systems is important but challenging. This work presents a novel Surrogate-Based Optimization framework based on Clustering, SBOC for global optimization of such systems, which can be used with any surrogate modeling technique. At each iteration, it uses a single surrogate model for the entire domain, employs k-means clustering to identify unexplored domain, and exploits a local region around the surrogate optimum to potentially add three new sample points in the domain. SBOC has been tested against sixteen promising benchmarking algorithms using 52 analytical test functions of varying input dimensionalities and shape profiles. It successfully identified a global minimum for most test functions with substantially lower computational effort than other algorithms. It worked especially well on test functions with four or more input variables. It was also among the top six algorithms in approaching a global minimum closely. Overall, SBOC is a robust, reliable, and efficient algorithm for global optimization of box-constrained systems.
title Surrogate-based Optimization via Clustering for Box-Constrained Problems
topic Machine Learning
Optimization and Control
url https://arxiv.org/abs/2601.07442