A two-stage pareto selection strategy with compromise programming for the DIRECT algorithm
Numerical results show that the proposed algorithm is competitive with, and generally outperforms, several existing DIRECT-type algorithms, and the results obtained on the ten GKLS test classes further support the effectiveness of the proposed algorithm across all considered problem dimensions.