Although DIRECT global optimization algorithm quickly gets close to the basin of the
optimum, it often takes much longer to refine the solution to a high degree of accuracy. This …

In this paper we consider bound constrained global optimization problems where first-order
derivatives of the objective function can be neither computed nor approximated explicitly …

The paper is concerned with black-box nonlinear constrained multi-objective optimization
problems. Our interest is the definition of a multi-objective deterministic partition-based …

The popular performance profiles and data profiles for benchmarking deterministic
optimization algorithms are extended to benchmark stochastic algorithms for global …

It has been pointed out by Jones DR that the DIRECT global optimization algorithm can
quickly get close to the basin of the optimum but takes longer to achieve a high degree of …

Population-based optimization algorithms, such as genetic algorithm and particle swarm
optimization, have become a class of important algorithms for solving global optimization …

Numerical comparison is often key to verifying the performance of optimization algorithms,
especially, global optimization algorithms. However, studies have so far neglected issues …

This paper presents a DIRECT-type method that uses a filter methodology to assure
convergence to a feasible and optimal solution of nonsmooth and nonconvex constrained …

DIRECT is derivative-free global-search algorithm has been found to perform robustly
across a wide variety of low-dimensional test problems. The reason DIRECT's robustness is …

Improving the efficiency of solving complex optimization problems is the focus of intelligent
algorithm research in recent years. Complex optimization problems have the characteristics …