.png){kind=icon}
Return
A practical DIRECT-type algorithm for medium-scale black-box global optimization
.png){kind=icon}
PRE
AI
DOI：10.1016/j.asoc.2026.116392.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The DIRECT algorithm is a deterministic global optimization method known for its versatility and balanced exploration-exploitation strategy. However, DIRECT-type algorithms are primarily effective for low-dimensional problems and often exhibit slow convergence as dimensionality increases, limiting their applicability to more complex optimization tasks. To address this limitation, this paper introduces X-DTC-GL, a novel DIRECT-type algorithm that incorporates dynamic partitioning and hybridization techniques. The dynamic partitioning approach adaptively refines the search space based on local one-dimensional surrogate models, enabling rapid subdivision of promising hyper-rectangles. The hybridization strategy selectively employs a hill-climbing method to exploit promising regions identified by the surrogate models.
Journal
IF:
6.6
Papers:
1.4W
Citations:
4.8W
Organization
No organization information available
Cited Papers
No cited papers available