{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T05:33:56Z","timestamp":1761888836025,"version":"build-2065373602"},"reference-count":29,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2017,9,1]],"date-time":"2017-09-01T00:00:00Z","timestamp":1504224000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"funder":[{"DOI":"10.13039\/100000084","name":"Directorate for Engineering","doi-asserted-by":"publisher","award":["CMMI-1160915"],"award-info":[{"award-number":["CMMI-1160915"]}],"id":[{"id":"10.13039\/100000084","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-14-1-0315"],"award-info":[{"award-number":["N00014-14-1-0315"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s13675-016-0079-6","type":"journal-article","created":{"date-parts":[[2016,12,21]],"date-time":"2016-12-21T04:55:45Z","timestamp":1482296145000},"page":"309-337","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":10,"title":["On global optimization with indefinite quadratics"],"prefix":"10.1016","volume":"5","author":[{"given":"Marcia","family":"Fampa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8190-1091","authenticated-orcid":false,"given":"Jon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wendel","family":"Melo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"9","key":"10.1007\/s13675-016-0079-6_CR1","doi-asserted-by":"crossref","first-page":"1137","DOI":"10.1016\/S0098-1354(98)00027-1","article-title":"A global optimization method, \u03b1BB, for general twice-differeentiable constrained NLPs-I. Theoretical advances","volume":"22","author":"Adjiman","year":"1998","journal-title":"Comput Chem Eng"},{"issue":"9","key":"10.1007\/s13675-016-0079-6_CR2","doi-asserted-by":"crossref","first-page":"1159","DOI":"10.1016\/S0098-1354(98)00218-X","article-title":"A global optimization method, \u03b1BB, for general twice-differentiable constrained NLPs\u2014II. Implementation and computational results","volume":"22","author":"Adjiman","year":"1998","journal-title":"Comput Chem Eng"},{"key":"10.1007\/s13675-016-0079-6_CR3","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1137\/0805002","article-title":"Interior point methods in semidefinite programming with applications to combinatorial optimization","volume":"5","author":"Alizadeh","year":"1993","journal-title":"SIAM J Optim"},{"issue":"1","key":"10.1007\/s13675-016-0079-6_CR4","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1023\/A:1009777410170","article-title":"A combined d.c. optimization\u2014ellipsoidal branch-and-bound algorithm for solving nonconvex quadratic programming problems. Semidefinite programming and interior-point approaches for combinatorial optimization problems (Toronto, ON, 1996)","volume":"2","author":"An","year":"1998","journal-title":"J Comb Optim"},{"key":"10.1007\/s13675-016-0079-6_CR5","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","article-title":"The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems","volume":"133","author":"An","year":"2005","journal-title":"Ann Oper Res"},{"key":"10.1007\/s13675-016-0079-6_CR6","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1007\/s10898-004-4312-0","article-title":"D.C. versus copositive bounds for standard QP","volume":"33","author":"Anstreicher","year":"2005","journal-title":"J Glob Optim"},{"key":"10.1007\/s13675-016-0079-6_CR7","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/10556780903087124","article-title":"Branching and bounds tightening techniques for non-convex MINLP","volume":"24","author":"Belotti","year":"2009","journal-title":"Optim Methods Softw"},{"issue":"28","key":"10.1007\/s13675-016-0079-6_CR8","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/s10878-012-9560-1","article-title":"A branch and bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation","volume":"2","author":"Billionnet","year":"2014","journal-title":"J Comb Optim"},{"key":"10.1007\/s13675-016-0079-6_CR9","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1023\/A:1026583532263","article-title":"On copositive programming and standard quadratic optimization problems","volume":"18","author":"Bomze","year":"2000","journal-title":"J Glob Optim"},{"issue":"2","key":"10.1007\/s13675-016-0079-6_CR10","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1023\/B:COAP.0000026886.61324.e4","article-title":"Undominated d.c. decompositions of quadratic functions and applications to branch-and-bound approaches","volume":"28","author":"Bomze","year":"2004","journal-title":"Comput Optim Appl"},{"year":"1977","series-title":"Applied mathematical programming","author":"Bradley","key":"10.1007\/s13675-016-0079-6_CR11"},{"key":"10.1007\/s13675-016-0079-6_CR12","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s12532-011-0033-9","article-title":"Globally solving nonconvex quadratic programming problems via completely positive programming","volume":"4","author":"Burer","year":"2012","journal-title":"Math Program Comput"},{"key":"10.1007\/s13675-016-0079-6_CR13","doi-asserted-by":"crossref","unstructured":"Burer S, Saxena A (2012) The MILP road to MIQCP. In: Lee J, Leyffer S (eds) Mixed-integer nonlinear programming. The IMA volumes in mathematics and its applications, vol 154. Springer, New York, pp 373\u2013405","DOI":"10.1007\/978-1-4614-1927-3_13"},{"key":"10.1007\/s13675-016-0079-6_CR14","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10107-006-0080-6","article-title":"A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations","volume":"113","author":"Burer","year":"2008","journal-title":"Math Program Ser A"},{"key":"10.1007\/s13675-016-0079-6_CR15","doi-asserted-by":"crossref","unstructured":"Burkard RE, \u00c7ela E, Pardalos PM, Pitsoulis LS (1998) The quadratic assignment problem. Handbook of combinatorial optimization, vol 3. Kluwer Acad. Publ., Boston, pp 241\u2013237","DOI":"10.1007\/978-1-4613-0303-9_27"},{"key":"10.1007\/s13675-016-0079-6_CR16","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/BF01582148","article-title":"A new technique for generating quadratic programming test problems","volume":"61","author":"Calamai","year":"1993","journal-title":"Math Program"},{"key":"10.1007\/s13675-016-0079-6_CR17","unstructured":"COUENNE http:\/\/projects.coin-or.org\/Couenne"},{"key":"10.1007\/s13675-016-0079-6_CR18","unstructured":"CPLEX http:\/\/www-01.ibm.com\/software\/integration\/optimization\/cplex-optimizer\/"},{"key":"10.1007\/s13675-016-0079-6_CR19","doi-asserted-by":"crossref","unstructured":"D\u2019Ambrosio C, Lee J, W\u00e4chter A (2012) An algorithmic framework for MINLP with separable non-convexity. In: Lee J, Leyffer S (eds) Mixed-integer nonlinear programming. The IMA volumes in mathematics and its applications, vol 154, pp 315\u2013347","DOI":"10.1007\/978-1-4614-1927-3_11"},{"key":"10.1007\/s13675-016-0079-6_CR20","doi-asserted-by":"crossref","unstructured":"Hemmecke R, K\u00f6ppe M, Lee J, Weismantel R (2010) Nonlinear integer programming. In: J\u00fcnger M, Liebling T, Naddef D, Nemhauser G, Pulleyblank W, Reinelt G, Rinaldi G, Wolsey L (eds) 50 Years of integer programming 1958\u20132008: the early years and state-of-the-art surveys. Springer, Berlin, pp 561\u2013618","DOI":"10.1007\/978-3-540-68279-0_15"},{"key":"10.1007\/s13675-016-0079-6_CR21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1021765131316","article-title":"DC programming: overview","volume":"103","author":"Horst","year":"1999","journal-title":"J Optim Theory Appl"},{"issue":"8","key":"10.1007\/s13675-016-0079-6_CR22","doi-asserted-by":"crossref","first-page":"2345","DOI":"10.1016\/j.cor.2005.09.007","article-title":"In situ column generation for a cutting-stock problem","volume":"34","author":"Lee","year":"2007","journal-title":"Comput Oper Res"},{"key":"10.1007\/s13675-016-0079-6_CR23","doi-asserted-by":"crossref","unstructured":"Lee J, Leyffer S (eds) (2012) Mixed-integer nonlinear programming. The IMA volumes in mathematics and its applications, vol 154. Springer, New York","DOI":"10.1007\/978-1-4614-1927-3"},{"issue":"2","key":"10.1007\/s13675-016-0079-6_CR24","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10107-008-0235-8","article-title":"Solving max-cut to optimality by intersecting semidefinite and polyhedral relaxations","volume":"121","author":"Rendl","year":"2010","journal-title":"Math Program Ser A"},{"issue":"1-2","key":"10.1007\/s13675-016-0079-6_CR25","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s10107-010-0371-9","article-title":"Convex relaxations of non-convex mixed-integer quadratically-constrained programs: extended formulations","volume":"124","author":"Saxena","year":"2010","journal-title":"Math Program Ser B"},{"issue":"2","key":"10.1007\/s13675-016-0079-6_CR26","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/s10107-010-0340-3","article-title":"Convex relaxations of non-convex mixed-integer quadratically-constrained programs: projected formulations","volume":"130","author":"Saxena","year":"2011","journal-title":"Math Program Ser A"},{"key":"10.1007\/s13675-016-0079-6_CR27","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0167-6377(96)00036-3","article-title":"d.c. (difference of convex functions) optimization algorithms (DCA) for globally minimizing nonconvex quadratic forms on Euclidean balls and spheres","volume":"19","author":"Tao","year":"1996","journal-title":"Oper Res Lett"},{"issue":"2","key":"10.1007\/s13675-016-0079-6_CR28","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","article-title":"A polyhedral branch-and-cut approach to global optimization","volume":"103","author":"Tawarmalani","year":"2005","journal-title":"Math Program"},{"key":"10.1007\/s13675-016-0079-6_CR29","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1007\/s10898-010-9630-9","article-title":"Nonconvex quadratically constrained quadratic programming: best d.c. decompositions and their SDP representations","volume":"50","author":"Zheng","year":"2011","journal-title":"J Glob Optim"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-016-0079-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-016-0079-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000836?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000836?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-016-0079-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:46:06Z","timestamp":1761882366000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000836"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["S2192440621000836"],"URL":"https:\/\/doi.org\/10.1007\/s13675-016-0079-6","relation":{},"ISSN":["2192-4406"],"issn-type":[{"type":"print","value":"2192-4406"}],"subject":[],"published":{"date-parts":[[2017,9]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"On global optimization with indefinite quadratics","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-016-0079-6","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2017 The author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}