{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T16:06:15Z","timestamp":1772208375000,"version":"3.50.1"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,12,27]],"date-time":"2016-12-27T00:00:00Z","timestamp":1482796800000},"content-version":"unspecified","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":[[2017,1]]},"DOI":"10.1007\/s10898-016-0491-8","type":"journal-article","created":{"date-parts":[[2016,12,27]],"date-time":"2016-12-27T12:40:49Z","timestamp":1482842449000},"page":"59-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["Bounds tightening based on optimality conditions for nonconvex box-constrained optimization"],"prefix":"10.1007","volume":"67","author":[{"given":"Yash","family":"Puranik","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2087-9131","authenticated-orcid":false,"given":"Nikolaos V.","family":"Sahinidis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,12,27]]},"reference":[{"key":"491_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg, T.: SCIP: solving constraint integer programs. Math. Program. Comput. 1, 1\u201341 (2009)","journal-title":"Math. Program. Comput."},{"key":"491_CR2","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/s10898-004-9972-2","volume":"31","author":"MM Ali","year":"2005","unstructured":"Ali, M.M., Khompatraporn, C., Zabinsky, Z.B.: A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems. J. Glob. Optim. 31, 635\u2013672 (2005)","journal-title":"J. Glob. Optim."},{"key":"491_CR3","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1007\/s11750-011-0178-8","volume":"20","author":"S Amaran","year":"2012","unstructured":"Amaran, S., Sahinidis, N.V.: Global optimization of nonlinear least-squares problems by branch-and-bound and optimality constraints. TOP 20, 154\u2013172 (2012)","journal-title":"TOP"},{"key":"491_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s12532-014-0073-z","volume":"7","author":"X Bao","year":"2015","unstructured":"Bao, X., Khajavirad, A., Sahinidis, N.V., Tawarmalani, M.: Global optimization of nonconvex problems with multilinear intermediates. Math. Program. Comput. 7, 1\u201337 (2015)","journal-title":"Math. Program. Comput."},{"key":"491_CR5","doi-asserted-by":"crossref","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, 485\u2013504 (2009)","journal-title":"Optim. Methods Softw."},{"key":"491_CR6","unstructured":"Bazaraa, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming, Theory and Algorithms, 2nd edn, Series in Discrete Mathematics and Optimization. Wiley Interscience, Hoboken (1993)"},{"key":"491_CR7","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1080\/10556780903087124","volume":"24","author":"P Belotti","year":"2009","unstructured":"Belotti, P., Lee, J., Liberti, L., Margot, F., W\u00e4chter, A.: Branching and bounds tightening techniques for non-convex MINLP. Optim. Methods Softw. 24, 597\u2013634 (2009)","journal-title":"Optim. Methods Softw."},{"key":"491_CR8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0191-2615(94)00025-U","volume":"29","author":"M Bierlaire","year":"1995","unstructured":"Bierlaire, M., Toint, P.L.: Meuse: an origin-destination matrix estimator that exploits structure. Transp. Res. Part B Methodol. 29, 47\u201360 (1995)","journal-title":"Transp. Res. Part B Methodol."},{"key":"491_CR9","unstructured":"Bound-constrained programs. http:\/\/minlp.com\/nlp-and-minlp-test-problems"},{"key":"491_CR10","volume-title":"GAMS-A User\u2019s Guide","author":"A Brooke","year":"1988","unstructured":"Brooke, A., Kendrick, D., Meeraus, A.: GAMS-A User\u2019s Guide. The Scientific Press, Redwood City (1988)"},{"key":"491_CR11","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1007\/s10589-009-9273-2","volume":"48","author":"S Burer","year":"2011","unstructured":"Burer, S., Chen, J.: Relaxing the optimality conditions of box QP. Comput. Optim. Appl. 48, 653\u2013673 (2011)","journal-title":"Comput. Optim. Appl."},{"key":"491_CR12","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10107-006-0080-6","volume":"113","author":"S Burer","year":"2008","unstructured":"Burer, S., Vandenbussche, D.: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations. Math. Program. 113, 259\u2013282 (2008)","journal-title":"Math. Program."},{"key":"491_CR13","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1007\/s10589-007-9137-6","volume":"43","author":"S Burer","year":"2009","unstructured":"Burer, S., Vandenbussche, D.: Globally solving box-constrained nonconvex quadratic programs with semidefinite-based finite branch-and-bound. Comput. Optim. Appl. 43, 181\u2013195 (2009)","journal-title":"Comput. Optim. Appl."},{"key":"491_CR14","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s12532-011-0033-9","volume":"4","author":"J Chen","year":"2012","unstructured":"Chen, J., Burer, S.: Globally solving nonconvex quadratic programming problems via completely positive programming. Math. Program. Comput. 4, 33\u201352 (2012)","journal-title":"Math. Program. Comput."},{"key":"491_CR15","doi-asserted-by":"crossref","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, 201\u2013213 (2002)","journal-title":"Math. Program."},{"key":"491_CR16","doi-asserted-by":"crossref","unstructured":"Dolan, E.D., Mor\u00e9, J.J., Munson, T.S.: Benchmarking Optimization Software with COPS 3.0. Argonne National Laboratory Research Report (2004)","DOI":"10.2172\/834714"},{"key":"491_CR17","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10107-014-0851-4","volume":"155","author":"F Domes","year":"2016","unstructured":"Domes, F., Neumaier, A.: Constraint aggregation for rigorous global optimization. Math. Program. 155, 375\u2013401 (2016)","journal-title":"Math. Program."},{"key":"491_CR18","volume-title":"Handbook of Test Problems in Local and Global Optimization","author":"CA Floudas","year":"2013","unstructured":"Floudas, C.A., Pardalos, P.M., Adjiman, C., Esposito, W.R., G\u00fcm\u00fcs, Z.H., Harding, S.T., Klepeis, J.L., Meyer, C.A., Schweiger, C.A.: Handbook of Test Problems in Local and Global Optimization, vol. 33. Springer, Berlin (2013)"},{"key":"491_CR19","unstructured":"GLOBAL Library. http:\/\/www.gamsworld.org\/global\/globallib.htm"},{"key":"491_CR20","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1002\/1520-6750(199304)40:3<373::AID-NAV3220400307>3.0.CO;2-A","volume":"40","author":"P Hansen","year":"1993","unstructured":"Hansen, P., Jaumard, B., Ruiz, M., Xiong, J.: Global minimization of indefinite quadratic functions subject to box constraints. Nav. Res. Logist. (NRL) 40, 373\u2013392 (1993)","journal-title":"Nav. Res. Logist. (NRL)"},{"key":"491_CR21","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03199-5","volume-title":"Global Optimization: Deterministic Approaches","author":"R Horst","year":"1996","unstructured":"Horst, R., Tuy, H.: Global Optimization: Deterministic Approaches, 3rd edn. Springer, Berlin (1996)","edition":"3"},{"key":"491_CR22","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1007\/s10107-010-0426-y","volume":"133","author":"J Hu","year":"2012","unstructured":"Hu, J., Mitchell, J.E., Pang, J.: An LPCC approach to nonconvex quadratic programs. Math. Program. 133, 243\u2013277 (2012)","journal-title":"Math. Program."},{"key":"491_CR23","unstructured":"Karush, W.: Minima of Functions of Several Variables with Inequalities as Side Constraints. Master\u2019s thesis, Department of Mathematics, University of Chicago, Chicago, IL (1939)"},{"key":"491_CR24","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s10898-011-9747-5","volume":"52","author":"A Khajavirad","year":"2011","unstructured":"Khajavirad, A., Sahinidis, N.V.: Convex envelopes of products of convex and component-wise concave functions. J. Glob. Optim. 52, 391\u2013409 (2011)","journal-title":"J. Glob. Optim."},{"key":"491_CR25","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10107-011-0496-5","volume":"137","author":"A Khajavirad","year":"2013","unstructured":"Khajavirad, A., Sahinidis, N.V.: Convex envelopes generated from finitely many compact convex sets. Math. Program. 137, 371\u2013408 (2013)","journal-title":"Math. Program."},{"key":"491_CR26","doi-asserted-by":"crossref","first-page":"481","DOI":"10.1525\/9780520411586-036","volume-title":"Proceedings ofthe Second Berkeley Symposium on Mathematical Statistics and Probability","author":"HW Kuhn","year":"1951","unstructured":"Kuhn, H.W., Tucker, A.W.: Nonlinear programming. In: Neyman, J. (ed.) Proceedings ofthe Second Berkeley Symposium on Mathematical Statistics and Probability, pp. 481\u2013492. University of California Press, Berkeley (1951)"},{"key":"491_CR27","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1080\/10556780902753221","volume":"24","author":"Y Lin","year":"2009","unstructured":"Lin, Y., Schrage, L.: The global solver in the LINDO API. Optim. Methods Softw. 24, 657\u2013668 (2009)","journal-title":"Optim. Methods Softw."},{"key":"491_CR28","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1080\/10556780802702278","volume":"24","author":"A Lundell","year":"2009","unstructured":"Lundell, A., Westerlund, T.: Convex underestimation strategies for signomial functions. Optim. Methods Softw. 24, 505\u2013522 (2009)","journal-title":"Optim. Methods Softw."},{"key":"491_CR29","unstructured":"MacMOOP Library. https:\/\/wiki.mcs.anl.gov\/leyffer\/index.php\/MacMOOP"},{"key":"491_CR30","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1007\/s10898-013-0139-x","volume":"60","author":"MC Mark\u00f3t","year":"2014","unstructured":"Mark\u00f3t, M.C., Schichl, H.: Bound constrained interval global optimization in the COCONUT environment. J. Glob. Optim. 60, 751\u2013776 (2014)","journal-title":"J. Glob. Optim."},{"key":"491_CR31","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/s10107-005-0580-9","volume":"103","author":"CA Meyer","year":"2005","unstructured":"Meyer, C.A., Floudas, C.A.: Convex envelopes for edge-concave functions. Math. Program. 103, 207\u2013224 (2005)","journal-title":"Math. Program."},{"key":"491_CR32","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1007\/s10898-014-0166-2","volume":"59","author":"R Misener","year":"2014","unstructured":"Misener, R., Floudas, C.A.: ANTIGONE: algorithms for continuous\/integer global optimization of nonlinear equations. J. Glob. Optim. 59, 503\u2013526 (2014)","journal-title":"J. Glob. Optim."},{"key":"491_CR33","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/355934.355936","volume":"7","author":"JJ Mor\u00e9","year":"1981","unstructured":"Mor\u00e9, J.J., Garbow, B.S., Hillstrom, K.E.: Testing unconstrained optimization software. ACM Trans. Math. Softw. 7, 17\u201341 (1981)","journal-title":"ACM Trans. Math. Softw."},{"key":"491_CR34","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BFb0092967","volume-title":"Numerical Analysis","author":"J Nocedal","year":"1982","unstructured":"Nocedal, J.: Solving large nonlinear systems of equations arising in mechanics. In: Hennart, J.P. (ed.) Numerical Analysis, pp. 132\u2013141. Springer, Berlin (1982)"},{"key":"491_CR35","unstructured":"Princeton Library. http:\/\/www.gamsworld.org\/performance\/princetonlib\/princetonlib.htm"},{"key":"491_CR36","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1016\/0098-1354(94)00097-2","volume":"19","author":"HS Ryoo","year":"1995","unstructured":"Ryoo, H.S., Sahinidis, N.V.: Global optimization of nonconvex NLPs and MINLPs with applications in process design. Comput. Chem. Eng. 19, 551\u2013566 (1995)","journal-title":"Comput. Chem. Eng."},{"key":"491_CR37","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/BF00138689","volume":"8","author":"HS Ryoo","year":"1996","unstructured":"Ryoo, H.S., Sahinidis, N.V.: A branch-and-reduce approach to global optimization. J. Glob. Optim. 8, 107\u2013139 (1996)","journal-title":"J. Glob. Optim."},{"key":"491_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-540-39901-8_1","volume-title":"Global Optimization and Constraint Satisfaction","author":"NV Sahinidis","year":"2003","unstructured":"Sahinidis, N.V.: Global optimization and constraint satisfaction: the branch-and-reduce approach. In: Bliek, C., Jermann, C., Neumaier, A. (eds.) Global Optimization and Constraint Satisfaction. Lecture Notes in Computer Science, vol. 2861, pp. 1\u201316. Springer, Berlin (2003)"},{"key":"491_CR39","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s10898-004-2705-8","volume":"32","author":"NV Sahinidis","year":"2005","unstructured":"Sahinidis, N.V., Tawarmalani, M.: Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints. J. Glob. Optim. 32, 259\u2013280 (2005)","journal-title":"J. Glob. Optim."},{"key":"491_CR40","doi-asserted-by":"crossref","first-page":"1035","DOI":"10.1137\/05063129X","volume":"17","author":"H Schichl","year":"2006","unstructured":"Schichl, H., Neumaier, A.: Transposition theorems and qualification-free optimality conditions. SIAM J. Optim. 17, 1035\u20131055 (2006)","journal-title":"SIAM J. Optim."},{"key":"491_CR41","volume-title":"Nonlinear Regression","author":"GAF Seber","year":"2005","unstructured":"Seber, G.A.F., Wild, C.J.: Nonlinear Regression. Wiley, Hoboken (2005)"},{"key":"491_CR42","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1008241411395","volume":"12","author":"JP Shectman","year":"1998","unstructured":"Shectman, J.P., Sahinidis, N.V.: A finite algorithm for global minimization of separable concave programs. J. Glob. Optim. 12, 1\u201336 (1998)","journal-title":"J. Glob. Optim."},{"key":"491_CR43","unstructured":"SymPy. http:\/\/sympy.org\/en\/index.html"},{"key":"491_CR44","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10107-012-0581-4","volume":"138","author":"M Tawarmalani","year":"2013","unstructured":"Tawarmalani, M., Richard, J.P., Xiong, C.: Explicit convex and concave envelopes through polyhedral subdivisions. Math. Program. 138, 531\u2013577 (2013)","journal-title":"Math. Program."},{"key":"491_CR45","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s10107-002-0308-z","volume":"93","author":"M Tawarmalani","year":"2002","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Convex extensions and convex envelopes of l.s.c. functions. Math. Program. 93, 247\u2013263 (2002)","journal-title":"Math. Program."},{"key":"491_CR46","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/s10107-003-0467-6","volume":"99","author":"M Tawarmalani","year":"2004","unstructured":"Tawarmalani, M., Sahinidis, N.V.: Global optimization of mixed-integer nonlinear programs: a theoretical and computational study. Math. Program. 99, 563\u2013591 (2004)","journal-title":"Math. Program."},{"key":"491_CR47","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1007\/s10107-005-0581-8","volume":"103","author":"M Tawarmalani","year":"2005","unstructured":"Tawarmalani, M., Sahinidis, N.V.: A polyhedral branch-and-cut approach to global optimization. Math. Program. 103, 225\u2013249 (2005)","journal-title":"Math. Program."},{"key":"491_CR48","doi-asserted-by":"crossref","first-page":"839","DOI":"10.1090\/S0025-5718-1978-0483452-7","volume":"32","author":"PL Toint","year":"1978","unstructured":"Toint, P.L.: Some numerical results using a sparse matrix updating formula in unconstrained optimization. Math. Comput. 32, 839\u2013851 (1978)","journal-title":"Math. Comput."},{"key":"491_CR49","doi-asserted-by":"crossref","first-page":"559","DOI":"10.1007\/s10107-004-0550-7","volume":"102","author":"D Vandenbussche","year":"2005","unstructured":"Vandenbussche, D., Nemhauser, G.L.: A branch-and-cut algorithm for nonconvex quadratic programs with box constraints. Math. Program. 102, 559\u2013575 (2005)","journal-title":"Math. Program."},{"key":"491_CR50","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1007\/s10107-004-0549-0","volume":"102","author":"D Vandenbussche","year":"2005","unstructured":"Vandenbussche, D., Nemhauser, G.L.: A polyhedral study of nonconvex quadratic programs with box constraints. Math. Program. 102, 531\u2013557 (2005)","journal-title":"Math. Program."},{"key":"491_CR51","first-page":"5","volume":"1","author":"G Wesolowsky","year":"1993","unstructured":"Wesolowsky, G.: The Weber problem: history and perspective. Locat. Sci. 1, 5\u201323 (1993)","journal-title":"Locat. Sci."},{"key":"491_CR52","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0262-8856(96)01112-2","volume":"15","author":"Z Zhang","year":"1997","unstructured":"Zhang, Z.: Parameter estimation techniques: a tutorial with application to conic fitting. Image Vis. Comput. 15, 59\u201376 (1997)","journal-title":"Image Vis. Comput."},{"key":"491_CR53","doi-asserted-by":"crossref","first-page":"442","DOI":"10.1080\/10556788.2013.783032","volume":"29","author":"K Zorn","year":"2013","unstructured":"Zorn, K., Sahinidis, N.V.: Global optimization of general nonconvex problems with intermediate bilinear substructures. Optim. Methods Softw. 29, 442\u2013462 (2013)","journal-title":"Optim. Methods Softw."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0491-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-016-0491-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-016-0491-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T12:49:09Z","timestamp":1718974149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-016-0491-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,12,27]]},"references-count":53,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,1]]}},"alternative-id":["491"],"URL":"https:\/\/doi.org\/10.1007\/s10898-016-0491-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,12,27]]}}}