{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:44:19Z","timestamp":1772297059746,"version":"3.50.1"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,5,31]],"date-time":"2018-05-31T00:00:00Z","timestamp":1527724800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,5,31]],"date-time":"2018-05-31T00:00:00Z","timestamp":1527724800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-16-1-2157"],"award-info":[{"award-number":["N00014-16-1-2157"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"crossref","award":["FA9550-15-1-0073"],"award-info":[{"award-number":["FA9550-15-1-0073"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1007\/s10915-018-0744-4","type":"journal-article","created":{"date-parts":[[2018,5,31]],"date-time":"2018-05-31T02:09:14Z","timestamp":1527732554000},"page":"1133-1146","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Stochastic Backward Euler: An Implicit Gradient Descent Algorithm for k-Means Clustering"],"prefix":"10.1007","volume":"77","author":[{"given":"Penghang","family":"Yin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Minh","family":"Pham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adam","family":"Oberman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stanley","family":"Osher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,5,31]]},"reference":[{"issue":"3","key":"744_CR1","doi-asserted-by":"publisher","first-page":"1904","DOI":"10.1137\/120869079","volume":"23","author":"M Artina","year":"2013","unstructured":"Artina, M., Fornasier, M., Solombrino, F.: Linearly constrained nonsmooth and nonconvex minimization. SIAM J. Optim. 23(3), 1904\u20131937 (2013)","journal-title":"SIAM J. Optim."},{"key":"744_CR2","unstructured":"Arthur, D., Vassilvitskii, S.: $$k$$-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics (2007)"},{"issue":"12","key":"744_CR3","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1103\/PhysRevLett.115.128101","volume":"115","author":"C Baldassi","year":"2015","unstructured":"Baldassi, C., Ingrosso, A., Lucibello, C., Saglietti, L., Zecchina, R.: Subdominant dense clusters allow for simple learning and high computational performance in neural networks with discrete synapses. Phys. Rev. Lett. 115(12), 101\u2013128 (2015)","journal-title":"Phys. Rev. Lett."},{"key":"744_CR4","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"2008","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (2008)","edition":"2"},{"key":"744_CR5","first-page":"82","volume":"3","author":"L Bottou","year":"1995","unstructured":"Bottou, L., Bengio, Y.: Convergence properties of the $$k$$-means algorithms. Adv. Neural Inf. Process. Syst. 3, 82 (1995)","journal-title":"Adv. Neural Inf. Process. Syst."},{"key":"744_CR6","unstructured":"Chaudhari, P., Choromanska, A., Soatto, S., LeCun, Y., Baldassi, C., Borgs, C., Chayes, J., Sagun, L., Zecchina, R.: Entropy-SGD: Biasing Gradient Descent into Wide Valleys (2016). \n                    arXiv:1611.01838"},{"key":"744_CR7","unstructured":"Chaudhari, P., Oberman, A., Osher, S., Soatto, S., Carlier, G.: Deep Relaxation: Partial Differential Equations for Optimizing Deep Neural Networks (2017). \n                    arXiv:1704.04932"},{"key":"744_CR8","unstructured":"Ding, Y., Zhao, Y., Shen, X., Musuvathi, M., Mytkowicz, T.: Yinyang $$k$$-means: a drop-in replacement of the classic $$k$$-means with consistent speedup. In: Proceedings of the 32nd International Conference on Machine Learning (2015)"},{"key":"744_CR9","unstructured":"Elkan, C.: Using the triangle inequality to accelerate $$k$$-means. In: Proceedings of the 20th International Conference on Machine Learning (2003)"},{"key":"744_CR10","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1023\/A:1008321423879","volume":"13","author":"A Kaplan","year":"1998","unstructured":"Kaplan, A., Tichatschke, R.: Proximal point method and nonconvex optimization. J. Global Optim. 13, 389\u2013406 (1998)","journal-title":"J. Global Optim."},{"issue":"7553","key":"744_CR11","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1038\/nature14539","volume":"521","author":"Y LeCun","year":"2015","unstructured":"LeCun, Y., Bengio, Y., Hinton, G.: Deep learning. Nature 521(7553), 436\u2013444 (2015)","journal-title":"Nature"},{"issue":"11","key":"744_CR12","doi-asserted-by":"publisher","first-page":"2278","DOI":"10.1109\/5.726791","volume":"86","author":"Y LeCun","year":"1998","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. Proc. IEEE 86(11), 2278\u20132324 (1998)","journal-title":"Proc. IEEE"},{"issue":"2","key":"744_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd, S.: Least squares quantization in PCM. IEEE Trans. Inf. Theory 28(2), 129\u2013137 (1982)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"744_CR14","doi-asserted-by":"publisher","first-page":"273","DOI":"10.24033\/bsmf.1625","volume":"93","author":"J-J Moreau","year":"1965","unstructured":"Moreau, J.-J.: Proximit\u00e9 et dualit\u00e9 dans un espace hilbertien. Bull. Soc. Math. France 93, 273\u2013299 (1965)","journal-title":"Bull. Soc. Math. France"},{"key":"744_CR15","unstructured":"Newling, J., Fleuret, F.: Nested mini-batch $$k$$-means. In: Advances in Neural Information Processing Systems, pp. 1352\u20131360 (2016)"},{"key":"744_CR16","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1137\/0314056","volume":"14","author":"R Rockafellar","year":"1976","unstructured":"Rockafellar, R.: Monotone operators and the proximal point algorithm. SIAM J. Control Optim. 14, 877\u2013898 (1976)","journal-title":"SIAM J. Control Optim."},{"key":"744_CR17","doi-asserted-by":"crossref","unstructured":"Sculley, D.: Web-scale $$k$$-means clustering. In: Proceedings of the 19th International Conference on World wide web. ACM (2010)","DOI":"10.1145\/1772690.1772862"},{"key":"744_CR18","unstructured":"Tang, C., Monteleoni, C.: Convergence Rate of Stochastic $$k$$-Means (2016). \n                    arXiv:1610.04900"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10915-018-0744-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-018-0744-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-018-0744-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T09:31:48Z","timestamp":1589707908000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10915-018-0744-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,31]]},"references-count":18,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,11]]}},"alternative-id":["744"],"URL":"https:\/\/doi.org\/10.1007\/s10915-018-0744-4","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"value":"0885-7474","type":"print"},{"value":"1573-7691","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,31]]},"assertion":[{"value":"20 October 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 May 2018","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 May 2018","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}