{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,27]],"date-time":"2026-04-27T20:56:15Z","timestamp":1777323375928,"version":"3.51.4"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,1,9]],"date-time":"2021-01-09T00:00:00Z","timestamp":1610150400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,9]],"date-time":"2021-01-09T00:00:00Z","timestamp":1610150400000},"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"],"award-info":[{"award-number":["11822103"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11571029"],"award-info":[{"award-number":["11571029"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11771056"],"award-info":[{"award-number":["11771056"]}],"id":[{"id":"10.13039\/501100001809","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":[[2021,6]]},"DOI":"10.1007\/s10898-020-00985-x","type":"journal-article","created":{"date-parts":[[2021,1,9]],"date-time":"2021-01-09T07:03:33Z","timestamp":1610175813000},"page":"341-356","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Cheaper relaxation and better approximation for multi-ball constrained quadratic optimization and extension"],"prefix":"10.1007","volume":"80","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9531-9791","authenticated-orcid":false,"given":"Zhuoyi","family":"Xu","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3522-7446","authenticated-orcid":false,"given":"Yong","family":"Xia","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5310-2348","authenticated-orcid":false,"given":"Jiulin","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,1,9]]},"reference":[{"key":"985_CR1","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1137\/07070601X","volume":"19","author":"WB Ai","year":"2009","unstructured":"Ai, W.B., Zhang, S.Z.: Strong duality for the CDT subproblem: a necessary and sufficient condition. SIAM J. Optim. 19, 1735\u20131756 (2009)","journal-title":"SIAM J. Optim."},{"key":"985_CR2","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/s10898-006-9127-8","volume":"39","author":"A Beck","year":"2007","unstructured":"Beck, A.: On the convexity of a class of quadratic mappings and its application to the problem of finding the smallest ball enclosing a given intersection of balls. J. Glob. Optim. 39, 113\u2013126 (2007)","journal-title":"J. Glob. Optim."},{"key":"985_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10957-009-9539-y","volume":"142","author":"A Beck","year":"2009","unstructured":"Beck, A.: Convexity properties associated with nonconvex quadratic matrix functions and applications to quadratic programming. J. Optim. Theory Appl. 142, 1\u201329 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"985_CR4","first-page":"429","volume":"69","author":"M Bellare","year":"1995","unstructured":"Bellare, M., Rogaway, P.: The complexity of approximating a nonlinear program. Math. Program. 69, 429\u2013441 (1995)","journal-title":"Math. Program."},{"key":"985_CR5","doi-asserted-by":"crossref","unstructured":"Bienstock, D., Michalka, A.: Polynomial solvability of variants of the trust-region subproblem. In: Chekuri C. (ed.) Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 380\u2013390. SIAM, Portland (2014)","DOI":"10.1137\/1.9781611973402.28"},{"key":"985_CR6","first-page":"71","volume-title":"Numerical Optimization","author":"MR Celis","year":"1984","unstructured":"Celis, M.R., Dennis, J.E., Tapia, R.A.: A trust region strategy for nonlinear equality constrained optimization. In: Boggs, R.T., Byrd, R.H., Schnabel, R.B. (eds.) Numerical Optimization, pp. 71\u201382. SIAM, Philadelphia (1984)"},{"key":"985_CR7","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1016\/0377-2217(95)00199-9","volume":"94","author":"OE Flippo","year":"1996","unstructured":"Flippo, O.E., Jansen, B.: Duality and sensitivity in nonconvex quadratic optimization over an ellipsoid. Eur. J. Oper. Res. 94, 167\u2013178 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"985_CR8","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1023\/A:1009739827008","volume":"2","author":"MY Fu","year":"1998","unstructured":"Fu, M.Y., Luo, Z.Q., Ye, Y.Y.: Approximation algorithms for quadratic programming. J. Comb. Optim. 2, 29\u201350 (1998)","journal-title":"J. Comb. Optim."},{"key":"985_CR9","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, 1115\u20131145 (1995)","journal-title":"J. ACM"},{"key":"985_CR10","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01582576","volume":"64","author":"M Heinkenschloss","year":"1994","unstructured":"Heinkenschloss, M.: On the solution of a two ball trust region subproblem. Math. Program. 64, 249\u2013276 (1994)","journal-title":"Math. Program."},{"key":"985_CR11","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.: Improved semidefinite approximation bounds for nonconvex nonhomogeneous quadratic optimization with ellipsoid constraints. Oper. Res. Lett. 43, 378\u2013383 (2015)","journal-title":"Oper. Res. Lett."},{"key":"985_CR12","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/s10107-014-0798-5","volume":"152","author":"JB Lasserre","year":"2015","unstructured":"Lasserre, J.B.: A generalization of L\u00f6wner\u2013John\u2019s ellipsoid theorem. Math. Program. 152, 559\u2013591 (2015)","journal-title":"Math. Program."},{"key":"985_CR13","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/s101070050100","volume":"86","author":"A Nemirovski","year":"1999","unstructured":"Nemirovski, A., Roos, C., Terlaky, T.: On maximization of quadratic form over intersection of ellipsoids with common center. Math. Program. 86, 463\u2013473 (1999)","journal-title":"Math. Program."},{"key":"985_CR14","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1080\/10556789808805690","volume":"9","author":"Y Nesterov","year":"1998","unstructured":"Nesterov, Y.: Semidefinite relaxation and nonconvex quadratic optimization. Optim. Method Softw. 9, 141\u2013160 (1998)","journal-title":"Optim. Method Softw."},{"key":"985_CR15","first-page":"273","volume":"77","author":"F Rendle","year":"1997","unstructured":"Rendle, F., Wolkowicz, H.: A semidefinite framework for trust region subproblems with applications to large scale minimization. Math. Program. 77, 273\u2013299 (1997)","journal-title":"Math. Program."},{"key":"985_CR16","first-page":"1","volume":"25","author":"NZ Shor","year":"1987","unstructured":"Shor, N.Z.: Quadratic optimization problems. Sov. J. Comput. Syst. Sci. 25, 1\u201311 (1987)","journal-title":"Sov. J. Comput. Syst. Sci."},{"key":"985_CR17","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1137\/S1052623401395899","volume":"14","author":"P Tseng","year":"2003","unstructured":"Tseng, P.: Further results on approximating nonconvex quadratic optimization by semidefinite programming relaxation. SIAM J. Optim. 14, 268\u2013283 (2003)","journal-title":"SIAM J. Optim."},{"key":"985_CR18","volume-title":"Nonlinear Optimization: Complexity Issues","author":"SA Vavasis","year":"1991","unstructured":"Vavasis, S.A.: Nonlinear Optimization: Complexity Issues. Oxford University Press, Oxford (1991)"},{"issue":"1","key":"985_CR19","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40305-019-00286-5","volume":"8","author":"Y Xia","year":"2020","unstructured":"Xia, Y.: A survey of hidden convex optimization. J. Oper. Res. Soc. China 8(1), 1\u201328 (2020)","journal-title":"J. Oper. Res. Soc. China"},{"key":"985_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01479-0","author":"Y Xia","year":"2020","unstructured":"Xia, Y., Yang, M.J., Wang, S.: Chebyshev center of the intersection of balls: complexity, relaxation and approximation. Math. Program. (2020). https:\/\/doi.org\/10.1007\/s10107-020-01479-0","journal-title":"Math. Program."},{"key":"985_CR21","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1007\/BF01580903","volume":"56","author":"YY Ye","year":"1992","unstructured":"Ye, Y.Y.: On affine scaling algorithms for nonconvex quadratic programming. Math. Program. 56, 285\u2013300 (1992)","journal-title":"Math. Program."},{"key":"985_CR22","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10107980012a","volume":"84","author":"YY Ye","year":"1999","unstructured":"Ye, Y.Y.: Approximating quadratic programming with bound and quadratic constraints. Math. Program. 84, 219\u2013226 (1999)","journal-title":"Math. Program."},{"key":"985_CR23","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1137\/S105262340139001X","volume":"14","author":"YY Ye","year":"2003","unstructured":"Ye, Y.Y., Zhang, S.Z.: New results on quadratic minimization. SIAM J. Optim. 14, 245\u2013267 (2003)","journal-title":"SIAM J. Optim."},{"key":"985_CR24","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/s10107-015-0893-2","volume":"151","author":"YX Yuan","year":"2015","unstructured":"Yuan, Y.X.: Recent advances in trust region algorithms. Math. Program. 151, 249\u2013281 (2015)","journal-title":"Math. Program."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00985-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-020-00985-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-020-00985-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,8]],"date-time":"2021-06-08T09:23:01Z","timestamp":1623144181000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-020-00985-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,9]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,6]]}},"alternative-id":["985"],"URL":"https:\/\/doi.org\/10.1007\/s10898-020-00985-x","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,9]]},"assertion":[{"value":"27 February 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 December 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 January 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}