A Locally-Biased form of the DIRECT Algorithm
By Joerg M. Gablonsky, C. T. Kelley. Journal of Global Optimization, 2001
357 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computer Networks and Communications
View Paper: https://www.semanticscholar.org/paper/ac115500beed46cf05cfa73bf4bab310c8d3190a
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Daniel E. Finkel
- Arnold Neumaier
- Victor Picheny
- David Ginsbourger
- Yann Richet
- Gregory Caplin
- C. T. Kelley
- G. Roe
In Computer Networks and Communications
- Daniel E. Finkel
- Arnold Neumaier
- Yann Richet
- Victor Picheny
- David Ginsbourger
- Gregory Caplin
- C. T. Kelley
Citations in the corpus
- Linear Combination of Distance Measures for Surrogate Models in Genetic Programming (2018, neutral): “Lower level optimization of the constants: To optimize the lower level ob-jective function, we decided to use the locally biased version of the the Dividing RECTangles (DIRECT) algorithm [20] for a global search.”
- Convergence analysis of the direct algorithm (2004, methodology): “In [13], a modified version of DIRECT is derived which measures hyperrectangles by their longest side.”
- Direct optimization algorithm user guide (2003, methodology): “Others have modi ed DIRECT to use di erent measures for the size of the rectangles [6].”
- Quantile-Based Optimization of Noisy Computer Experiments With Tunable Precision (2013, methodology): “The strategy proposed in Section 6.2 is compared to the AEI method as proposed in Huang et al. (2006) for the optimization of homogeneously noisy experiments, which has already been found to be very competitive compared to other local or global optimizers such as the revised simplex search (Humphrey”
- Complete search in continuous global optimization and constraint satisfaction (2004, methodology): “(ii) GlobSol: Global Solver (in Fortran 90) Kearfott (1996b, 2003) www.mscs.mu.edu/∼globsol/ Branch and bound code for global optimization with general factorable constraints, with rigorously guaranteed results (even round-off is accounted for correctly).”
- Global Optimization of Stochastic Black-Box Systems via Sequential Kriging Meta-Models (2006, background): “In summary, we feel that the augmented EI criterion in equation (12) is consistent with our intuition about the “usefulness” of the additional sample at a particular location.”