{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T18:40:47Z","timestamp":1774636847141,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2021,5,26]],"date-time":"2021-05-26T00:00:00Z","timestamp":1621987200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,26]],"date-time":"2021-05-26T00:00:00Z","timestamp":1621987200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2021,7]]},"DOI":"10.1007\/s10589-021-00283-6","type":"journal-article","created":{"date-parts":[[2021,5,26]],"date-time":"2021-05-26T18:04:37Z","timestamp":1622052277000},"page":"767-787","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["A dual simplex-type algorithm for the smallest enclosing ball of balls"],"prefix":"10.1007","volume":"79","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1936-7542","authenticated-orcid":false,"given":"Marta","family":"Cavaleiro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Farid","family":"Alizadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,5,26]]},"reference":[{"key":"283_CR1","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Geometric approximation via coresets, in Combinatorial and Computational Geometry, pp. 1\u201330. University Press, MSRI (2005)"},{"key":"283_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-002-0339-5","volume":"95","author":"F Alizadeh","year":"2003","unstructured":"Alizadeh, F., Goldfarb, D.: Second-order cone programming. Math. Program. 95, 3\u201351 (2003)","journal-title":"Math. Program."},{"key":"283_CR3","first-page":"125","volume":"2","author":"A Ben-Hur","year":"2002","unstructured":"Ben-Hur, A., Horn, D., Siegelmann, H.T., Vapnik, V.: Support vector clustering. J. Mach. Learn. Res. 2, 125\u2013137 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"283_CR4","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1016\/j.comgeo.2007.04.002","volume":"40","author":"M B\u0103doiu","year":"2008","unstructured":"B\u0103doiu, M., Clarkson, K.L.: Optimal core-sets for balls. Comput. Geometry 40, 14\u201322 (2008)","journal-title":"Comput. Geometry"},{"key":"283_CR5","doi-asserted-by":"crossref","unstructured":"B\u0103doiu, M., Har-Peled, S., Indyk, P.: Approximate clustering via core-sets. In: Proc. 34th Annual ACM Symp. on Theory of Computing, STOC \u201902, New York, NY, USA, ACM, pp. 250\u2013257 (2002)","DOI":"10.1145\/509907.509947"},{"key":"283_CR6","first-page":"753","volume-title":"Hand recognition using geometric classifiers in authentication biometric","author":"Y Bulatov","year":"2004","unstructured":"Bulatov, Y., Jambawalikar, S., Kumar, P., Sethia, S.: Hand recognition using geometric classifiers in authentication biometric, pp. 753\u2013759. Springer, Heidelberg (2004)"},{"key":"283_CR7","unstructured":"Cavaleiro, M.: Simplex-Like Methods for Spherical Enclosure of Points and Spheres - Algorithms and Applications, Ph.D. Thesis, Rutgers University (2020)"},{"key":"283_CR8","first-page":"1056","volume":"5","author":"M Cavaleiro","year":"2018","unstructured":"Cavaleiro, M., Alizadeh, F.: A faster dual algorithm for the Euclidean minimum covering ball problem. Annal Op Res 5, 1056 (2018)","journal-title":"Annal Op Res"},{"key":"283_CR9","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1023\/A:1012450327387","volume":"46","author":"O Chapelle","year":"2002","unstructured":"Chapelle, O., Vapnik, V., Bousquet, O., Mukherjee, S.: Choosing multiple parameters for support vector machines. Mach Learn 46, 131\u2013159 (2002)","journal-title":"Mach Learn"},{"key":"283_CR10","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.orl.2009.02.008","volume":"37","author":"PM Dearing","year":"2009","unstructured":"Dearing, P.M., Zeck, C.R.: A dual algorithm for the minimum covering ball problem in $$\\mathbb{R}^n$$. Op Res Lett 37, 171\u2013175 (2009)","journal-title":"Op Res Lett"},{"key":"283_CR11","doi-asserted-by":"crossref","unstructured":"Dyer, M.: A class of convex programs with applications to computational geometry. In: Proc. of the 8th Annual Symp. on Computational Geometry, SCG \u201992, New York, NY, USA, ACM, pp. 9\u201315 (1992)","DOI":"10.1145\/142675.142681"},{"key":"283_CR12","volume-title":"Linear programming","author":"M Dyer","year":"2017","unstructured":"Dyer, M., G\u00e4rtner, B., Megiddo, N., Welzl, E.: Linear programming. Chapman and Hall\/CRC, Boca Raton (2017)"},{"key":"283_CR13","volume-title":"Linear programming","author":"M Dyer","year":"2004","unstructured":"Dyer, M., Megiddo, N., Welzl, E.: Linear programming. Chapman and Hall\/CRC, Boca Raton (2004)"},{"key":"283_CR14","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1142\/S0218195904001500","volume":"14","author":"K Fischer","year":"2004","unstructured":"Fischer, K., G\u00e4rtner, B.: The smallest enclosing ball of balls: combinatorial structure and algorithms. Int. J. Comput. Geometry Appl. 14, 341\u2013387 (2004)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"283_CR15","doi-asserted-by":"crossref","unstructured":"Fischer, K., G\u00e4rtner, B., Kutz, M.: Fast smallest-enclosing-ball computation in high dimensions, in Algorithms - ESA. Lecture Notes in Computer Science, vol. 2832. Springer 2003, 630\u2013641 (2003)","DOI":"10.1007\/978-3-540-39658-1_57"},{"key":"283_CR16","doi-asserted-by":"publisher","first-page":"505","DOI":"10.1090\/S0025-5718-1974-0343558-6","volume":"28","author":"PE Gill","year":"1974","unstructured":"Gill, P.E., Golub, G.H., Murray, W., Saunders, M.A.: Methods for modifying matrix factorizations. Math. Comput. 28, 505\u2013535 (1974)","journal-title":"Math. Comput."},{"key":"283_CR17","doi-asserted-by":"publisher","first-page":"796","DOI":"10.1090\/S0025-5718-1976-0423804-2","volume":"30","author":"D Goldfarb","year":"1976","unstructured":"Goldfarb, D.: Factorized variable metric methods for unconstrained optimization. Math. Comput. 30, 796\u2013811 (1976)","journal-title":"Math. Comput."},{"key":"283_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BF02591962","volume":"27","author":"D Goldfarb","year":"1983","unstructured":"Goldfarb, D., Idnani, A.: A numerically stable dual method for solving strictly convex quadratic programs. Math. Program. 27, 1\u201333 (1983)","journal-title":"Math. Program."},{"key":"283_CR19","volume-title":"Matrix computations","author":"GH Golub","year":"1996","unstructured":"Golub, G.H., Van Loan, C.: Matrix computations, 3rd edn. Johns Hopkins University Press, Baltimore (1996)","edition":"3"},{"key":"283_CR20","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1023\/A:1026110926707","volume":"123","author":"TS Hale","year":"2003","unstructured":"Hale, T.S., Moberg, C.R.: Location science research: a review. Annal. Op. Res. 123, 21\u201335 (2003)","journal-title":"Annal. Op. Res."},{"key":"283_CR21","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1145\/231731.231732","volume":"15","author":"PM Hubbard","year":"1996","unstructured":"Hubbard, P.M.: Approximating polyhedra with spheres for time-critical collision detection. ACM Trans. Gr. 15, 179\u2013210 (1996)","journal-title":"ACM Trans. Gr."},{"key":"283_CR22","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1080\/2165347X.2015.1037471","volume":"17","author":"L K\u00e4llberg","year":"2013","unstructured":"K\u00e4llberg, L., Larsson, T.: Faster approximation of minimum enclosing balls by distance filtering and GPU parallelization. J. Gr. Tools 17, 67\u201384 (2013)","journal-title":"J. Gr. Tools"},{"key":"283_CR23","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1145\/996546.996548","volume":"8","author":"P Kumar","year":"2003","unstructured":"Kumar, P., Mitchell, J.S.B., Yildirim, E.A.: Approximate minimum enclosing balls in high dimensions using core-sets. ACM J. Exp. Algorithm. 8, 689 (2003)","journal-title":"ACM J. Exp. Algorithm."},{"key":"283_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cag.2016.01.003","volume":"56","author":"T Larsson","year":"2016","unstructured":"Larsson, T., Capannini, G., K\u00e4llberg, L.: Parallel computation of optimal enclosing balls by iterative orthant scan. Computers & Gr 56, 1\u201310 (2016)","journal-title":"Computers & Gr"},{"key":"283_CR25","doi-asserted-by":"crossref","unstructured":"Larsson, T., K\u00e4llberg, L.: Fast and robust approximation of smallest enclosing balls in arbitrary dimensions. In: Proc. 11th Eurographics\/ACMSIGGRAPH Symp. on Geometry Processing, SGP \u201913, Aire-la-Ville, Switzerland, Eurographics Association, pp.\u00a093\u2013101 (2013)","DOI":"10.1111\/cgf.12176"},{"key":"283_CR26","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/BF02187750","volume":"4","author":"N Megiddo","year":"1989","unstructured":"Megiddo, N.: On the ball spanned by balls, discrete. Comput. Geom. 4, 605\u2013610 (1989)","journal-title":"Comput. Geom."},{"key":"283_CR27","doi-asserted-by":"crossref","unstructured":"Moradi, E., Bidkhori, M.: Single facility location problem. In: Location, Facility (ed.) Concepts, pp. 37\u201368. Physica-Verlag HD, Models, Algorithms and Case Studies, Heidelberg (2009)","DOI":"10.1007\/978-3-7908-2151-2_3"},{"key":"283_CR28","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1007\/s11590-012-0483-7","volume":"7","author":"B Mordukhovich","year":"2013","unstructured":"Mordukhovich, B., Nam, N.M., Villalobos, C.: The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of solutions. Optim. Lett. 7, 839\u2013853 (2013)","journal-title":"Optim. Lett."},{"key":"283_CR29","unstructured":"MOSEK ApS: The MOSEK optimization toolbox for MATLAB manual. Version 8.1 (2017)"},{"key":"283_CR30","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10957-013-0366-9","volume":"160","author":"NM Nam","year":"2014","unstructured":"Nam, N.M., Hoang, N., An, N.T.: Constructions of solutions to generalized Sylvester and Fermat-Torricelli problems for Euclidean balls. J. Optim. Theor. Appl. 160, 483\u2013509 (2014)","journal-title":"J. Optim. Theor. Appl."},{"key":"283_CR31","first-page":"497","volume":"19","author":"NM Nam","year":"2012","unstructured":"Nam, N.M., Nguyen, T.A., Salinas, J.: Applications of convex analysis to the smallest intersecting ball problem. J. Convex Anal. 19, 497\u2013518 (2012)","journal-title":"J. Convex Anal."},{"key":"283_CR32","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1142\/S0218195909003039","volume":"19","author":"F Nielsen","year":"2009","unstructured":"Nielsen, F., Nock, R.: Approximating smallest enclosing balls with applications to machine learning. Int. J. Comput. Geom. Appl. 19, 389\u2013414 (2009)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"283_CR33","unstructured":"Panigrahy, R.: Minimum enclosing polytope in high dimensions, CoRR, cs.CG\/0407020 (2004)"},{"key":"283_CR34","doi-asserted-by":"crossref","unstructured":"Plastria, F.: Continuous covering location problems. In: Location, Facility (ed.) Applications and Theory, pp. 37\u201379. Springer, Berlin (2002)","DOI":"10.1007\/978-3-642-56082-8_2"},{"key":"283_CR35","doi-asserted-by":"crossref","unstructured":"Sharir, M., Welzl, E.: A combinatorial bound for linear programming and related problems. In: STACS 92, Berlin, Heidelberg, pp. 567\u2013579. Springer (1992)","DOI":"10.1007\/3-540-55210-3_213"},{"key":"283_CR36","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1080\/10556789908805762","volume":"11","author":"KC Toh","year":"1999","unstructured":"Toh, K.C., Todd, M.: SDPT3 - a MATLAB software package for semidefinite programming. Optim. Methods Softw. 11, 545\u2013581 (1999)","journal-title":"Optim. Methods Softw."},{"key":"283_CR37","first-page":"363","volume":"6","author":"IW Tsang","year":"2005","unstructured":"Tsang, I.W., Kwok, J.T., Cheung, P.-M.: Core vector machines: fast SVM training on very large data sets. J. Mach. Learn. Res. 6, 363\u2013392 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"283_CR38","doi-asserted-by":"publisher","first-page":"1368","DOI":"10.1137\/070690419","volume":"19","author":"EA Yildirim","year":"2008","unstructured":"Yildirim, E.A.: Two algorithms for the minimum enclosing ball problem. SIAM J. Optim. 19, 1368\u20131391 (2008)","journal-title":"SIAM J. Optim."},{"key":"283_CR39","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10589-005-4565-7","volume":"30","author":"G Zhou","year":"2005","unstructured":"Zhou, G., Tohemail, K.-C., Sun, J.: Efficient algorithms for the smallest enclosing ball problem. Comput. Optim. Appl. 30, 147\u2013160 (2005)","journal-title":"Comput. Optim. Appl."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00283-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-021-00283-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-021-00283-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T19:22:15Z","timestamp":1623957735000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-021-00283-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,26]]},"references-count":39,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2021,7]]}},"alternative-id":["283"],"URL":"https:\/\/doi.org\/10.1007\/s10589-021-00283-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,26]]},"assertion":[{"value":"24 July 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 May 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Funding"}},{"value":"The authors declare that they have no conflict of interest to declare.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Availability of data and material"}},{"value":"For access to the code, please contact the corresponding author.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Code availability"}}]}}