{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,7]],"date-time":"2025-03-07T05:13:00Z","timestamp":1741324380881,"version":"3.38.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T00:00:00Z","timestamp":1733788800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T00:00:00Z","timestamp":1733788800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100004085","name":"Ministry of Education, Science and Technology","doi-asserted-by":"publisher","award":["NRF 2021-R1A2C1003810"],"award-info":[{"award-number":["NRF 2021-R1A2C1003810"]}],"id":[{"id":"10.13039\/501100004085","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["Grant-in-Aid for Scientific Research (A) 19H00808"],"award-info":[{"award-number":["Grant-in-Aid for Scientific Research (A) 19H00808"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math Meth Oper Res"],"published-print":{"date-parts":[[2025,2]]},"DOI":"10.1007\/s00186-024-00885-w","type":"journal-article","created":{"date-parts":[[2024,12,10]],"date-time":"2024-12-10T04:34:11Z","timestamp":1733805251000},"page":"73-94","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Equivalent sufficient conditions for global optimality of quadratically constrained quadratic programs"],"prefix":"10.1007","volume":"101","author":[{"given":"Sunyoung","family":"Kim","sequence":"first","affiliation":[]},{"given":"Masakazu","family":"Kojima","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,12,10]]},"reference":[{"key":"885_CR1","unstructured":"Arima N, Kim S, Kojima M (2024) Exact sdp relaxations for a class of quadratic programs with finite and infinite quadratic constraints. Technical Report arXiv:2409.07213, September"},{"key":"885_CR2","doi-asserted-by":"crossref","unstructured":"Arima N, Kim S, Kojima M (2024a) Further development in convex conic reformulation of geometric nonconvex conic optimization problems. SIAM J Optim 34(4):3194\u20133211","DOI":"10.1137\/23M1593346"},{"issue":"3","key":"885_CR3","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s10898-022-01268-3","volume":"86","author":"G Azuma","year":"2023","unstructured":"Azuma G, Fukuda M, Kim S, Yamashita M (2023) Exact SDP relaxations of quadratically constrained quadratic programs with bipartite graph structures. J Global Optim 86(3):671\u2013691","journal-title":"J Global Optim"},{"issue":"3","key":"885_CR4","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1007\/s10898-022-01268-3","volume":"86","author":"G Azuma","year":"2023","unstructured":"Azuma G, Fukuda M, Kim S, Yamashita M (2023a) Exact SDP relaxations for quadratic programs with bipartite graph structures. J Glob Optim 86(3):671\u2013691. https:\/\/doi.org\/10.1007\/s10898-022-01268-3","journal-title":"J Glob Optim"},{"key":"885_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/s10107-011-0462-2","volume":"129","author":"NV Bao","year":"2011","unstructured":"Bao NV, Sahinidis X, Tawarmalani M (2011) Semidefinite relaxations for quadratically constrained quadratic programming: A review and comparisons. Math Progr 129:129\u2013157","journal-title":"Math Progr"},{"key":"885_CR6","doi-asserted-by":"publisher","DOI":"10.1002\/0471787779","volume-title":"Nonlinear programming: theory and algorithms","author":"Mokhtar S. Bazaraa","year":"2005","unstructured":"Bazaraa Mokhtar S., Sherali Hanif D., Shetty C. M. (2005) Nonlinear programming: theory and algorithms. Wiley, New York. https:\/\/doi.org\/10.1002\/0471787779"},{"key":"885_CR7","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10107-008-0223-z","volume":"120","author":"S Burer","year":"2009","unstructured":"Burer S (2009) On the copositive representation of binary and continuous non-convex quadratic programs. Math Progr 120:479\u2013495","journal-title":"Math Progr"},{"key":"885_CR8","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 (2020) Exact semidefinite formulations for a class of (random and non-random) nonconvex quadratic programs. Math Progr 181:1\u201317","journal-title":"Math Progr"},{"issue":"4","key":"885_CR9","doi-asserted-by":"publisher","first-page":"875","DOI":"10.1137\/S1052623401383248","volume":"12","author":"E de Klerk","year":"2002","unstructured":"de Klerk E, Pasechnik DV (2002) Approximation of the Stability Number of a Graph via Copositive Programming. SIAM J Optim 12(4):875\u2013892. https:\/\/doi.org\/10.1137\/S1052623401383248","journal-title":"SIAM J Optim"},{"issue":"1","key":"885_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1287\/moor.2016.0793","volume":"42","author":"M D\u00fcr","year":"2017","unstructured":"D\u00fcr M, Jargalsaikhan B, Still G (2017) Genericity results in linear conic programming\u2013a tour d\u00f3rizon. Math Oper Res 42(1):77\u201394","journal-title":"Math Oper Res"},{"key":"885_CR11","doi-asserted-by":"publisher","first-page":"100021","DOI":"10.1016\/j.ejco.2021.100021","volume":"9","author":"M D\u00fcr","year":"2021","unstructured":"D\u00fcr M, Rendl F (2021) Conic optimization: a survey with special focus on copositive optimization and binary quadratic problems. EURO J Comput Optim 9:100021","journal-title":"EURO J Comput Optim"},{"key":"885_CR12","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1023\/A:1008282830093","volume":"10","author":"T Fujie","year":"1997","unstructured":"Fujie T, Kojima M (1997) Semidefinite programming relaxation for nonconvex quadratic programs. J of Global Optim 10:367\u2013368","journal-title":"J of Global Optim"},{"key":"885_CR13","doi-asserted-by":"crossref","unstructured":"Fujii K, Kim S, Kojima M, Mittelmann HD, Shinano Y (2023) An exceptionally difficult binary quadratic optimization problem with symmetry: a challenge for the largest unsolved qap instance tai256c. Technical Report arXiv:2401.09439, To appear in Optimization Letters","DOI":"10.1007\/s11590-024-02157-2"},{"issue":"6","key":"885_CR14","doi-asserted-by":"publisher","first-page":"1115","DOI":"10.1145\/227683.227684","volume":"42","author":"MX Goemans","year":"1995","unstructured":"Goemans MX, Williamson DP (1995) Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. J ACM 42(6):1115\u20131145","journal-title":"J ACM"},{"issue":"4","key":"885_CR15","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1007\/s10898-018-0676-4","volume":"72","author":"N Ito","year":"2018","unstructured":"Ito N, Kim S, Kojima M, Takeda A, Toh KC (2018) Equivalences and differences in conic relaxations of combinatorial quadratic optimization problems. J Global Optim 72(4):619\u2013653","journal-title":"J Global Optim"},{"key":"885_CR16","volume-title":"BBCPOP: a sparse doubly nonnegative relaxation of polynomial optimization problems with binary, box and complementarity constraints","author":"N Ito","year":"2019","unstructured":"Ito N, Kim S, Kojima M, Takeda A, Toh KC (2019) BBCPOP: a sparse doubly nonnegative relaxation of polynomial optimization problems with binary, box and complementarity constraints. ACM Trans. Math. Softw, To appear"},{"issue":"1\u20132","key":"885_CR17","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 GY (2014) Trust-region problems with linear inequality constraints: exact SDP relaxation, global optimality and robust optimization. Math Progr 147(1\u20132):171\u2013206. https:\/\/doi.org\/10.1007\/s10107-013-0716-2","journal-title":"Math Progr"},{"issue":"2","key":"885_CR18","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1023\/A:1025794313696","volume":"26","author":"S Kim","year":"2003","unstructured":"Kim S, Kojima M (2003) Exact solutions of some nonconvex quadratic optimization problems via SDP and SOCP relaxations. Comput Optim Appl 26(2):143\u2013154","journal-title":"Comput Optim Appl"},{"key":"885_CR19","unstructured":"Kim S, Kojima M Strong duality of a conic optimization problem with a single hyperplane and two cone constraints strong duality of a conic optimization problem with a single hyperplane and two cone constraints. Optimization, To appear"},{"key":"885_CR20","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1007\/s10107-015-0874-5","volume":"156","author":"S Kim","year":"2016","unstructured":"Kim S, Kojima M, Toh KC (2016) A Lagrangian-DNN relaxation: a fast method for computing tight lower bounds for a class of quadratic optimization problems. Math Prog 156:161\u2013187","journal-title":"Math Prog"},{"issue":"3","key":"885_CR21","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s10898-020-00879-y","volume":"77","author":"S Kim","year":"2020","unstructured":"Kim S, Kojima M, Toh KC (2020) Doubly nonnegative relaxations are equivalent to completely positive reformulations of quadratic optimization problems with block-clique graph structures. J Global Optim 77(3):513\u2013541","journal-title":"J Global Optim"},{"key":"885_CR22","doi-asserted-by":"publisher","first-page":"1251","DOI":"10.1137\/19M1237715","volume":"30","author":"S Kim","year":"2020","unstructured":"Kim S, Kojima M, Toh KC (2020) A geometrical analysis of a class of nonconvex conic programs for convex conic reformulations of quadratic and polynomial optimization problems. SIAM J Optim 30:1251\u20131273","journal-title":"SIAM J Optim"},{"key":"885_CR23","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1080\/10556788.2020.1782906","volume":"36","author":"S Kim","year":"2021","unstructured":"Kim S, Kojima M, Toh KC (2021) A Newton-bracketing method for a simple conic optimization problem. Optim Methods and Softw 36:371\u2013388","journal-title":"Optim Methods and Softw"},{"issue":"4","key":"885_CR24","doi-asserted-by":"publisher","first-page":"1475","DOI":"10.1137\/100793955","volume":"21","author":"C Lu","year":"2011","unstructured":"Lu C, Fang S-C, Jin Q, Wang Z, Xing W (2011) KKT solution and conic relaxation for solving quadratically constrained quadratic programming problems. SIAM J Optim 21(4):1475\u20131490","journal-title":"SIAM J Optim"},{"key":"885_CR25","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1016\/j.ejor.2005.09.032","volume":"176","author":"EM Loiola","year":"2007","unstructured":"Loiola EM, de Abreu NMM, Boaventura-Netto PO, Hahn P, Querido T (2007) A survey for the quadratic assignment problem. Eur J Oper Res 176:657\u2013690","journal-title":"Eur J Oper Res"},{"key":"885_CR26","volume-title":"Nonlinear Programming","author":"OL Mangasarian","year":"1969","unstructured":"Mangasarian OL (1969) Nonlinear Programming. McGraw-Hill, New York"},{"issue":"1","key":"885_CR27","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1142\/S0217595910002533","volume":"27","author":"M Mevissen","year":"2010","unstructured":"Mevissen M, Kojima M (2010) SDP relaxations for quadratic optimization problems derived from polynomial optimization problems. Asia-Pacific J Oper Res 27(1):15\u201338","journal-title":"Asia-Pacific J Oper Res"},{"key":"885_CR28","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/050637467","volume":"18","author":"J Povh","year":"2007","unstructured":"Povh J, Rendl F (2007) A copositive programming approach to graph partitioning. SIAM J Optim 18:223\u2013241","journal-title":"SIAM J Optim"},{"key":"885_CR29","first-page":"1","volume":"25","author":"NZ Shor","year":"1987","unstructured":"Shor NZ (1987) Quadratic optimization problems. Sov J Comput Syst Sci 25:1\u201311","journal-title":"Sov J Comput Syst Sci"},{"key":"885_CR30","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF02283692","volume":"25","author":"NZ Shor","year":"1990","unstructured":"Shor NZ (1990) Dual quadratic estimates in polynomial and boolean programming. Ann Oper Res 25:163\u2013168","journal-title":"Ann Oper Res"},{"issue":"4","key":"885_CR31","doi-asserted-by":"publisher","first-page":"1746","DOI":"10.1137\/130915261","volume":"24","author":"S Sojoudi","year":"2014","unstructured":"Sojoudi S, Lavaei J (2014) Exactness of semidefinite relaxations for nonlinear optimization problems with underlying graph structure. SIAM J Optim 24(4):1746\u20131778","journal-title":"SIAM J Optim"},{"key":"885_CR32","doi-asserted-by":"publisher","first-page":"625","DOI":"10.1080\/10556789908805766","volume":"11 &12","author":"JF Sturm","year":"1999","unstructured":"Sturm JF (1999) SeDuMi 1.02, a MATLAB toolbox for optimization over symmetric cones. Optim Methods Softw 11 &12:625\u2013653","journal-title":"Optim Methods Softw"},{"key":"885_CR33","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/s10107-020-01589-9","volume":"193","author":"AL Wang","year":"2022","unstructured":"Wang AL, Kilinc-Karzan F (2022) On the tightness of SDP relaxations of QCQPs. Math Prog 193:33\u201373","journal-title":"Math Prog"},{"key":"885_CR34","doi-asserted-by":"crossref","unstructured":"Yoshise A, Matsukawa Y (2010) On optimization over the doubly nonnegative cone. In: IEEE Multi-conference on Systems and Control","DOI":"10.1109\/CACSD.2010.5612811"},{"key":"885_CR35","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1007\/s101070050006","volume":"87","author":"S Zhang","year":"2000","unstructured":"Zhang S (2000) Quadratic optimization and semidefinite relaxation. Math Prog 87:453\u2013465","journal-title":"Math Prog"}],"container-title":["Mathematical Methods of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-024-00885-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00186-024-00885-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00186-024-00885-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,6]],"date-time":"2025-03-06T12:17:37Z","timestamp":1741263457000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00186-024-00885-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,12,10]]},"references-count":35,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2025,2]]}},"alternative-id":["885"],"URL":"https:\/\/doi.org\/10.1007\/s00186-024-00885-w","relation":{},"ISSN":["1432-2994","1432-5217"],"issn-type":[{"type":"print","value":"1432-2994"},{"type":"electronic","value":"1432-5217"}],"subject":[],"published":{"date-parts":[[2024,12,10]]},"assertion":[{"value":"14 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 November 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 November 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 December 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}