{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T14:34:44Z","timestamp":1761921284123,"version":"3.37.3"},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T00:00:00Z","timestamp":1721606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T00:00:00Z","timestamp":1721606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2024,11]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We consider a simplicial branch and bound Global Optimization algorithm, where the search region is a simplex. Apart from using longest edge bisection, a simplicial partition set can be reduced due to monotonicity of the objective function. If there is a direction in which the objective function is monotone over a simplex, depending on whether the facets that may contain the minimum are at the border of the search region, we can remove the simplex completely, or reduce it to some of its border facets. Our research question deals with finding monotone directions and labeling facets of a simplex as border after longest edge bisection and reduction due to monotonicity. Experimental results are shown over a set of global optimization problems where the feasible set is defined as a simplex, and a global minimum point is located at a face of the simplicial feasible area.\n<\/jats:p>","DOI":"10.1007\/s10957-024-02480-9","type":"journal-article","created":{"date-parts":[[2024,7,22]],"date-time":"2024-07-22T06:01:50Z","timestamp":1721628110000},"page":"1880-1909","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["On Dealing with Minima at the Border of a Simplicial Feasible Area in Simplicial Branch and Bound"],"prefix":"10.1007","volume":"203","author":[{"given":"Bogl\u00e1rka","family":"G.-T\u00f3th","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1572-1436","authenticated-orcid":false,"given":"Eligius M. T.","family":"Hendrix","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leocadio G.","family":"Casado","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Messine","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,7,22]]},"reference":[{"key":"2480_CR1","doi-asserted-by":"publisher","unstructured":"Aparicio, G., Casado, L.G., Hendrix, E.M.T., G.-T\u00f3th, B., Garc\u00eda, I.: On the minimum number of simplex shapes in longest edge bisection refinement of a regular $$n$$-simplex. Informatica 26(1), 17\u201332 (2015). https:\/\/doi.org\/10.15388\/informatica.2015.36","DOI":"10.15388\/informatica.2015.36"},{"key":"2480_CR2","doi-asserted-by":"publisher","unstructured":"Casado, L.G., G.-T\u00f3th, B., Hendrix, E.M.T., Messine, F.: On monotonicity detection in simplicial branch and bound over a simplex. In: O.\u00a0Gervasi, B.\u00a0Murgante, S.\u00a0Misra, A.M.A.C. Rocha, C.\u00a0Garau (Eds.) Computational Science and its Applications\u2014ICCSA 2022 Workshops, pp. 113\u2013126. Springer International Publishing, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-10562-3_9","DOI":"10.1007\/978-3-031-10562-3_9"},{"key":"2480_CR3","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10100-007-0052-9","volume":"16","author":"E De Klerk","year":"2008","unstructured":"De Klerk, E.: The complexity of optimizing over a simplex, hypercube or sphere: a short survey. CEJOR 16, 111\u2013125 (2008). https:\/\/doi.org\/10.1007\/s10100-007-0052-9","journal-title":"CEJOR"},{"issue":"3","key":"2480_CR4","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/BF01096455","volume":"5","author":"K Du","year":"1994","unstructured":"Du, K., Kearfott, R.B.: The cluster problem in multivariate global optimization. J. Global Optim. 5(3), 253\u2013256 (1994). https:\/\/doi.org\/10.1007\/BF01096455","journal-title":"J. Global Optim."},{"issue":"4","key":"2480_CR5","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/s10898-021-01053-8","volume":"80","author":"B G.-T\u00f3th","year":"2021","unstructured":"G.-T\u00f3th, B., Casado, L.G., Hendrix, E.M.T., Messine, F.: On new methods to construct lower bounds in simplicial branch and bound based on interval arithmetic. J. Global Optim. 80(4), 779\u2013804 (2021). https:\/\/doi.org\/10.1007\/s10898-021-01053-8","journal-title":"J. Global Optim."},{"key":"2480_CR6","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1007\/s10100-021-00737-6","volume":"30","author":"B G.-T\u00f3th","year":"2021","unstructured":"G.-T\u00f3th, B., Hendrix, E.M.T., Casado, L.G.: On monotonicity and search strategies in face based copositivity detection algorithms. Central Eur. J. Oper. Res. 30, 1071\u20131092 (2021). https:\/\/doi.org\/10.1007\/s10100-021-00737-6","journal-title":"Central Eur. J. Oper. Res."},{"issue":"218","key":"2480_CR7","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1090\/s0025-5718-97-00809-0","volume":"66","author":"R Horst","year":"1997","unstructured":"Horst, R.: On generalized bisection of $$n$$-simplices. Math. Comput. 66(218), 691\u2013699 (1997). https:\/\/doi.org\/10.1090\/s0025-5718-97-00809-0","journal-title":"Math. Comput."},{"issue":"3","key":"2480_CR8","doi-asserted-by":"publisher","first-page":"2023","DOI":"10.1051\/ro\/2021081","volume":"55","author":"EMT Hendrix","year":"2021","unstructured":"Hendrix, E.M.T., G.-T\u00f3th, B., Messine, F., Casado, L.G.: On derivative based bounding for simplicial branch and bound. RAIRO 55(3), 2023\u20132034 (2021). https:\/\/doi.org\/10.1051\/ro\/2021081","journal-title":"RAIRO"},{"key":"2480_CR9","volume-title":"Global Optimization Using Interval Analysis, 2$$^{nd}$$ edn","author":"E Hansen","year":"2004","unstructured":"Hansen, E., Walster, W.: Global Optimization Using Interval Analysis, 2$$^{nd}$$ edn. Marcel Dekker Inc., New York (2004)"},{"key":"2480_CR10","doi-asserted-by":"publisher","unstructured":"Hendrix, E.M.T., Salmer\u00f3n, J.M., Casado, L.G.: On function monotonicity in simplicial branch and bound. In: LeGO 2018, pp.\u00a04. Leiden (The Netherlands) (2018). https:\/\/doi.org\/10.1063\/1.5089974","DOI":"10.1063\/1.5089974"},{"key":"2480_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization (Deterministic Approaches)","author":"R Horst","year":"1990","unstructured":"Horst, R., Tuy, H.: Global Optimization (Deterministic Approaches). Springer, Berlin Heidelberg (1990). https:\/\/doi.org\/10.1007\/978-3-662-03199-5"},{"key":"2480_CR12","unstructured":"Karhbet, S.D., Kearfott, R.B.: Range bounds of functions over simplices, for branch and bound algorithms. Reliable Computing 25, 53\u201373 . https:\/\/interval.louisiana.edu\/reliable-computing-journal (2017)"},{"issue":"3","key":"2480_CR13","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/BF00171829","volume":"2","author":"RB Kearfott","year":"1992","unstructured":"Kearfott, R.B.: An interval branch and bound algorithm for bound constrained optimization problems. J. Global Optim. 2(3), 259\u2013280 (1992). https:\/\/doi.org\/10.1007\/BF00171829","journal-title":"J. Global Optim."},{"key":"2480_CR14","doi-asserted-by":"publisher","first-page":"S2373","DOI":"10.1051\/ro\/2020088","volume":"55","author":"O Mohand","year":"2021","unstructured":"Mohand, O.: Tighter bound functions for nonconvex functions over simplexes. RAIRO Oper. Res. 55, S2373-2381 (2021). https:\/\/doi.org\/10.1051\/ro\/2020088","journal-title":"RAIRO Oper. Res."},{"key":"2480_CR15","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898717716","volume-title":"Introduction to Interval Analysis","author":"RE Moore","year":"2009","unstructured":"Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to Interval Analysis. Society for Industrial and Applied Mathematics, USA (2009). https:\/\/doi.org\/10.1137\/1.9780898717716"},{"key":"2480_CR16","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-9093-7","volume-title":"Simplicial Global Optimization","author":"R Paulavi\u010dius","year":"2014","unstructured":"Paulavi\u010dius, R., \u017dilinskas, J.: Simplicial Global Optimization. Springer, New York (2014)"},{"key":"2480_CR17","first-page":"54","volume-title":"Examples of software for automatic differentiation and generation of Taylor coefficients","year":"1981","unstructured":"Rall, L.B. (ed.): Examples of software for automatic differentiation and generation of Taylor coefficients, pp. 54\u201390. Springer, Berlin Heidelberg, Berlin, Heidelberg (1981)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02480-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10957-024-02480-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-024-02480-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,11]],"date-time":"2024-11-11T10:09:07Z","timestamp":1731319747000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10957-024-02480-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,7,22]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,11]]}},"alternative-id":["2480"],"URL":"https:\/\/doi.org\/10.1007\/s10957-024-02480-9","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2024,7,22]]},"assertion":[{"value":"2 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 June 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}