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 its lack of algorithmic parameters tha...
详细信息
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 its lack of algorithmic parameters that need be "tuned" to make the algorithm perform well. In particular, there is no parameter that determines the relative emphasis on global versus local search. Unfortunately, the same algorithmic features that enable DIRECT to perform so robustly have a negative side effect. In particular, DIRECT is usually quick to get close to the global minimum, but very slow to refine the solution to high accuracy. This is what we call DIRECT's "eventually inefficient behavior." In this paper, we outline two root causes for this undesirable behavior and propose modifications to eliminate it. The paper builds upon our previously published "mrdirect" algorithm, which we can now show only addressed the first root cause of the "eventually inefficient behavior." The key contribution of the current paper is a further enhancement that allows mrdirect to address the second root cause as well. To demonstrate the effectiveness of the enhanced mrdirect, we have identified a set of test functions that highlight different situations in which DIRECT has convergence issues. Extensive numerical work with this test suite demonstrates that the enhanced version of mrdirect does indeed improve the convergence rate of DIRECT.
暂无评论