We propose a new version of potentially optimal intervals for the DIRECT algorithm. A two-point based sampling method is presented. The method starts from a distinguished point (the peak point) by forming an initial t...
详细信息
We propose a new version of potentially optimal intervals for the DIRECT algorithm. A two-point based sampling method is presented. The method starts from a distinguished point (the peak point) by forming an initial triangle. The idea is to sample the midpoint of a specific interval: the basis of the resulting triangle. This specific interval is obtained by translating the initial interval towards the lowest function value: min {f(c(i)),f(c(i+1))} and then overcoming the disadvantage if the global minimum lies at the boundaries. two-dimensional version of our subdivision and samplingmethod is also discussed. (c) 2005 Published by Elsevier Inc.
暂无评论