{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T20:02:03Z","timestamp":1769976123242,"version":"3.49.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T00:00:00Z","timestamp":1613001600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T00:00:00Z","timestamp":1613001600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["11971177"],"award-info":[{"award-number":["11971177"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangdong Basic and Applied Basic Research Foundation","award":["2020A1515010408"],"award-info":[{"award-number":["2020A1515010408"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comp. Appl. Math."],"published-print":{"date-parts":[[2021,3]]},"DOI":"10.1007\/s40314-020-01395-1","type":"journal-article","created":{"date-parts":[[2021,2,11]],"date-time":"2021-02-11T17:03:49Z","timestamp":1613063029000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An inexact PAM method for computing Wasserstein barycenter with unknown supports"],"prefix":"10.1007","volume":"40","author":[{"given":"Yitian","family":"Qian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaohua","family":"Pan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,2,11]]},"reference":[{"key":"1395_CR1","doi-asserted-by":"publisher","first-page":"438","DOI":"10.1287\/moor.1100.0449","volume":"35","author":"H Attouch","year":"2010","unstructured":"Attouch H, Bolte J, Redont P, Soubeyran A (2010) Proximal alternating minimization and projection methods for nonconvex problems: an approach based on the Kerdyka\u2013\u0141ojasiewicz inequality. Math Oper Res 35:438\u2013457","journal-title":"Math Oper Res"},{"key":"1395_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-011-0484-9","volume":"137","author":"H Attouch","year":"2013","unstructured":"Attouch H, Bolte J, Svaiter BF (2013) Convergence of descent methods for semi-algebraic and tame problems: proximal algorithms, forward\u2013backward splitting, and regularized Gauss\u2013Seidel methods. Math Program 137:91\u2013129","journal-title":"Math Program"},{"key":"1395_CR3","doi-asserted-by":"publisher","first-page":"1205","DOI":"10.1137\/050644641","volume":"17","author":"J Bolte","year":"2006","unstructured":"Bolte J, Daniilidis A, Lewis A (2006) The Lojasiewicz inequality for nonsmooth subanalytic functions with applications to subgradient dynamical systems. SIAM J Optim 17:1205\u20131223","journal-title":"SIAM J Optim"},{"key":"1395_CR4","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/s10107-013-0701-9","volume":"146","author":"J Bolte","year":"2014","unstructured":"Bolte J, Sabach S, Teboulle M (2014) Proximal alternating linearized minimization for nonconvex and nonsmooth problems. Math Program 146:459\u2013494","journal-title":"Math Program"},{"key":"1395_CR5","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10107-014-0826-5","volume":"155","author":"CH Chen","year":"2016","unstructured":"Chen CH, He BS, Ye YY, Yuan XM (2016) The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent. Math Program 155:57\u201379","journal-title":"Math Program"},{"key":"1395_CR6","unstructured":"Cuturi M (2013) Sinkhorn distances: lightspeed computation of optimal transport. In: Proceedings of the advances in neural information processing systems, 26:2292\u20132300"},{"key":"1395_CR7","first-page":"685","volume":"32","author":"M Cuturi","year":"2014","unstructured":"Cuturi M, Doucet A (2014) Fast computation of Wasserstein barycenters. Proceedings of the international conference on machine learning 32:685\u2013693","journal-title":"Proceedings of the international conference on machine learning"},{"key":"1395_CR8","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1137\/110853996","volume":"34","author":"M Fazel","year":"2013","unstructured":"Fazel M, Pong TK, Sun DF, Tseng P (2013) Hankel matrix rank minimization with applications to system identification and realization. SIAM J Matrix Anal 34:946\u2013977","journal-title":"SIAM J Matrix Anal"},{"key":"1395_CR9","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/0898-1221(76)90003-1","volume":"2","author":"D Gabay","year":"1976","unstructured":"Gabay D, Mercier B (1976) A dual algorithm for the solution of nonlinear variational problems via finite element approximation. Comput Math Appl 2:17\u201340","journal-title":"Comput Math Appl"},{"key":"1395_CR10","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1051\/m2an\/197509R200411","volume":"9","author":"R Glowinski","year":"1975","unstructured":"Glowinski R, Marrocco A (1975) Sur l\u2019 approximation par \u00e9l\u00e9ments finis d\u2019ordre un, etla r\u00e9solution, par p\u00e9nalisation-dualit\u00e9, d\u2019une classe de probl\u00e8mes de dirichlet non lin\u00e9ares. Revue Francaise d\u2019 Automatique, Informatique et Recherche Op\u00e9rationelle 9:41\u201376","journal-title":"Revue Francaise d\u2019 Automatique, Informatique et Recherche Op\u00e9rationelle"},{"key":"1395_CR11","unstructured":"Gurobi Optimization Inc. (2020) Gurobi Optimizer Reference Manual, http:\/\/www.gurobi.com"},{"key":"1395_CR12","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1287\/moor.2017.0875","volume":"43","author":"DR Han","year":"2017","unstructured":"Han DR, Sun DF, Zhang LW (2017) Linear rate convergence of the alternating direction method of multipliers for convex composite programming. Math Oper Res 43:622\u2013637","journal-title":"Math Oper Res"},{"key":"1395_CR13","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1109\/MSP.2015.2481563","volume":"33","author":"M Hong","year":"2016","unstructured":"Hong M, Razaviyayn M, Luo ZQ, Pang JS (2016) A unified algorithmic framework for block-structured optimization involving big data: with applications in machine learning and signal processing. IEEE Signal Process Mag 33:57\u201377","journal-title":"IEEE Signal Process Mag"},{"key":"1395_CR14","doi-asserted-by":"publisher","first-page":"985","DOI":"10.1109\/TPAMI.2007.70792","volume":"30","author":"J Li","year":"2008","unstructured":"Li J, Wang JZ (2008) Real-time computerized annotation of pictures. IEEE Trans Pattern Anal Mach Intell 30:985\u20131002","journal-title":"IEEE Trans Pattern Anal Mach Intell"},{"key":"1395_CR15","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1214\/aoms\/1177692631","volume":"43","author":"CL Mallows","year":"1972","unstructured":"Mallows CL (1972) A note on asymptotic joint normality. Ann Math Stat 43:508\u2013515","journal-title":"Ann Math Stat"},{"key":"1395_CR16","doi-asserted-by":"crossref","unstructured":"Pele O, Werman M (2009) Fast and robust Earth mover\u2019s distances. In: Proceedings of IEEE international conference on computer vision, 1:460\u2013467","DOI":"10.1109\/ICCV.2009.5459199"},{"key":"1395_CR17","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1137\/120891009","volume":"23","author":"M Razaviyayn","year":"2013","unstructured":"Razaviyayn M, Hong M, Luo ZQ (2013) A unified convergence analysis of block successive minimization methods for nonsmooth optimization. SIAM J Optim 23:1126\u20131153","journal-title":"SIAM J Optim"},{"key":"1395_CR18","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173","volume-title":"Convex analysis","author":"RT Rockafellar","year":"1970","unstructured":"Rockafellar RT (1970) Convex analysis. Princeton University Press, Princeton"},{"key":"1395_CR19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational analysis","author":"RT Rockafellar","year":"1998","unstructured":"Rockafellar RT, Wets RJ-B (1998) Variational analysis. Springer, Berlin"},{"key":"1395_CR20","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1023\/A:1026543900054","volume":"40","author":"Y Rubner","year":"2000","unstructured":"Rubner Y, Tomasi C, Guibas LJ (2000) The Earth mover\u2019s distance as a metric for image retrieval. Int J Comput Vis 40:99\u2013121","journal-title":"Int J Comput Vis"},{"key":"1395_CR21","unstructured":"Shen L, Pan SH (2016) Weighted iteration complexity of the sPADMM on the KKT residuals for convex composite optimization. arXiv:1611.03167"},{"key":"1395_CR22","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P Tseng","year":"2001","unstructured":"Tseng P (2001) Convergence of a block coordinate descent method for nondifferentiable minimization. J Optim Theory Appl 109:475\u2013494","journal-title":"J Optim Theory Appl"},{"key":"1395_CR23","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s10107-007-0170-0","volume":"117","author":"P Tseng","year":"2009","unstructured":"Tseng P, Yun SW (2009) A coordinate gradient descent method for nonsmooth separable minimization. Math Program 117:387\u2013423","journal-title":"Math Program"},{"key":"1395_CR24","volume-title":"Optimal transport: old and new","author":"C Villani","year":"2008","unstructured":"Villani C (2008) Optimal transport: old and new, vol 338. Springer, New York"},{"key":"1395_CR25","unstructured":"Wang H, Banerjee A (2014) Bregman alternating direction method of multipliers. In: Proceedings of the advances in neural information processing systems, 2:2816\u20132824"},{"key":"1395_CR26","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"YY Xu","year":"2013","unstructured":"Xu YY, Yin WT (2013) A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J Imaging Sci 6:1758\u20131789","journal-title":"SIAM J Imaging Sci"},{"key":"1395_CR27","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/s10915-017-0376-0","volume":"72","author":"YY Xu","year":"2017","unstructured":"Xu YY, Yin WT (2017) A globally convergent algorithm for nonconvex optimization based on block coordinate update. J Sci Comput 72:700\u2013734","journal-title":"J Sci Comput"},{"key":"1395_CR28","unstructured":"Yang L, Li J, Sun DF, Toh KC (2018) A fast globally linearly convergent algorithm for the computation of Wasserstein barycenters. arXiv:1809.04249"},{"key":"1395_CR29","unstructured":"Ye JB, Li J (2014) Scaling up discrete distribution clustering using ADMM. In: Proceedings of international conference on image process, pp 5267\u20135271"},{"key":"1395_CR30","doi-asserted-by":"publisher","first-page":"2317","DOI":"10.1109\/TSP.2017.2659647","volume":"65","author":"JB Ye","year":"2017","unstructured":"Ye JB, Wu PR, Wang JZ, Li J (2017) Fast discrete distribution clustering using Wasserstein barycenter with sparse support. IEEE Trans Signal Process 65:2317\u20132332","journal-title":"IEEE Trans Signal Process"},{"key":"1395_CR31","first-page":"49:1","volume":"11","author":"Y Zhang","year":"2015","unstructured":"Zhang Y, Wang JZ, Li J (2015) Parallel massive clustering of discrete distributions. ACM Trans Multimedia Comput Commun Appl 11:49:1\u201349:24","journal-title":"ACM Trans Multimedia Comput Commun Appl"}],"container-title":["Computational and Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01395-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s40314-020-01395-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s40314-020-01395-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,3,13]],"date-time":"2021-03-13T21:07:58Z","timestamp":1615669678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s40314-020-01395-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,2,11]]},"references-count":31,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2021,3]]}},"alternative-id":["1395"],"URL":"https:\/\/doi.org\/10.1007\/s40314-020-01395-1","relation":{},"ISSN":["2238-3603","1807-0302"],"issn-type":[{"value":"2238-3603","type":"print"},{"value":"1807-0302","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,2,11]]},"assertion":[{"value":"18 October 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 October 2020","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2020","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 February 2021","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"45"}}