{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:46:48Z","timestamp":1740124008545,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,9,29]],"date-time":"2015-09-29T00:00:00Z","timestamp":1443484800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,9,29]],"date-time":"2015-09-29T00:00:00Z","timestamp":1443484800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000086","name":"Directorate for Mathematical and Physical Sciences","doi-asserted-by":"publisher","award":["DMS-1411817"],"award-info":[{"award-number":["DMS-1411817"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["208785"],"award-info":[{"award-number":["208785"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2016,2]]},"DOI":"10.1007\/s10957-015-0811-z","type":"journal-article","created":{"date-parts":[[2015,9,29]],"date-time":"2015-09-29T15:32:25Z","timestamp":1443540745000},"page":"559-583","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["The Log-Exponential Smoothing Technique and Nesterov\u2019s Accelerated Gradient Method for Generalized Sylvester Problems"],"prefix":"10.1007","volume":"168","author":[{"given":"Nguyen Thai","family":"An","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Giles","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nguyen Mau","family":"Nam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R. Blake","family":"Rector","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,9,29]]},"reference":[{"key":"811_CR1","first-page":"79","volume":"1","author":"JJ Sylvester","year":"1857","unstructured":"Sylvester, J.J.: A question in the geometry of situation. Q. J. Pure Appl. Math. 1, 79 (1857)","journal-title":"Q. J. Pure Appl. Math."},{"key":"811_CR2","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1016\/j.comgeo.2012.01.007","volume":"45","author":"J Alonso","year":"2012","unstructured":"Alonso, J., Martini, H., Spirova, M.: Minimal enclosing discs, circumcircles, and circumcenters in normed planes. Comput. Geom. 45, 258\u2013274 (2012)","journal-title":"Comput. Geom."},{"key":"811_CR3","doi-asserted-by":"crossref","first-page":"137","DOI":"10.4310\/CIS.2006.v6.n2.a3","volume":"6","author":"C Cheng","year":"2006","unstructured":"Cheng, C., Hu, X., Martin, C.: On the smallest enclosing balls. Commun. Inf. Syst. 6, 137\u2013160 (2006)","journal-title":"Commun. Inf. Syst."},{"key":"811_CR4","first-page":"341","volume":"14","author":"K Fischer","year":"2004","unstructured":"Fischer, K., Gartner, B.: The smallest enclosing ball of balls: combinatorial structure and algorithms. Comput. Geom. 14, 341\u2013378 (2004)","journal-title":"Comput. Geom."},{"key":"811_CR5","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1287\/opre.30.4.777","volume":"30","author":"DW Hearn","year":"1981","unstructured":"Hearn, D.W., Vijay, J.: Efficient algorithms for the (weighted) minimum circle problem. Oper. Res. 30, 777\u2013795 (1981)","journal-title":"Oper. Res."},{"key":"811_CR6","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":"811_CR7","doi-asserted-by":"crossref","unstructured":"Saha, A., Vishwanathan, S., Zhang, X.: Efficient approximation algorithms for minimum enclosing convex shapes. In: Proceedings of SODA (2011)","DOI":"10.1137\/1.9781611973082.86"},{"key":"811_CR8","doi-asserted-by":"crossref","unstructured":"Welzl, E.: Smallest enclosing disks (balls ellipsoids). In: Maurer, H. (eds.) Lecture Notes in Computer Science 555, 359\u2013370 (1991)","DOI":"10.1007\/BFb0038202"},{"key":"811_CR9","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1137\/050622560","volume":"17","author":"EA Yildirim","year":"2006","unstructured":"Yildirim, E.A.: On the minimum volume covering ellipsoid of ellipsoids. SIAM J. Optim. 17, 621\u2013641 (2006)","journal-title":"SIAM J. Optim."},{"key":"811_CR10","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":"811_CR11","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s10589-005-4565-7","volume":"30","author":"G Zhou","year":"2005","unstructured":"Zhou, G., Toh, K.C., Sun, J.: Efficient algorithms for the smallest enclosing ball problem. Comput. Optim. Appl. 30, 147\u2013160 (2005)","journal-title":"Comput. Optim. Appl."},{"key":"811_CR12","first-page":"497","volume":"19","author":"NM Nam","year":"2012","unstructured":"Nam, N.M., An, N.T., 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":"811_CR13","doi-asserted-by":"publisher","first-page":"839","DOI":"10.1007\/s11590-012-0483-7","volume":"7","author":"BS Mordukhovich","year":"2013","unstructured":"Mordukhovich, B.S., Nam, N.M., Villalobos, C.: The smallest enclosing ball problem and the smallest intersecting ball problem: existence and uniqueness of optimal solutions. Optim. Lett. 7, 839\u2013853 (2013)","journal-title":"Optim. Lett."},{"key":"811_CR14","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10957-010-9761-7","volume":"148","author":"BS Mordukhovich","year":"2011","unstructured":"Mordukhovich, B.S., Nam, N.M.: Applications of variational analysis to a generalized Fermat\u2013Torricelli problem. J. Optim. Theory Appl. 148, 431\u2013454 (2011)","journal-title":"J. Optim. Theory Appl."},{"key":"811_CR15","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/s10107-013-0697-1","volume":"146","author":"E Chi","year":"2014","unstructured":"Chi, E., Zhou, H., Lange, K.: Distance majorization and its applications. Math. Program. Ser. A 146, 409\u2013436 (2014)","journal-title":"Math. Program. Ser. A"},{"key":"811_CR16","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s10957-014-0692-6","volume":"166","author":"T Jahn","year":"2015","unstructured":"Jahn, T., Kupitz, Y.S., Martini, H., Richter, C.: Minsum location extended to gauges and to convex sets. J. Optim. Theory Appl. 166, 711\u2013746 (2015)","journal-title":"J. Optim. Theory Appl."},{"key":"811_CR17","volume-title":"Convex Analysis and Optimization","author":"D Bertsekas","year":"2003","unstructured":"Bertsekas, D., Nedic, A., Ozdaglar, A.: Convex Analysis and Optimization. Athena Scientific, Boston (2003)"},{"key":"811_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"811_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-02796-7","volume-title":"Convex Analysis and Minimization Algorithms I. Fundamentals","author":"J-B Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty, J.-B., Lemar\u00e9chal, C.: Convex Analysis and Minimization Algorithms I. Fundamentals. Springer, Berlin (1993)"},{"key":"811_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-031-02406-1","volume-title":"An Easy Path to Convex Analysis and Applications","author":"BS Mordukhovich","year":"2014","unstructured":"Mordukhovich, B.S., Nam, N.M.: An Easy Path to Convex Analysis and Applications. Morgan & Claypool Publishers, California (2014)"},{"issue":"4","key":"811_CR21","doi-asserted-by":"publisher","first-page":"1815","DOI":"10.1137\/130945442","volume":"24","author":"NM Nam","year":"2014","unstructured":"Nam, N.M., An, N.T., Rector, R.B., Sun, J.: Nonsmooth algorithms and Nesterov\u2019s smoothing technique for generalized Fermat\u2013Torricelli problems. SIAM J. Optim. 24(4), 1815\u20131839 (2014)","journal-title":"SIAM J. Optim."},{"key":"811_CR22","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1016\/j.jmaa.2005.09.009","volume":"321","author":"Y He","year":"2006","unstructured":"He, Y., Ng, K.F.: Subdifferentials of a minimum time function in Banach spaces. J. Math. Anal. Appl. 321, 896\u2013910 (2006)","journal-title":"J. Math. Anal. Appl."},{"key":"811_CR23","unstructured":"Zhai, X.: Two Problems in Convex Conic Optimization. Master\u2019s thesis, National University of Singapore (2007)"},{"key":"811_CR24","doi-asserted-by":"crossref","unstructured":"Mairal, J.: Incremental Majorization-Minimization Optimization with Application to Large-Scale Machine Learning. arXiv preprint arXiv:1402.4419 (2014)","DOI":"10.1137\/140957639"},{"key":"811_CR25","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1198\/0003130042836","volume":"58","author":"DR Hunter","year":"2004","unstructured":"Hunter, D.R., Lange, K.: Tutorial on MM algorithms. Am. Stat. 58, 30\u201337 (2004)","journal-title":"Am. Stat."},{"key":"811_CR26","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1080\/10618600.2000.10474858","volume":"9","author":"K Lange","year":"2000","unstructured":"Lange, K., Hunter, D.R., Yang, I.: Optimization transfer using surrogate objective functions (with discussion). J Comput Graph. Stat. 9, 1\u201359 (2000)","journal-title":"J Comput Graph. Stat."},{"key":"811_CR27","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/s10107-004-0552-5","volume":"103","author":"Y Nesterov","year":"2005","unstructured":"Nesterov, Y.: Smooth minimization of non-smooth functions. Math. Program. 103, 127\u2013152 (2005)","journal-title":"Math. Program."},{"key":"811_CR28","unstructured":"Nesterov, Y.: A method for unconstrained convex minimization problem with the rate of convergence O($$\\frac{1}{k^2}$$). Doklady AN SSSR (translated as Soviet Math. Docl.) 269, 543\u2013547 (1983)"},{"key":"811_CR29","volume-title":"Numerical Optimization","author":"J Nocedal","year":"2006","unstructured":"Nocedal, J., Wright, S.: Numerical Optimization, 2nd edn. Springer, Berlin (2006)","edition":"2"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-015-0811-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-015-0811-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-015-0811-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-015-0811-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T13:00:29Z","timestamp":1718110829000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-015-0811-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9,29]]},"references-count":29,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,2]]}},"alternative-id":["811"],"URL":"https:\/\/doi.org\/10.1007\/s10957-015-0811-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"type":"print","value":"0022-3239"},{"type":"electronic","value":"1573-2878"}],"subject":[],"published":{"date-parts":[[2015,9,29]]},"assertion":[{"value":"17 March 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2015","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 September 2015","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}