A two-stage pareto selection strategy with compromise programming for the DIRECT algorithm
A novel DIRECT-type algorithm employing a parameterized Pareto approach is proposed for box-constrained optimization problems. The method features a two-stage Pareto selection process. The first stage focuses on global exploration, using a parameter to identify the smallest significant hyperrectangle, which helps avoid...