{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,26]],"date-time":"2025-04-26T19:26:21Z","timestamp":1745695581138,"version":"3.37.3"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T00:00:00Z","timestamp":1648166400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T00:00:00Z","timestamp":1648166400000},"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":["11831002"],"award-info":[{"award-number":["11831002"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sci Comput"],"published-print":{"date-parts":[[2022,5]]},"DOI":"10.1007\/s10915-022-01813-y","type":"journal-article","created":{"date-parts":[[2022,3,25]],"date-time":"2022-03-25T20:38:03Z","timestamp":1648240683000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["A Multiscale Semi-Smooth Newton Method for Optimal Transport"],"prefix":"10.1007","volume":"91","author":[{"given":"Yiyang","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1762-0671","authenticated-orcid":false,"given":"Zaiwen","family":"Wen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6697-9731","authenticated-orcid":false,"given":"Wotao","family":"Yin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,25]]},"reference":[{"key":"1813_CR1","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1137\/100805741","volume":"43","author":"Martial Agueh","year":"2011","unstructured":"Agueh, Martial, Carlier, Guillaume: Barycenters in the wasserstein space. SIAM J. Math. Anal. 43, 904\u2013924 (2011)","journal-title":"SIAM J. Math. Anal."},{"key":"1813_CR2","volume-title":"Network flows: Theory, algorithms and applications","author":"RK Ahujia","year":"1993","unstructured":"Ahujia, R.K., Magnanti, Thomas L., Orlin, James B.: Network flows: Theory, algorithms and applications. Rentice-Hall, New Jersey (1993)"},{"key":"1813_CR3","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/BF02186476","volume":"14","author":"Dimitri P Bertsekas","year":"1988","unstructured":"Bertsekas, Dimitri P.: The auction algorithm: A distributed relaxation method for the assignment problem. Ann. Op. Res. 14, 105\u2013123 (1988)","journal-title":"Ann. Op. Res."},{"unstructured":"Cuturi, Marco: Sinkhorn distances: Lightspeed computation of optimal transport. In: Advances in neural information processing systems, pp.\u00a02292\u20132300 (2013)","key":"1813_CR4"},{"unstructured":"Cuturi, Marco, Doucet, Arnaud: Fast computation of wasserstein barycenters (2014)","key":"1813_CR5"},{"key":"1813_CR6","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1016\/0024-3795(89)90490-4","volume":"114","author":"Joel Franklin","year":"1989","unstructured":"Franklin, Joel, Lorenz, Jens: On the scaling of multidimensional matrices. Linear Algebra Appl. 114, 717\u2013735 (1989)","journal-title":"Linear Algebra Appl."},{"key":"1813_CR7","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/TDSC.2006.50","volume":"3","author":"Anthony Y Fu","year":"2006","unstructured":"Fu, Anthony Y., Wenyin, Liu, Deng, Xiaotie: Detecting phishing web pages with visual similarity assessment based on earth mover\u2019s distance (emd). IEEE Trans. Depend. Secure Comput. 3, 301\u2013311 (2006)","journal-title":"IEEE Trans. Depend. Secure Comput."},{"key":"1813_CR8","first-page":"2440","volume":"18","author":"Samuel Gerber","year":"2017","unstructured":"Gerber, Samuel, Maggioni, Mauro: Multiscale strategies for computing optimal transport. J. Mach. Learn. Res. 18, 2440\u20132471 (2017)","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"crossref","unstructured":"Grauman, Kristen, Darrell, Trevor: Fast contour matching using approximate earth mover\u2019s distance, in Computer Vision and Pattern Recognition, 2004. CVPR 2004. In: Proceedings of the 2004 IEEE Computer Society Conference on, vol.\u00a01, pp.\u00a0I\u2013I. IEEE (2004)","key":"1813_CR9","DOI":"10.1109\/CVPR.2004.1315035"},{"key":"1813_CR10","doi-asserted-by":"publisher","first-page":"e72296","DOI":"10.1371\/journal.pone.0072296","volume":"8","author":"Dave Kendal","year":"2013","unstructured":"Kendal, Dave, Hauser, Cindy E., Garrard, Georgia E., Jellinek, Sacha, Giljohann, Katherine M., Moore, Joslin L.: Quantifying plant colour and colour difference as perceived by humans using digital images. PLoS One 8, e72296 (2013)","journal-title":"PLoS One"},{"key":"1813_CR11","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1137\/060659624","volume":"30","author":"Philip A Knight","year":"2008","unstructured":"Knight, Philip A.: The sinkhorn-knopp algorithm: convergence and applications. SIAM J. Matrix Anal. Appl. 30, 261\u2013275 (2008)","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"1813_CR12","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1016\/0893-6080(94)90081-7","volume":"7","author":"Jeffrey J Kosowsky","year":"1994","unstructured":"Kosowsky, Jeffrey J., Yuille, Alan L.: The invisible hand algorithm: Solving the assignment problem with statistical physics. Neural Netw. 7, 477\u2013490 (1994)","journal-title":"Neural Netw."},{"key":"1813_CR13","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"Harold W Kuhn","year":"1955","unstructured":"Kuhn, Harold W.: The hungarian method for the assignment problem. Naval Res. Log. (NRL) 2, 83\u201397 (1955)","journal-title":"Naval Res. Log. (NRL)"},{"key":"1813_CR14","doi-asserted-by":"publisher","first-page":"A4131","DOI":"10.1137\/18M1188069","volume":"40","author":"Yongfeng Li","year":"2018","unstructured":"Li, Yongfeng, Wen, Zaiwen, Yang, Chao, Yuan, Ya.-xiang: A semismooth newton method for semidefinite programs and its applications in electronic structure calculations. SIAM J. Sci. Comput. 40, A4131\u2013A4157 (2018)","journal-title":"SIAM J. Sci. Comput."},{"key":"1813_CR15","doi-asserted-by":"publisher","first-page":"A193","DOI":"10.1137\/18M1219813","volume":"43","author":"Jialin Liu","year":"2021","unstructured":"Liu, Jialin, Yin, Wotao, Li, Wuchen, Chow, Yat Tin: Multilevel optimal transport: a fast approximation of wasserstein-1 distances. SIAM J. Sci. Comput. 43, A193\u2013A220 (2021)","journal-title":"SIAM J. Sci. Comput."},{"doi-asserted-by":"crossref","unstructured":"M\u00e9rigot, Quentin: A multiscale approach to optimal transport. In: Computer Graphics Forum, vol.\u00a030, pp.\u00a01583\u20131592. Wiley Online Library (2011)","key":"1813_CR16","DOI":"10.1111\/j.1467-8659.2011.02032.x"},{"key":"1813_CR17","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1026543900054","volume":"40","author":"Yossi Rubner","year":"2000","unstructured":"Rubner, Yossi, Tomasi, Carlo, Guibas, Leonidas J.: The earth mover\u2019s distance as a metric for image retrieval. Int. J. Comput. Vision 40, 99\u2013121 (2000)","journal-title":"Int. J. Comput. Vision"},{"key":"1813_CR18","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/s10851-016-0653-9","volume":"56","author":"Bernhard Schmitzer","year":"2016","unstructured":"Schmitzer, Bernhard: A sparse multiscale algorithm for dense optimal transport. J. Math. Imag. Vision 56, 238\u2013259 (2016)","journal-title":"J. Math. Imag. Vision"},{"key":"1813_CR19","doi-asserted-by":"publisher","first-page":"A1443","DOI":"10.1137\/16M1106018","volume":"41","author":"Bernhard Schmitzer","year":"2019","unstructured":"Schmitzer, Bernhard: Stabilized sparse scaling algorithms for entropy regularized transport problems. SIAM J. Sci. Comput. 41, A1443\u2013A1481 (2019)","journal-title":"SIAM J. Sci. Comput."},{"key":"1813_CR20","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1109\/ACCESS.2016.2639065","volume":"5","author":"J\u00f6rn Schrieber","year":"2017","unstructured":"Schrieber, J\u00f6rn., Schuhmacher, Dominic, Gottschlich, Carsten: Dotmark-a benchmark for discrete optimal transport. IEEE Access 5, 271\u2013282 (2017)","journal-title":"IEEE Access"},{"unstructured":"Sharify, Meisam, Gaubert, St\u00e9phane, Grigori, Laura: Solution of the optimal assignment problem by diagonal scaling algorithms (2011). arXiv preprint arXiv:1104.3830","key":"1813_CR21"},{"key":"1813_CR22","first-page":"169","volume":"78","author":"Robert E Tarjan","year":"1997","unstructured":"Tarjan, Robert E.: Dynamic trees as search trees via euler tours, applied to the network simplex algorithm. Math. Progr. 78, 169\u2013177 (1997)","journal-title":"Math. Progr."},{"key":"1813_CR23","volume-title":"Optical transport: old and new","author":"C\u00e9dric Villani","year":"2008","unstructured":"Villani, C\u00e9dric.: Optical transport: old and new, vol. 338. Springer Science & Business Media, Berlin (2008)"}],"container-title":["Journal of Scientific Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-022-01813-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10915-022-01813-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10915-022-01813-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,21]],"date-time":"2024-09-21T01:15:47Z","timestamp":1726881347000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10915-022-01813-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,25]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,5]]}},"alternative-id":["1813"],"URL":"https:\/\/doi.org\/10.1007\/s10915-022-01813-y","relation":{},"ISSN":["0885-7474","1573-7691"],"issn-type":[{"type":"print","value":"0885-7474"},{"type":"electronic","value":"1573-7691"}],"subject":[],"published":{"date-parts":[[2022,3,25]]},"assertion":[{"value":"14 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 January 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"39"}}