{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,3]],"date-time":"2026-04-03T01:58:14Z","timestamp":1775181494981,"version":"3.50.1"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T00:00:00Z","timestamp":1581897600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T00:00:00Z","timestamp":1581897600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100014717","name":"National Science Fund for Excellent Young Scholars","doi-asserted-by":"crossref","award":["11822103"],"award-info":[{"award-number":["11822103"]}],"id":[{"id":"10.13039\/100014717","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11801173"],"award-info":[{"award-number":["11801173"]}],"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"}]},{"name":"Beijing Natural Science Foundation","award":["Z180005"],"award-info":[{"award-number":["Z180005"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2021,5]]},"DOI":"10.1007\/s10107-020-01479-0","type":"journal-article","created":{"date-parts":[[2020,2,17]],"date-time":"2020-02-17T14:07:40Z","timestamp":1581948460000},"page":"287-315","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Chebyshev center of the intersection of balls: complexity, relaxation and approximation"],"prefix":"10.1007","volume":"187","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3522-7446","authenticated-orcid":false,"given":"Yong","family":"Xia","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4542-9631","authenticated-orcid":false,"given":"Meijia","family":"Yang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6731-1581","authenticated-orcid":false,"given":"Shu","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,17]]},"reference":[{"issue":"3","key":"1479_CR1","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1137\/050644471","volume":"17","author":"A Beck","year":"2006","unstructured":"Beck, A., Eldar, Y.C.: Strong duality in nonconvex quadratic optimization with two quadratic constraints. SIAM J. Optim. 17(3), 844\u2013860 (2006)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1479_CR2","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1137\/060656784","volume":"29","author":"A Beck","year":"2007","unstructured":"Beck, A., Eldar, Y.C.: Regularization in regression with bounded noise: a Chebyshev center approach. SIAM J. Matrix Anal. Appl. 29(2), 606\u2013625 (2007)","journal-title":"SIAM J. Matrix Anal. Appl."},{"issue":"1","key":"1479_CR3","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. Global Optim. 39(1), 113\u2013126 (2007)","journal-title":"J. Global Optim."},{"issue":"1","key":"1479_CR4","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), 1\u201329 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1479_CR5","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1134\/S0965542508010028","volume":"48","author":"TI Belykh","year":"2008","unstructured":"Belykh, T.I., Bulatov, V.P., Yas\u2019kova, E.N.: Methods of Chebyshev points of convex sets and their applications. Comput. Math. Math. Phys. 48(1), 16\u201329 (2008)","journal-title":"Comput. Math. Math. Phys."},{"key":"1479_CR6","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"issue":"Suppl. 77","key":"1479_CR7","first-page":"19","volume":"2","author":"A Bogdewicz","year":"2006","unstructured":"Bogdewicz, A., Moszy\u0144ska, M.: \u010ceby\u0161ev sets in the space of convex bodies. Rend. Circ. Mat. Palermo 2(Suppl. 77), 19\u201339 (2006)","journal-title":"Rend. Circ. Mat. Palermo"},{"key":"1479_CR8","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970777","volume-title":"Linear Matrix Inequalities in System and Control Theory","author":"S Boyd","year":"1994","unstructured":"Boyd, S., El Ghaoui, L., Feron, E., Balakrishnan, V.: Linear Matrix Inequalities in System and Control Theory. SIAM, Philadelphia (1994)"},{"key":"1479_CR9","unstructured":"Bubeck, S., Lee, Y.T., Singh, M.: A geometric alternative to Nesterov\u2019s accelerated gradient descent. arXiv:1506.08187v1 (2015)"},{"key":"1479_CR10","doi-asserted-by":"crossref","unstructured":"Bienstock, D., Michalka, A.: Polynomial solvability of variants of the trust-region subproblem. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 380\u2013390 (2014)","DOI":"10.1137\/1.9781611973402.28"},{"key":"1479_CR11","unstructured":"Celis, M.R., Dennis, J.E., Tapia, R.A.: A trust region strategyfor nonlinear equality constrained optimization. In: Numerical Optimization, 1984 (Boulder, Colo., 1984), pp. 71\u201382. SIAM, Philadelphia (1985)"},{"key":"1479_CR12","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/978-3-030-21803-4_14","volume-title":"Optimization of Complex Systems: Theory, Models, Algorithms and Applications, AISC","author":"X Cen","year":"2020","unstructured":"Cen, X., Xia, Y., Gao, Y., Yang, T.: On Chebyshev center of the intersection of two ellipsoids. World congress on global optimization (WCGO) 2019. In: Le Thi, H.A., et al. (eds.) Optimization of Complex Systems: Theory, Models, Algorithms and Applications, AISC, vol. 991, pp. 135\u2013144. Springer, Berlin (2020)"},{"issue":"4","key":"1479_CR13","doi-asserted-by":"publisher","first-page":"1388","DOI":"10.1109\/TSP.2007.908945","volume":"56","author":"YC Eldar","year":"2008","unstructured":"Eldar, Y.C., Beck, A., Teboulle, M.: A minimax Chebyshev estimator for bounded error estimation. IEEE Trans. Signal Process. 56(4), 1388\u20131397 (2008)","journal-title":"IEEE Trans. Signal Process."},{"key":"1479_CR14","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1002\/nav.3800210414","volume":"21","author":"J Elzinga","year":"1974","unstructured":"Elzinga, J., Hearn, D.: The minimum sphere covering a convex polyhedron. Nav. Res. Logistic Q. 21, 715\u2013718 (1974)","journal-title":"Nav. Res. Logistic Q."},{"key":"1479_CR15","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"1479_CR16","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1186\/1687-1499-2011-161","volume":"1","author":"MR Gholami","year":"2011","unstructured":"Gholami, M.R., Wymeersch, H., Str\u00f6m, E.G., Rydstr\u00f6m, M.: Wireless network positioning as a convex feasibility problem. EURASIP J. Wirel. Commun. Netw. 1, 161 (2011)","journal-title":"EURASIP J. Wirel. Commun. Netw."},{"key":"1479_CR17","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/j.sigpro.2014.12.015","volume":"111","author":"MR Gholami","year":"2015","unstructured":"Gholami, M.R., Str\u00f6m, E.G., Wymeersc, H., Rydstr\u00f6m, M.: On geometric upper bounds for positioning algorithms in wireless sensor networks. Signal Process. 111, 179\u2013193 (2015)","journal-title":"Signal Process."},{"key":"1479_CR18","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.: LMI approximations for the radius of the intersection of ellipsoids: survey. J. Optim. Theory Appl. 108, 1\u201328 (2001)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"1479_CR19","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(4), 378\u2013383 (2015)","journal-title":"Oper. Res. Lett."},{"key":"1479_CR20","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in $${\\mathbb{R}}^3$$ and related problems. SIAM J. Comput. 12, 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"issue":"8","key":"1479_CR21","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1109\/TAC.1985.1104056","volume":"30","author":"M Milanese","year":"1985","unstructured":"Milanese, M., Tempo, R.: Optimal algorithms theory for robust estimation and prediction. IEEE Trans. Autom. Control. 30(8), 730\u2013738 (1985)","journal-title":"IEEE Trans. Autom. Control."},{"issue":"2","key":"1479_CR22","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF01074784","volume":"22","author":"EI Nenakhov","year":"1986","unstructured":"Nenakhov, E.I., Primak, M.E.: Convergence of the method of Chebyshev centers and some applications. Cybern. Syst. Anal. 22(2), 219\u2013226 (1986)","journal-title":"Cybern. Syst. Anal."},{"key":"1479_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimizaiton: A Basic Course of Applied Optimization","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimizaiton: A Basic Course of Applied Optimization, vol. 87. Kluwer, Boston (2004)"},{"key":"1479_CR24","first-page":"1","volume":"25","author":"NZ Shor","year":"1987","unstructured":"Shor, N.Z.: Quadatric optimization problems. Sov. J. Comput. Syst. Sci. 25, 1\u201311 (1987)","journal-title":"Sov. J. Comput. Syst. Sci."},{"key":"1479_CR25","first-page":"79","volume":"1","author":"JJ Sylvester","year":"1857","unstructured":"Sylvester, J.J.: A question in the geometry of situation. Q. J. Math. 1, 79 (1857)","journal-title":"Q. J. Math."},{"key":"1479_CR26","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."},{"issue":"1","key":"1479_CR27","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1137\/1038003","volume":"38","author":"L Vandenberghe","year":"1996","unstructured":"Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM Rev. 38(1), 49\u201395 (1996)","journal-title":"SIAM Rev."},{"key":"1479_CR28","doi-asserted-by":"publisher","first-page":"2483","DOI":"10.1016\/j.automatica.2013.04.029","volume":"49","author":"D Wu","year":"2013","unstructured":"Wu, D., Zhou, J., HU, A.: A new approximate algorithm for the Chebyshev center. Automatica 49, 2483\u20132488 (2013)","journal-title":"Automatica"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01479-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10107-020-01479-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-020-01479-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,20]],"date-time":"2021-04-20T18:46:49Z","timestamp":1618944409000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10107-020-01479-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,17]]},"references-count":28,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2021,5]]}},"alternative-id":["1479"],"URL":"https:\/\/doi.org\/10.1007\/s10107-020-01479-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,2,17]]},"assertion":[{"value":"1 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 February 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}