Abstract
| Language | English |
|---|---|
| Title of host publication | Computational Science and Its Applications - ICCSA 2017 |
| Subtitle of host publication | 17th International Conference, Trieste, Italy, July 3-6, 2017, Proceedings, Part III |
| Editors | O. Gervasi, B. Murgante, S. Misra, G. Borruso, C.M. Torre, A.M.A.C. Rocha, D. Taniar, B.O. Apduhan, E. Stankova, A. Cuzzocrea |
| Place of Publication | Cham |
| Publisher | Springer |
| Pages | 165-180 |
| ISBN (Electronic) | 9783319623986 |
| ISBN (Print) | 9783319623979 |
| DOIs | |
| Publication status | Published - 2017 |
| Event | The 17th International Conference on Computational Science and Its Applications (ICCSA 2017) - Trieste, Italy Duration: 3 Jul 2017 → 6 Jul 2017 |
Publication series
| Name | Lecture Notes in Computer Science (LNCS) |
|---|---|
| Volume | 10406 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Conference
| Conference | The 17th International Conference on Computational Science and Its Applications (ICCSA 2017) |
|---|---|
| Country | Italy |
| City | Trieste |
| Period | 3/07/17 → 6/07/17 |
Fingerprint
Cite this
}
On grid aware refinement of the unit hypercube and simplex: Focus on the complete tree size. / Casado, L.G.; Hendrix, E.M.T.; Salmerón, J.M.G.; Tóth, B.G.; García, I.
Computational Science and Its Applications - ICCSA 2017: 17th International Conference, Trieste, Italy, July 3-6, 2017, Proceedings, Part III. ed. / O. Gervasi; B. Murgante; S. Misra; G. Borruso; C.M. Torre; A.M.A.C. Rocha; D. Taniar; B.O. Apduhan; E. Stankova; A. Cuzzocrea. Cham : Springer, 2017. p. 165-180 (Lecture Notes in Computer Science (LNCS); Vol. 10406).Research output: Chapter in Book/Report/Conference proceeding › Chapter › Academic › peer-review
TY - CHAP
T1 - On grid aware refinement of the unit hypercube and simplex: Focus on the complete tree size
AU - Casado, L.G.
AU - Hendrix, E.M.T.
AU - Salmerón, J.M.G.
AU - Tóth, B.G.
AU - García, I.
PY - 2017
Y1 - 2017
N2 - Branch and bound (BnB) Global Optimization algorithms can be used to find the global optimum (minimum) of a multiextremal function over the unit hypercube and unit simplex with a guaranteed accuracy. Subdivision strategies can take the information of the evaluated points into account leading to irregular shaped subsets. This study focuses on the passive generation of spatial subdivisions aiming at evaluating points on a predefined grid. The efficiency measure is in terms of the complete tree size, or worst case BnB scenario, with a termination criterion on the subset size. Longest edge bisection is used as a benchmark. It is shown that taking the grid for a given termination tolerance into account, other general partitions exist that improve the BnB upper bound on the number of evaluated points and subsets.
AB - Branch and bound (BnB) Global Optimization algorithms can be used to find the global optimum (minimum) of a multiextremal function over the unit hypercube and unit simplex with a guaranteed accuracy. Subdivision strategies can take the information of the evaluated points into account leading to irregular shaped subsets. This study focuses on the passive generation of spatial subdivisions aiming at evaluating points on a predefined grid. The efficiency measure is in terms of the complete tree size, or worst case BnB scenario, with a termination criterion on the subset size. Longest edge bisection is used as a benchmark. It is shown that taking the grid for a given termination tolerance into account, other general partitions exist that improve the BnB upper bound on the number of evaluated points and subsets.
U2 - 10.1007/978-3-319-62398-6_12
DO - 10.1007/978-3-319-62398-6_12
M3 - Chapter
SN - 9783319623979
T3 - Lecture Notes in Computer Science (LNCS)
SP - 165
EP - 180
BT - Computational Science and Its Applications - ICCSA 2017
A2 - Gervasi, O.
A2 - Murgante, B.
A2 - Misra, S.
A2 - Borruso, G.
A2 - Torre, C.M.
A2 - Rocha, A.M.A.C.
A2 - Taniar, D.
A2 - Apduhan, B.O.
A2 - Stankova, E.
A2 - Cuzzocrea, A.
PB - Springer
CY - Cham
ER -