Abstract
Simplicial subsets are popular in branch-and-bound methods for Global Optimization. Longest Edge Bisection is a convenient way to divide a simplex. When the number of dimensions is greater than two, irregular simplices (not all edges have the same length) may appear with more than one longest edge. In these cases, the first longest edge is usually selected. We study the impact of other selection rule of the longest edge to be bisected next on the development of a branch-and-bound algorithm to solve multidimensional Lipschitz Global Optimization instances. Experiments show a significant reduction in the number of evaluated simplices for most of the test problems. © 2014 Springer International Publishing.
Author supplied keywords
Cite
CITATION STYLE
Herrera, J. F. R., Casado, L. G., Hendrix, E. M. T., & García, I. (2014). On simplicial longest edge bisection in Lipschitz Global Optimization. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8580 LNCS, pp. 104–114). Springer Verlag. https://doi.org/10.1007/978-3-319-09129-7_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
