{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T03:38:49Z","timestamp":1777088329114,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:00:00Z","timestamp":1775865600000},"content-version":"vor","delay-in-days":10,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000084","name":"Directorate for Engineering","doi-asserted-by":"publisher","award":["2211343"],"award-info":[{"award-number":["2211343"]}],"id":[{"id":"10.13039\/100000084","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2026,4]]},"abstract":"Abstract<\/jats:title>\n \n In this paper, we study the strength of convex relaxations obtained by convexification of aggregation of constraints for a set\n S<\/jats:italic>\n described by two bilinear bipartite equalities.\n Aggregation<\/jats:italic>\n is the process of rescaling the original constraints by scalar weights and adding the scaled constraints together. It is natural to study the aggregation technique as it yields a single bilinear bipartite equality whose convex hull is already understood from previous literature. On the theoretical side, we present sufficient conditions when\n \n \n $$\\text {conv} (S)$$<\/jats:tex-math>\n \n \n conv<\/mml:mtext>\n (<\/mml:mo>\n S<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n can be described by the intersection of convex hulls of a finite number of aggregations, examples when\n \n \n $$\\text {conv} (S)$$<\/jats:tex-math>\n \n \n conv<\/mml:mtext>\n (<\/mml:mo>\n S<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n can only be obtained as the intersection of the convex hull of an infinite number of aggregations, and examples when\n \n \n $$\\text {conv} (S)$$<\/jats:tex-math>\n \n \n conv<\/mml:mtext>\n (<\/mml:mo>\n S<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n cannot be achieved exactly from the process of aggregation. Computationally, we explore different methods to derive aggregation weights in order to obtain tight convex relaxations. We show that even if an exact convex hull may not be achieved using aggregations, including the convex hull of an aggregation often significantly tightens the outer approximation of\n \n \n $$\\text {conv} (S)$$<\/jats:tex-math>\n \n \n conv<\/mml:mtext>\n (<\/mml:mo>\n S<\/mml:mi>\n )<\/mml:mo>\n <\/mml:mrow>\n <\/mml:math>\n <\/jats:alternatives>\n <\/jats:inline-formula>\n . Finally, we apply the aggregation method to obtain convex relaxation for the structural model updating problem and show that this yields better bounds within a branch-and-bound tree as compared to not using aggregations.\n <\/jats:p>","DOI":"10.1007\/s10898-026-01607-8","type":"journal-article","created":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T02:02:06Z","timestamp":1775872926000},"page":"1099-1135","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Aggregation of bilinear bipartite equality constraints and its application to structural model updating problem"],"prefix":"10.1007","volume":"94","author":[{"given":"Santanu S.","family":"Dey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-5782-6278","authenticated-orcid":false,"given":"Dahye","family":"Han","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yang","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,4,11]]},"reference":[{"issue":"5","key":"1607_CR1","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1287\/opre.15.5.915","volume":"15","author":"E Balas","year":"1967","unstructured":"Balas, E.: Discrete programming by the filter method. Oper. Res. 15(5), 915\u2013957 (1967)","journal-title":"Oper. Res."},{"issue":"1","key":"1607_CR2","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1137\/22M1528215","volume":"34","author":"G Blekherman","year":"2024","unstructured":"Blekherman, G., Dey, S.S., Sun, S.: Aggregations of quadratic inequalities and hidden hyperplane convexity. SIAM J. Optim. 34(1), 98\u2013126 (2024)","journal-title":"SIAM J. Optim."},{"key":"1607_CR3","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10107-017-1192-x","volume":"171","author":"M Bodur","year":"2018","unstructured":"Bodur, M., Del Pia, A., Dey, S.S., Molinaro, M., Pokutta, S.: Aggregation-based cutting-planes for packing and covering integer programs. Math. Program. 171, 331\u2013359 (2018)","journal-title":"Math. Program."},{"issue":"1","key":"1607_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0167-6377(00)00067-5","volume":"28","author":"G Cornu\u00e9jols","year":"2001","unstructured":"Cornu\u00e9jols, G., Li, Y.: Elementary closures for integer programs. Oper. Res. Lett. 28(1), 1\u20138 (2001)","journal-title":"Oper. Res. Lett."},{"issue":"3","key":"1607_CR5","doi-asserted-by":"publisher","first-page":"1801","DOI":"10.1137\/16M1066166","volume":"27","author":"D Davarnia","year":"2017","unstructured":"Davarnia, D., Richard, J.-P.P., Tawarmalani, M.: Simultaneous convexification of bilinear functions over polytopes with application to network interdiction. SIAM J. Optim. 27(3), 1801\u20131833 (2017)","journal-title":"SIAM J. Optim."},{"key":"1607_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/s10107-018-1302-4","volume":"170","author":"SS Dey","year":"2018","unstructured":"Dey, S.S., Molinaro, M.: Theoretical challenges towards cutting-plane selection. Math. Program. 170, 237\u2013266 (2018)","journal-title":"Math. Program."},{"issue":"2","key":"1607_CR7","doi-asserted-by":"publisher","first-page":"659","DOI":"10.1137\/21M1428583","volume":"32","author":"SS Dey","year":"2022","unstructured":"Dey, S.S., Munoz, G., Serrano, F.: On obtaining the convex hull of quadratic inequalities via aggregations. SIAM J. Optim. 32(2), 659\u2013686 (2022)","journal-title":"SIAM J. Optim."},{"key":"1607_CR8","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s11081-018-9402-9","volume":"20","author":"SS Dey","year":"2019","unstructured":"Dey, S.S., Santana, A., Wang, Y.: New socp relaxation and branching rule for bipartite bilinear programs. Optim. Eng. 20, 307\u2013336 (2019)","journal-title":"Optim. Eng."},{"issue":"3","key":"1607_CR9","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1287\/opre.17.3.437","volume":"17","author":"AM Geoffrion","year":"1969","unstructured":"Geoffrion, A.M.: An improved implicit enumeration approach for integer programming. Oper. Res. 17(3), 437\u2013454 (1969)","journal-title":"Oper. Res."},{"issue":"6","key":"1607_CR10","doi-asserted-by":"publisher","first-page":"879","DOI":"10.1287\/opre.13.6.879","volume":"13","author":"F Glover","year":"1965","unstructured":"Glover, F.: A multiphase-dual algorithm for the zero-one integer programming problem. Oper. Res. 13(6), 879\u2013919 (1965)","journal-title":"Oper. Res."},{"issue":"3","key":"1607_CR11","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1287\/opre.23.3.434","volume":"23","author":"F Glover","year":"1975","unstructured":"Glover, F.: Surrogate constraint duality in mathematical programming. Oper. Res. 23(3), 434\u2013451 (1975)","journal-title":"Oper. Res."},{"issue":"5","key":"1607_CR12","doi-asserted-by":"publisher","first-page":"924","DOI":"10.1287\/opre.18.5.924","volume":"18","author":"HJ Greenberg","year":"1970","unstructured":"Greenberg, H.J., Pierskalla, W.P.: Surrogate mathematical programming. Oper. Res. 18(5), 924\u2013939 (1970)","journal-title":"Oper. Res."},{"key":"1607_CR13","volume-title":"Santanu S Dey, and Jean-Philippe P Richard","author":"G Xiaoyi","year":"2024","unstructured":"Xiaoyi, G.: Santanu S Dey, and Jean-Philippe P Richard. Solving sparse separable bilinear programs using lifted bilinear cover inequalities, INFORMS Journal on Computing (2024)"},{"issue":"2","key":"1607_CR14","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1287\/moor.2023.0001","volume":"50","author":"E Khademnia","year":"2025","unstructured":"Khademnia, E., Davarnia, D.: Convexification of bilinear terms over network polytopes. Math. Oper. Res. 50(2), 1019\u20131041 (2025)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"1607_CR15","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/BF01075048","volume":"26","author":"AG Khovanskii","year":"1992","unstructured":"Khovanskii, A.G.: Newton polyhedron, hilbert polynomial, and sums of finite sets. Funct. Anal. Appl. 26(4), 276\u2013281 (1992)","journal-title":"Funct. Anal. Appl."},{"key":"1607_CR16","unstructured":"Kim, K.: BranchAndBound.jl. https:\/\/github.com\/kibaekkim\/BranchAndBound.jl, (2020)"},{"issue":"1","key":"1607_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF01389769","volume":"32","author":"AG Kouchnirenko","year":"1976","unstructured":"Kouchnirenko, A.G.: Polyedres de newton et nombres de milnor. Invent. Math. 32(1), 1\u201331 (1976)","journal-title":"Invent. Math."},{"issue":"3","key":"1607_CR18","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1287\/opre.49.3.363.11211","volume":"49","author":"H Marchand","year":"2001","unstructured":"Marchand, H., Wolsey, L.A.: Aggregation and mixed integer rounding to solve mips. Oper. Res. 49(3), 363\u2013371 (2001)","journal-title":"Oper. Res."},{"issue":"1","key":"1607_CR19","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 i\u2013convex underestimating problems. Math. Program. 10(1), 147\u2013175 (1976)","journal-title":"Math. Program."},{"issue":"1","key":"1607_CR20","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/s10107-021-01691-6","volume":"192","author":"B M\u00fcller","year":"2022","unstructured":"M\u00fcller, B., Mu\u00f1oz, G., Gasse, M., Gleixner, A., Lodi, A., Serrano, F.: On generalized surrogate duality in mixed-integer nonlinear programming. Math. Program. 192(1), 89\u2013118 (2022)","journal-title":"Math. Program."},{"key":"1607_CR21","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/s13349-020-00468-3","volume":"11","author":"Yu Otsuki","year":"2021","unstructured":"Otsuki, Yu., Li, D., Dey, S.S., Kurata, M., Wang, Y.: Finite element model updating of an 18-story structure using branch-and-bound algorithm with epsilon-constraint. J. Civ. Struct. Heal. Monit. 11, 575\u2013592 (2021)","journal-title":"J. Civ. Struct. Heal. Monit."},{"issue":"4","key":"1607_CR22","doi-asserted-by":"publisher","first-page":"2983","DOI":"10.1137\/19M1277333","volume":"30","author":"A Santana","year":"2020","unstructured":"Santana, A., Dey, S.S.: The convex hull of a quadratic constraint over a polytope. SIAM J. Optim. 30(4), 2983\u20132997 (2020)","journal-title":"SIAM J. Optim."},{"key":"1607_CR23","doi-asserted-by":"crossref","unstructured":"Schreiber, T.E., Otsuki, Y., Wang, Y.: Finite element model updating using primal-relaxed dual global optimization algorithm. Struct. Health Monit. 2023, (2023)","DOI":"10.12783\/shm2023\/36808"},{"key":"1607_CR24","doi-asserted-by":"crossref","unstructured":"Shah, P., Dey, S.S., Molinaro, M.: Non-monotonicity of branching rules with respect to linear relaxations. arXiv preprint arXiv:2402.05213, (2024)","DOI":"10.1287\/ijoc.2024.0709.cd"},{"key":"1607_CR25","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, 25\u201357 (2006)","journal-title":"Math. Program."},{"key":"1607_CR26","unstructured":"Yakubovich, V.A.: S-procedure in nonlinear control theory. Vestnik Leningrad University, Series: Mathematics 1, 62\u201377 (1971) In Russian. Available online: http:\/\/tcyber.ru\/tk_media\/library\/papers_v\/096r.djvu"},{"issue":"4","key":"1607_CR27","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1093\/imamci\/dnp023","volume":"26","author":"U Yildiran","year":"2009","unstructured":"Yildiran, U.: Convex hull of two quadratic constraints is an lmi set. IMA J. Math. Control. Inf. 26(4), 417\u2013450 (2009)","journal-title":"IMA J. Math. Control. Inf."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-026-01607-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-026-01607-8","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-026-01607-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T02:57:04Z","timestamp":1777085824000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-026-01607-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":27,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2026,4]]}},"alternative-id":["1607"],"URL":"https:\/\/doi.org\/10.1007\/s10898-026-01607-8","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"17 October 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 March 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 April 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}