{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T20:59:41Z","timestamp":1771275581729,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T00:00:00Z","timestamp":1672444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T00:00:00Z","timestamp":1672444800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"SPS KAKENHI","award":["JP20H04145"],"award-info":[{"award-number":["JP20H04145"]}]},{"name":"NRF","award":["NRF 2021-R1A2C1003810"],"award-info":[{"award-number":["NRF 2021-R1A2C1003810"]}]},{"name":"the Sao Paulo Research Foundation (FAPESP).","award":["2020\/04585-7 and 2018\/24293-0"],"award-info":[{"award-number":["2020\/04585-7 and 2018\/24293-0"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2023,7]]},"DOI":"10.1007\/s10898-022-01268-3","type":"journal-article","created":{"date-parts":[[2022,12,31]],"date-time":"2022-12-31T09:07:36Z","timestamp":1672477656000},"page":"671-691","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Exact SDP relaxations for quadratic programs with bipartite graph structures"],"prefix":"10.1007","volume":"86","author":[{"given":"Godai","family":"Azuma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mituhiro","family":"Fukuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sunyoung","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Makoto","family":"Yamashita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,12,31]]},"reference":[{"key":"1268_CR1","volume-title":"Elementary Linear Algebra: Applications Version","author":"H Anton","year":"2014","unstructured":"Anton, H., Rorres, C.: Elementary Linear Algebra: Applications Version, 11th edn. John Wiley & Sons Inc., London (2014)","edition":"11"},{"key":"1268_CR2","unstructured":"Argue, C.J., K\u0131l\u0131n\u00e7-Karzan, F., Wang, A.L.: Necessary and sufficient conditions for rank-one generated cones. arXiv:2007.07433 (2020)"},{"issue":"2","key":"1268_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10898-021-01071-6","volume":"82","author":"G Azuma","year":"2022","unstructured":"Azuma, G., Fukuda, M., Kim, S., Yamashita, M.: Exact SDP relaxations of quadratically constrained quadratic programs with forest structures. J. Global Optim. 82(2), 243\u2013262 (2022)","journal-title":"J. Global Optim."},{"key":"1268_CR4","doi-asserted-by":"crossref","unstructured":"Biswas, P., Ye, Y.: Semidefinite programming for ad hoc wireless sensor network localization. In: Proceedings of the Third International Symposium on Information Processing in Sensor Networks, pp. 46\u201354. ACM, New York (2004)","DOI":"10.1145\/984622.984630"},{"issue":"1","key":"1268_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-019-01367-2","volume":"181","author":"S Burer","year":"2020","unstructured":"Burer, S., Ye, Y.: Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. Math. Program. 181(1), 1\u201317 (2020)","journal-title":"Math. Program."},{"issue":"2","key":"1268_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1137\/15M1020575","volume":"59","author":"I Dunning","year":"2017","unstructured":"Dunning, I., Huchette, J., Lubin, M.: JuMP: a modeling language for mathematical optimization. SIAM Rev. 59(2), 295\u2013320 (2017)","journal-title":"SIAM Rev."},{"issue":"6","key":"1268_CR7","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J. ACM 42(6), 1115\u20131145 (1995)","journal-title":"J. ACM"},{"issue":"2","key":"1268_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1080\/03081089208818155","volume":"32","author":"R Grone","year":"1992","unstructured":"Grone, R., Loewy, R., Pierce, S.: Nonchordal positive semidefinite stochastic matrices. Linear Multilinear Algebra 32(2), 107\u2013113 (1992)","journal-title":"Linear Multilinear Algebra"},{"key":"1268_CR9","unstructured":"Hsia, Y., Sheu, R.-L.: Trust region subproblem with a fixed number of additional linear inequality constraints has polynomial complexity. arXiv:1312.1398 (2013)"},{"issue":"1\u20132","key":"1268_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1007\/s10107-013-0716-2","volume":"147","author":"V Jeyakumar","year":"2014","unstructured":"Jeyakumar, V., Li, G.Y.: Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization. Math. Program. 147(1\u20132), 171\u2013206 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"1268_CR11","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1025794313696","volume":"26","author":"S Kim","year":"2003","unstructured":"Kim, S., Kojima, M.: Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations. Comput. Optim. Appl. 26(2), 143\u2013154 (2003)","journal-title":"Comput. Optim. Appl."},{"key":"1268_CR12","doi-asserted-by":"crossref","unstructured":"Kim, S., Kojima, M.: Strong duality of a conic optimization problem with a single hyperplane and two cone constraints. arXiv:2111.03251v3 (2022)","DOI":"10.1080\/02331934.2023.2251987"},{"issue":"1","key":"1268_CR13","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1137\/080713380","volume":"20","author":"S Kim","year":"2009","unstructured":"Kim, S., Kojima, M., Waki, H.: Exploiting sparsity in SDP relaxation for sensor network localization. SIAM J. Optim. 20(1), 192\u2013215 (2009)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1268_CR14","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10898-019-00795-w","volume":"75","author":"M Kimizuka","year":"2019","unstructured":"Kimizuka, M., Kim, S., Yamashita, M.: Solving pooling problems with time discretization by LP and SOCP relaxations and rescheduling methods. J. Global Optim. 75(3), 631\u2013654 (2019)","journal-title":"J. Global Optim."},{"issue":"1","key":"1268_CR15","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1109\/TPWRS.2011.2160974","volume":"27","author":"J Lavaei","year":"2012","unstructured":"Lavaei, J., Low, S.H.: Zero duality gap in optimal power flow problem. IEEE Trans. Power Syst. 27(1), 92\u2013107 (2012)","journal-title":"IEEE Trans. Power Syst."},{"issue":"6","key":"1268_CR16","doi-asserted-by":"publisher","first-page":"1141","DOI":"10.1007\/s11590-016-1001-0","volume":"10","author":"M Locatelli","year":"2016","unstructured":"Locatelli, M.: Exactness conditions for an SDP relaxation of the extended trust region problem. Optim. Lett. 10(6), 1141\u20131151 (2016)","journal-title":"Optim. Lett."},{"key":"1268_CR17","unstructured":"MOSEK ApS. Mosek\/mosek.jl: Interface to the Mosek solver in Julia, 2022. https:\/\/github.com\/MOSEK\/Mosek.jl (2002). Accessed 9 April 2022"},{"issue":"3","key":"1268_CR18","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1137\/S003614450444614X","volume":"49","author":"I P\u00f3lik","year":"2007","unstructured":"P\u00f3lik, I., Terlaky, T.: A survey of the S-lemma. SIAM Rev. 49(3), 371\u2013418 (2007)","journal-title":"SIAM Rev."},{"issue":"3","key":"1268_CR19","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.disopt.2009.01.002","volume":"6","author":"J Povh","year":"2009","unstructured":"Povh, J., Rendl, F.: Copositive and semidefinite relaxations of the quadratic assignment problem. Discret. Optim. 6(3), 231\u2013241 (2009)","journal-title":"Discret. Optim."},{"key":"1268_CR20","doi-asserted-by":"crossref","unstructured":"Sheen, H., Yamashita, M.: Exploiting aggregate sparsity in second-order cone relaxations for quadratic constrained quadratic programming problems. Optim. Methods Soft. 1\u201319 (2020)","DOI":"10.1080\/10556788.2020.1827256"},{"issue":"2\u20133","key":"1268_CR21","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s10107-006-0040-1","volume":"109","author":"AM So","year":"2007","unstructured":"So, A.M., Ye, Y.: Theory of semidefinite programming for sensor network localization. Math. Program. 109(2\u20133), 367\u2013384 (2007)","journal-title":"Math. Program."},{"issue":"4","key":"1268_CR22","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1137\/130915261","volume":"24","author":"S Sojoudi","year":"2014","unstructured":"Sojoudi, S., Lavaei, J.: Exactness of semidefinite relaxations for nonlinear optimization problems with underlying graph structure. SIAM J. Optim. 24(4), 1746\u20131778 (2014)","journal-title":"SIAM J. Optim."},{"key":"1268_CR23","unstructured":"Wang, A.L., K\u0131l\u0131n\u00e7-Karzan, F.: A geometric view of SDP exactness in QCQPs and its applications. arXiv:2011.07155v3 (2021)"},{"key":"1268_CR24","doi-asserted-by":"crossref","unstructured":"Wang, A.L., K\u0131l\u0131n\u00e7-Karzan, F.: On the tightness of SDP relaxations of QCQPs. Math. Program. (2021)","DOI":"10.1007\/s10107-020-01589-9"},{"issue":"6","key":"1268_CR25","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1007\/s11590-014-0812-0","volume":"9","author":"S Wang","year":"2015","unstructured":"Wang, S., Xia, Y.: Strong duality for generalized trust region subproblem: S-lemma with interval bounds. Optim. Lett. 9(6), 1063\u20131073 (2015)","journal-title":"Optim. Lett."},{"key":"1268_CR26","first-page":"62","volume":"1","author":"VA Yakubovich","year":"1971","unstructured":"Yakubovich, V.A.: S-procedure in nonlinear control theory. Vestnik Leningrad Univ. Math. 1, 62\u201377 (1971)","journal-title":"Vestnik Leningrad Univ. Math."},{"issue":"1","key":"1268_CR27","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1023\/A:1009795911987","volume":"2","author":"Q Zhao","year":"1998","unstructured":"Zhao, Q., Karisch, S., Rendl, F., Wolkowicz, H.: Semidefinite programming relaxations for the quadratic assignment problem. J. Comb. Optim. 2(1), 71\u2013109 (1998)","journal-title":"J. Comb. Optim."},{"key":"1268_CR28","doi-asserted-by":"crossref","unstructured":"Zhou, F., Chen, Y., Low, S.H.: Sufficient conditions for exact semidefinite relaxation of optimal power flow in unbalanced multiphase radial networks. In: IEEE 58th Conference on Decision and Control (CDC), vol. 58, pp. 6227\u20136233 (2019)","DOI":"10.1109\/CDC40024.2019.9029827"}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01268-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-022-01268-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-022-01268-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,3]],"date-time":"2023-12-03T20:08:30Z","timestamp":1701634110000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-022-01268-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,12,31]]},"references-count":28,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,7]]}},"alternative-id":["1268"],"URL":"https:\/\/doi.org\/10.1007\/s10898-022-01268-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,12,31]]},"assertion":[{"value":"20 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 December 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 December 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}