On bisecting the unit simplex using various distance norms

J.M.G. Salmerón, L.G. Casado, E.M.T. Hendrix

Research output: Contribution to journalArticleAcademicpeer-review

Abstract

The iterative bisection of the longest edge of the unit simplex generates a binary tree, where the specific shape depends on the chosen longest edges to be bisected. In global optimization, the use of various distance norms may be advantageous for bounding purposes. The question dealt with in this paper is how the size of a binary tree generated by the refinement process depends on heuristics for longest edge selection when various distance norms are used. We focus on the minimum size of the tree that can be reached, how selection criteria may reduce the size of the tree compared to selecting the first edge, whether a predefined grid is covered and how unique are the selection criteria. The exact numerical values are provided for the unit simplex in 4 and 5-dimensional space.
LanguageEnglish
Pages351-366
JournalInformatica
Volume27
Issue number2
DOIs
Publication statusPublished - 2016

Fingerprint

Binary trees
Binary Tree
Norm
Unit
Global optimization
Bisection
Global Optimization
Refinement
Heuristics
Grid

Cite this

Salmerón, J.M.G. ; Casado, L.G. ; Hendrix, E.M.T. / On bisecting the unit simplex using various distance norms. In: Informatica. 2016 ; Vol. 27, No. 2. pp. 351-366.
@article{d74338705c344172ae0064013a616384,
title = "On bisecting the unit simplex using various distance norms",
abstract = "The iterative bisection of the longest edge of the unit simplex generates a binary tree, where the specific shape depends on the chosen longest edges to be bisected. In global optimization, the use of various distance norms may be advantageous for bounding purposes. The question dealt with in this paper is how the size of a binary tree generated by the refinement process depends on heuristics for longest edge selection when various distance norms are used. We focus on the minimum size of the tree that can be reached, how selection criteria may reduce the size of the tree compared to selecting the first edge, whether a predefined grid is covered and how unique are the selection criteria. The exact numerical values are provided for the unit simplex in 4 and 5-dimensional space.",
author = "J.M.G. Salmer{\'o}n and L.G. Casado and E.M.T. Hendrix",
year = "2016",
doi = "10.15388/Informatica.2016.89",
language = "English",
volume = "27",
pages = "351--366",
journal = "Informatica",
issn = "0868-4952",
publisher = "IOS Press",
number = "2",

}

On bisecting the unit simplex using various distance norms. / Salmerón, J.M.G.; Casado, L.G.; Hendrix, E.M.T.

In: Informatica, Vol. 27, No. 2, 2016, p. 351-366.

Research output: Contribution to journalArticleAcademicpeer-review

TY - JOUR

T1 - On bisecting the unit simplex using various distance norms

AU - Salmerón, J.M.G.

AU - Casado, L.G.

AU - Hendrix, E.M.T.

PY - 2016

Y1 - 2016

N2 - The iterative bisection of the longest edge of the unit simplex generates a binary tree, where the specific shape depends on the chosen longest edges to be bisected. In global optimization, the use of various distance norms may be advantageous for bounding purposes. The question dealt with in this paper is how the size of a binary tree generated by the refinement process depends on heuristics for longest edge selection when various distance norms are used. We focus on the minimum size of the tree that can be reached, how selection criteria may reduce the size of the tree compared to selecting the first edge, whether a predefined grid is covered and how unique are the selection criteria. The exact numerical values are provided for the unit simplex in 4 and 5-dimensional space.

AB - The iterative bisection of the longest edge of the unit simplex generates a binary tree, where the specific shape depends on the chosen longest edges to be bisected. In global optimization, the use of various distance norms may be advantageous for bounding purposes. The question dealt with in this paper is how the size of a binary tree generated by the refinement process depends on heuristics for longest edge selection when various distance norms are used. We focus on the minimum size of the tree that can be reached, how selection criteria may reduce the size of the tree compared to selecting the first edge, whether a predefined grid is covered and how unique are the selection criteria. The exact numerical values are provided for the unit simplex in 4 and 5-dimensional space.

UR - http://www.mii.lt/informatica/pdf/INFO1103.pdf

U2 - 10.15388/Informatica.2016.89

DO - 10.15388/Informatica.2016.89

M3 - Article

VL - 27

SP - 351

EP - 366

JO - Informatica

T2 - Informatica

JF - Informatica

SN - 0868-4952

IS - 2

ER -