{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:20:49Z","timestamp":1740122449931,"version":"3.37.3"},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11822103,12171021"],"award-info":[{"award-number":["11822103,12171021"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Beijing Natural Science Foundation","award":["Z180005"],"award-info":[{"award-number":["Z180005"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2022,9]]},"DOI":"10.1007\/s10878-022-00881-y","type":"journal-article","created":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T19:02:36Z","timestamp":1656702156000},"page":"1099-1103","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Comment on \u201cApproximation algorithms for quadratic programming\u201d"],"prefix":"10.1007","volume":"44","author":[{"given":"Tongli","family":"Zhang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3522-7446","authenticated-orcid":false,"given":"Yong","family":"Xia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,1]]},"reference":[{"key":"881_CR1","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/15M1009871","volume":"26","author":"D Bienstock","year":"2016","unstructured":"Bienstock D (2016) A note on polynomial solvability of the CDT problem. SIAM Journal on Optimization 26:488\u2013498","journal-title":"SIAM Journal on Optimization"},{"key":"881_CR2","doi-asserted-by":"crossref","unstructured":"Boyd S, Vandenberghe L (2004) Convex optimization. Cambridge University press","DOI":"10.1017\/CBO9780511804441"},{"key":"881_CR3","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-016-1073-8","volume":"164","author":"L Consolini","year":"2017","unstructured":"Consolini L, Locatelli M (2017) On the complexity of quadratic programming with two quadratic constraints. Mathematical Programming 164:91\u2013127","journal-title":"Mathematical Programming"},{"key":"881_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1023\/A:1009739827008","volume":"2","author":"M Fu","year":"1998","unstructured":"Fu M, Luo Z-Q, Ye Y (1998) Approximation algorithms for quadratic programming. Journal of Combinatorial Optimization 2:29\u201350","journal-title":"Journal of Combinatorial Optimization"},{"key":"881_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1026454804250","volume":"108","author":"D Henrion","year":"2001","unstructured":"Henrion D, Tarbouriech S, Arzelier D (2001) LMI approximations for the radius of the intersection of ellipsoids: survey. Journal of Optimization Theory and Applications 108:1\u201328","journal-title":"Journal of Optimization Theory and Applications"},{"key":"881_CR6","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/j.orl.2015.05.002","volume":"43","author":"Y Hsia","year":"2015","unstructured":"Hsia Y, Wang S, Xu Z (2015) Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints. Operations Research Letters 43:378\u2013383","journal-title":"Operations Research Letters"},{"key":"881_CR7","doi-asserted-by":"crossref","unstructured":"Lov\u00e1sz L (1986) An algorithmic theory of numbers, graphs and convexity. SIAM","DOI":"10.1137\/1.9781611970203"},{"key":"881_CR8","volume-title":"Interior point polynomial methods in convex programming: theory and algorithms","author":"YuE Nesterov","year":"1993","unstructured":"Nesterov YuE, Nemirovskii AS (1993) Interior point polynomial methods in convex programming: theory and algorithms. SIAM Publications, Philadelphia"},{"key":"881_CR9","doi-asserted-by":"publisher","first-page":"1669","DOI":"10.1137\/15100624X","volume":"36","author":"S Sakaue","year":"2016","unstructured":"Sakaue S, Nakatsukasa Y, Takeda A, Lwata S (2016) Solving generalized CDT problems via two-parameter eigenvalues. SIAM Journal on Optimization 36:1669\u20131694","journal-title":"SIAM Journal on Optimization"},{"key":"881_CR10","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1137\/S1052623401395899","volume":"14","author":"P Tseng","year":"2003","unstructured":"Tseng P (2003) Further results on approximating nonconvex quadratic optimization by semidefinite programming relaxation. SIAM Journal on Optimization 14:268\u2013283","journal-title":"SIAM Journal on Optimization"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00881-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10878-022-00881-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-022-00881-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,13]],"date-time":"2022-08-13T06:15:34Z","timestamp":1660371334000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10878-022-00881-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,1]]},"references-count":10,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,9]]}},"alternative-id":["881"],"URL":"https:\/\/doi.org\/10.1007\/s10878-022-00881-y","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2022,7,1]]},"assertion":[{"value":"20 June 2022","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2022","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no known competing financial interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}