{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,5]],"date-time":"2026-03-05T14:34:30Z","timestamp":1772721270729,"version":"3.50.1"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T00:00:00Z","timestamp":1579910400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T00:00:00Z","timestamp":1579910400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s10898-020-00878-z","type":"journal-article","created":{"date-parts":[[2020,1,25]],"date-time":"2020-01-25T11:02:28Z","timestamp":1579950148000},"page":"413-429","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["AbsTaylor: upper bounding with inner regions in nonlinear continuous global optimization problems"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3358-3906","authenticated-orcid":false,"given":"Victor","family":"Reyes","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ignacio","family":"Araya","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,1,25]]},"reference":[{"key":"878_CR1","doi-asserted-by":"crossref","unstructured":"Trombettoni, G., Araya, I., Neveu, B., Chabert, G.: Inner regions and interval linearizations for global optimization. In: AAAI Conference on Artificial Intelligence, (2011)","DOI":"10.1609\/aaai.v25i1.7817"},{"issue":"2","key":"878_CR2","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BF00138693","volume":"8","author":"NV Sahinidis","year":"1996","unstructured":"Sahinidis, N.V.: Baron: a general purpose global optimization software package. J. Glob. Optim. 8(2), 201\u2013205 (1996)","journal-title":"J. Glob. Optim."},{"key":"878_CR3","first-page":"1","volume":"59","author":"R Misener","year":"2013","unstructured":"Misener, R., Floudas, C.A.: Antigone: algorithms for continuous\/integer global optimization of nonlinear equations. J. Glob. Optim. 59, 1\u201324 (2013)","journal-title":"J. Glob. Optim."},{"key":"878_CR4","volume-title":"Linear, Integer and Quadratic Programming with LINDO","author":"L Schrage","year":"1986","unstructured":"Schrage, L.: Linear, Integer and Quadratic Programming with LINDO. The Scientific Press, Singapore (1986)"},{"key":"878_CR5","unstructured":"Belotti, P.: Couenne: a user\u2019s manual. Technical report, Lehigh University, Tech. Rep. (2009)"},{"issue":"4\u20135","key":"878_CR6","doi-asserted-by":"publisher","first-page":"709","DOI":"10.1080\/10556780902753452","volume":"24","author":"Y Lebbah","year":"2009","unstructured":"Lebbah, Y.: ICOS: a branch and bound based solver for rigorous global optimization. Optim. Methods Softw. 24(4\u20135), 709\u2013726 (2009)","journal-title":"Optim. Methods Softw."},{"key":"878_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2495-0","volume-title":"Rigorous Global Search Continuous Problems","author":"RB Kearfott","year":"1996","unstructured":"Kearfott, R.B.: Rigorous Global Search Continuous Problems. Springer, Berlin (1996)"},{"issue":"4","key":"878_CR8","doi-asserted-by":"publisher","first-page":"837","DOI":"10.1007\/s10898-015-0390-4","volume":"65","author":"I Araya","year":"2016","unstructured":"Araya, I., Reyes, V.: Interval branch-and-bound algorithms for optimization and constraint satisfaction: a survey and prospects. J. Glob. Optim. 65(4), 837\u2013866 (2016)","journal-title":"J. Glob. Optim."},{"issue":"2","key":"878_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/s10898-014-0145-7","volume":"60","author":"I Araya","year":"2014","unstructured":"Araya, I., Trombettoni, G., Neveu, B., Chabert, G.: Upper bounding in inner regions for global optimization under inequality constraints. J. Glob. Optim. 60(2), 145\u2013164 (2014)","journal-title":"J. Glob. Optim."},{"issue":"3","key":"878_CR10","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s10288-014-0269-0","volume":"13","author":"J Ninin","year":"2015","unstructured":"Ninin, J., Messine, F., Hansen, P.: A reliable affine relaxation method for global optimization. 4OR 13(3), 247\u2013277 (2015)","journal-title":"4OR"},{"key":"878_CR11","doi-asserted-by":"publisher","first-page":"598","DOI":"10.1007\/978-3-540-85958-1_49","volume-title":"Principles and Practice of Constraint Programming","author":"A Goldsztejn","year":"2008","unstructured":"Goldsztejn, A., Lebbah, Y., Michel, C., Rueher, M.: Revisiting the upper bounding process in a safe branch and bound algorithm. In: Beck, J.C. (ed.) Principles and Practice of Constraint Programming, pp. 598\u2013602. Springer, Berlin (2008)"},{"issue":"2","key":"878_CR12","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1287\/ijoc.6.2.207","volume":"6","author":"AS Drud","year":"1994","unstructured":"Drud, A.S.: CONOPT\u2014a large-scale GRG code. ORSA J. Comput. 6(2), 207\u2013216 (1994)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"878_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10107-004-0559-y","volume":"106","author":"A W\u00e4chter","year":"2006","unstructured":"W\u00e4chter, A., Biegler, L.T.: On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming. Math. Program. 106(1), 25\u201357 (2006)","journal-title":"Math. Program."},{"issue":"3","key":"878_CR14","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s12532-018-0138-5","volume":"10","author":"A Khajavirad","year":"2018","unstructured":"Khajavirad, A., Sahinidis, N.V.: A hybrid LP\/NLP paradigm for global optimization relaxations. Math. Program. Comput. 10(3), 383\u2013421 (2018)","journal-title":"Math. Program. Comput."},{"key":"878_CR15","doi-asserted-by":"crossref","unstructured":"Lasdon, L.S., Waren, A.D., Jain, A., Ratner, M.: Design and testing of a generalized reduced gradient code for nonlinear programming. Stanford University CA Systems Optimization Lab, Technical Report (1976)","DOI":"10.21236\/ADA009402"},{"key":"878_CR16","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"SJ Wright","year":"1997","unstructured":"Wright, S.J.: Primal-Dual Interior-Point Methods, vol. 54. SIAM, Philadelphia (1997)"},{"key":"878_CR17","doi-asserted-by":"crossref","unstructured":"Kuhn, H., Tucker, A.: Nonlinear programming. In: Second Berkeley Symposium on Mathematical Statistics and Probability, pp. 481\u2013492 (1951)","DOI":"10.1525\/9780520411586-036"},{"issue":"4","key":"878_CR18","doi-asserted-by":"publisher","first-page":"1674","DOI":"10.1137\/060649513","volume":"19","author":"J Nocedal","year":"2009","unstructured":"Nocedal, J., W\u00e4chter, A., Waltz, R.A.: Adaptive barrier update strategies for nonlinear interior methods. SIAM J. Optim. 19(4), 1674\u20131693 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"878_CR19","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10107-015-0893-2","volume":"151","author":"Y-X Yuan","year":"2015","unstructured":"Yuan, Y.-X.: Recent advances in trust region algorithms. Math. Program. 151(1), 249\u2013281 (2015)","journal-title":"Math. Program."},{"issue":"2","key":"878_CR20","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/0806023","volume":"6","author":"TF Coleman","year":"1996","unstructured":"Coleman, T.F., Li, Y.: An interior trust region approach for nonlinear minimization subject to bounds. SIAM J. Optim. 6(2), 418\u2013445 (1996)","journal-title":"SIAM J. Optim."},{"key":"878_CR21","unstructured":"Omojokun, E.O.: Trust region algorithms for optimization with nonlinear equality and inequality constraints. Ph.D Dissertation, University of Colorado (1989)"},{"key":"878_CR22","first-page":"1","volume":"71","author":"I Araya","year":"2017","unstructured":"Araya, I., Neveu, B.: lsmear: a variable selection strategy for interval branch and bound solvers. J. Glob. Optim. 71, 1\u201318 (2017)","journal-title":"J. Glob. Optim."},{"key":"878_CR23","unstructured":"Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.-F.: Revising hull and box consistency. In: International Conference on Logic Programming. Citeseer (1999)"},{"key":"878_CR24","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/978-3-540-74970-7_45","volume-title":"Principles and Practice of Constraint Programming-CP 2007","author":"G Trombettoni","year":"2007","unstructured":"Trombettoni, G., Chabert, G.: Constructive interval disjunction. In: Bessiere, C. (ed.) Principles and Practice of Constraint Programming-CP 2007, pp. 635\u2013650. Springer, Berlin (2007)"},{"key":"878_CR25","doi-asserted-by":"crossref","unstructured":"Araya, I., Trombettoni, G., Neveu, B.: A contractor based on convex interval taylor, In: Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, pp. 1\u201316. Springer (2012)","DOI":"10.1007\/978-3-642-29828-8_1"},{"issue":"2","key":"878_CR26","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan, E.D., Mor\u00e9, J.J.: Benchmarking optimization software with performance profiles. Math. Program. 91(2), 201\u2013213 (2002)","journal-title":"Math. Program."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00878-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-020-00878-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00878-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T18:19:48Z","timestamp":1722363588000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-020-00878-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,25]]},"references-count":26,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["878"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00878-z","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,25]]},"assertion":[{"value":"15 January 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 January 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}