{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:16Z","timestamp":1740122416790,"version":"3.37.3"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T00:00:00Z","timestamp":1707696000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T00:00:00Z","timestamp":1707696000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s10898-024-01370-8","type":"journal-article","created":{"date-parts":[[2024,2,12]],"date-time":"2024-02-12T13:02:39Z","timestamp":1707742959000},"page":"331-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Global solution of quadratic problems using interval methods and convex relaxations"],"prefix":"10.1007","volume":"91","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6289-7958","authenticated-orcid":false,"given":"Sourour","family":"Elloumi","sequence":"first","affiliation":[]},{"given":"Am\u00e9lie","family":"Lambert","sequence":"additional","affiliation":[]},{"given":"Bertrand","family":"Neveu","sequence":"additional","affiliation":[]},{"given":"Gilles","family":"Trombettoni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,12]]},"reference":[{"key":"1370_CR1","doi-asserted-by":"publisher","first-page":"120384","DOI":"10.1016\/j.energy.2021.120384","volume":"226","author":"D Hering","year":"2021","unstructured":"Hering, D., Xhonneux, A., M\u00fcller, D.: Design optimization of a heating network with multiple heat pumps using mixed integer quadratically constrained programming. Energy 226, 120384 (2021). https:\/\/doi.org\/10.1016\/j.energy.2021.120384","journal-title":"Energy"},{"key":"1370_CR2","doi-asserted-by":"crossref","unstructured":"Javadi, M.S., Gouveia, C.S., Carvalho, L.M.: A multi-temporal optimal power flow model for normal and contingent operation of microgrids. In: 2022 IEEE International Conference on Environment and Electrical Engineering and 2022 IEEE Industrial and Commercial Power Systems Europe (EEEIC\/I &CPS Europe), pp. 1\u20136. IEEE (2022)","DOI":"10.1109\/EEEIC\/ICPSEurope54979.2022.9854741"},{"issue":"1","key":"1370_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38(1), 49\u201395 (1996)","journal-title":"SIAM Rev."},{"key":"1370_CR4","unstructured":"Karp, R.M., Miller, R., Thatcher, J.: Reducibility among combinatorial problems. In: Complexity of Computer Computations (Proceedings of a Symposium, IBM Thomas J. Watson Research Center, Yorktown Heights, NY, 1972). MR 378476(51), 14644 (1972)"},{"key":"1370_CR5","unstructured":"Sahinidis, N.V., Tawarmalani, M.: Baron 24.3.19: Global optimization of mixed-integer nonlinear programs. User\u2019s Manual (2021)"},{"issue":"1","key":"1370_CR6","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10898-012-9874-7","volume":"57","author":"R Misener","year":"2013","unstructured":"Misener, R., Floudas, C.A.: Glomiqo: global mixed-integer quadratic optimizer. J. Glob. Optim. 57(1), 3\u201350 (2013)","journal-title":"J. Glob. Optim."},{"key":"1370_CR7","unstructured":"Gurobi\u00a0Optimization, L.: Gurobi Optimizer Reference Manual 911 (2021). http:\/\/www.gurobi.com"},{"key":"1370_CR8","unstructured":"Bliek, C., Bonami, P., Lodi, A.: Solving mixed-integer quadratic programming problems with ibm-cplex: a progress report. In: Proceedings of the Twenty-Sixth RAMP Symposium, pp. 171\u2013180 (2014)"},{"issue":"1","key":"1370_CR9","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s10107-015-0921-2","volume":"158","author":"A Billionnet","year":"2016","unstructured":"Billionnet, A., Elloumi, S., Lambert, A.: Exact quadratic convex reformulations of mixed-integer quadratically constrained problems. Math. Program. 158(1), 235\u2013266 (2016). https:\/\/doi.org\/10.1007\/s10107-015-0921-2","journal-title":"Math. Program."},{"issue":"1","key":"1370_CR10","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1080\/10556788.2017.1350675","volume":"34","author":"S Elloumi","year":"2019","unstructured":"Elloumi, S., Lambert, A.: Global solution of non-convex quadratically constrained quadratic programs. Optim. Methods Softw. 34(1), 98\u2013114 (2019)","journal-title":"Optim. Methods Softw."},{"key":"1370_CR11","unstructured":"Kearfott, R.B.: Rigorous Global Search: Continuous Problems. Springer (2013). https:\/\/books.google.fr\/books?id=0hfTBwAAQBAJ"},{"key":"1370_CR12","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/5073.001.0001","volume-title":"Numerica: A Modeling Language for Global Optimization","author":"P Van Hentenryck","year":"1997","unstructured":"Van Hentenryck, P., Michel, L., Deville, Y.: Numerica: A Modeling Language for Global Optimization. MIT Press, Cambridge (1997)"},{"key":"1370_CR13","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1016\/j.cam.2005.08.037","volume":"199","author":"Y Lebbah","year":"2007","unstructured":"Lebbah, Y., Michel, C., Rueher, M.: An efficient and safe framework for solving optimization problems. J. Comput. Appl. Math. 199, 372\u2013377 (2007)","journal-title":"J. Comput. Appl. Math."},{"issue":"3","key":"1370_CR14","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":"1370_CR15","doi-asserted-by":"crossref","unstructured":"Trombettoni, G., Araya, I., Neveu, B., Chabert, G.: Inner regions and interval linearizations for global optimization. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 25 (2011)","DOI":"10.1609\/aaai.v25i1.7817"},{"issue":"2","key":"1370_CR16","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."},{"key":"1370_CR17","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01580665","volume":"10","author":"GP McCormick","year":"1976","unstructured":"McCormick, G.P.: Computability of global solutions to factorable nonconvex programs: part 1\u2014convex underestimating problems. Math. Program. 10, 147\u2013175 (1976)","journal-title":"Math. Program."},{"issue":"2","key":"1370_CR18","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10898-008-9372-0","volume":"43","author":"KM Anstreicher","year":"2009","unstructured":"Anstreicher, K.M.: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming. J. Glob. Optim. 43(2), 471\u2013484 (2009). https:\/\/doi.org\/10.1007\/s10898-008-9372-0","journal-title":"J. Glob. Optim."},{"issue":"2","key":"1370_CR19","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10898-015-0375-3","volume":"64","author":"B Neveu","year":"2016","unstructured":"Neveu, B., Trombettoni, G., Araya, I.: Node selection strategies in interval branch and bound algorithms. J. Glob. Optim. 64(2), 289\u2013304 (2016)","journal-title":"J. Glob. Optim."},{"key":"1370_CR20","unstructured":"Benhamou, F., Goualard, F., Granvilliers, L., Puget, J.-F.: Revising hull and box consistency. In: Proceedings of International Conference on Logic Programming (ICLP), pp. 230\u2013244 (1999)"},{"key":"1370_CR21","unstructured":"Messine, F.: M\u00e9thodes d\u2019optimisation globale bas\u00e9es sur l\u2019analyse d\u2019intervalle pour la r\u00e9solution des probl\u00e8mes avec contraintes. Ph.D. thesis, LIMA-IRIT-ENSEEIHT-INPT, Toulouse (1997)"},{"key":"1370_CR22","doi-asserted-by":"publisher","first-page":"635","DOI":"10.1007\/978-3-540-74970-7_45","volume-title":"Principles and Practice of Constraint Programming\u2014CP 2007","author":"G Trombettoni","year":"2007","unstructured":"Trombettoni, G., Chabert, G.: Constructive interval disjunction. In: Bessi\u00e8re, C. (ed.) Principles and Practice of Constraint Programming\u2014CP 2007, pp. 635\u2013650. Springer, Berlin (2007)"},{"issue":"4","key":"1370_CR23","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1007\/s10601-015-9180-3","volume":"20","author":"B Neveu","year":"2015","unstructured":"Neveu, B., Trombettoni, G., Araya, I.: Adaptive constructive interval disjunction: algorithms and experiments. Constraints J. 20(4), 452\u2013467 (2015)","journal-title":"Constraints J."},{"key":"1370_CR24","doi-asserted-by":"crossref","unstructured":"Araya, I., Trombettoni, G., Neveu, B.: A contractor based on convex interval Taylor. In: Proceedings of the CPAIOR, LNCS 7298, pp. 1\u201316 (2012)","DOI":"10.1007\/978-3-642-29828-8_1"},{"key":"1370_CR25","unstructured":"Elloumi, S., Lambert, A., Lazare, A.: Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (2019)"},{"issue":"1","key":"1370_CR26","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1023\/B:JOGO.0000006720.68398.8c","volume":"28","author":"C Jansson","year":"2004","unstructured":"Jansson, C.: A rigourous lower bound for the optimal value of convex optimization problems. J. Glob. Optim. 28(1), 121\u2013137 (2004)","journal-title":"J. Glob. Optim."},{"issue":"1","key":"1370_CR27","doi-asserted-by":"publisher","first-page":"020050","DOI":"10.1063\/1.5090017","volume":"2070","author":"F Messine","year":"2019","unstructured":"Messine, F., Trombettoni, G.: Reliable bounds for convex relaxation in interval global optimization codes. AIP Conf. Proc. 2070(1), 020050 (2019). https:\/\/doi.org\/10.1063\/1.5090017","journal-title":"AIP Conf. Proc."},{"key":"1370_CR28","unstructured":"Lambert, A.: IQCP\/MIQCP: library of integer and mixed-integer quadratically constrained programs. https:\/\/github.com\/amelie-lambert\/IQCP-MIQCP"},{"issue":"4\u20135","key":"1370_CR29","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1080\/10556780902883184","volume":"24","author":"X Bao","year":"2009","unstructured":"Bao, X., Sahinidis, N.V., Tawarmalani, M.: Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs. Optim. Methods Softw. 24(4\u20135), 485\u2013504 (2009)","journal-title":"Optim. Methods Softw."},{"issue":"2","key":"1370_CR30","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1287\/ijoc.2016.0731","volume":"29","author":"A Billionnet","year":"2017","unstructured":"Billionnet, A., Elloumi, S., Lambert, A., Wiegele, A.: Using a conic bundle method to accelerate both phases of a quadratic convex reformulation. INFORMS J. Comput. 29(2), 318\u2013331 (2017). https:\/\/doi.org\/10.1287\/ijoc.2016.0731","journal-title":"INFORMS J. Comput."},{"key":"1370_CR31","unstructured":"MOSEK ApS: The MOSEK optimization toolbox for MATLAB manual. Version 9.2. (2019). http:\/\/docs.mosek.com\/9.0\/toolbox\/index.html"},{"key":"1370_CR32","unstructured":"Helmberg, C.: Conic Bundle V0.3.10"},{"key":"1370_CR33","unstructured":"Fourer, R., Gay, D.M., Kernighan, B.W.: Ampl. a modeling language for mathematical programming (2003)"},{"key":"1370_CR34","unstructured":"IBM-ILOG: IBM ILOG CPLEX 12.9 reference manual"},{"key":"1370_CR35","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"D Dolan","year":"1986","unstructured":"Dolan, D., Mor\u00e9, J.: Benchmarking optimization software with performance profiles. Math. Program. 91, 201\u2013213 (1986)","journal-title":"Math. Program."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01370-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-024-01370-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-024-01370-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,15]],"date-time":"2025-02-15T05:47:53Z","timestamp":1739598473000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-024-01370-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,12]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["1370"],"URL":"https:\/\/doi.org\/10.1007\/s10898-024-01370-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"type":"print","value":"0925-5001"},{"type":"electronic","value":"1573-2916"}],"subject":[],"published":{"date-parts":[[2024,2,12]]},"assertion":[{"value":"28 February 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}