{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T18:58:08Z","timestamp":1771700288928,"version":"3.50.1"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,9,27]],"date-time":"2018-09-27T00:00:00Z","timestamp":1538006400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,9,27]],"date-time":"2018-09-27T00:00:00Z","timestamp":1538006400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1719549"],"award-info":[{"award-number":["1719549"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,1]]},"DOI":"10.1007\/s10589-018-0037-8","type":"journal-article","created":{"date-parts":[[2018,9,27]],"date-time":"2018-09-27T03:15:40Z","timestamp":1538018140000},"page":"87-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Asynchronous parallel primal\u2013dual block coordinate update methods for affinely constrained convex programs"],"prefix":"10.1007","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4163-3723","authenticated-orcid":false,"given":"Yangyang","family":"Xu","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,27]]},"reference":[{"key":"37_CR1","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"DP Bertsekas","year":"1989","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods, vol. 23. Prentice Hall, Englewood Cliffs (1989)"},{"issue":"10","key":"37_CR2","doi-asserted-by":"publisher","first-page":"2947","DOI":"10.1109\/TAC.2015.2512043","volume":"61","author":"P Bianchi","year":"2016","unstructured":"Bianchi, P., Hachem, W., Iutzeler, F.: A coordinate descent primal\u2013dual algorithm and application to distributed asynchronous optimization. IEEE Trans. Autom. Control 61(10), 2947\u20132957 (2016)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"1","key":"37_CR3","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s10589-016-9860-y","volume":"66","author":"X Cai","year":"2017","unstructured":"Cai, X., Han, D., Yuan, X.: On the convergence of the direct extension of ADMM for three-block separable convex minimization models with one strongly convex function. Comput. Optim. Appl. 66(1), 39\u201373 (2017)","journal-title":"Comput. Optim. Appl."},{"issue":"12","key":"37_CR4","doi-asserted-by":"publisher","first-page":"3118","DOI":"10.1109\/TSP.2016.2537271","volume":"64","author":"T-H Chang","year":"2016","unstructured":"Chang, T.-H., Hong, M., Liao, W.-C., Wang, X.: Asynchronous distributed admm for large-scale optimization\u2014part I: algorithm and convergence analysis. IEEE Trans. Signal Process. 64(12), 3118\u20133130 (2016)","journal-title":"IEEE Trans. Signal Process."},{"issue":"12","key":"37_CR5","doi-asserted-by":"publisher","first-page":"3131","DOI":"10.1109\/TSP.2016.2537261","volume":"64","author":"T-H Chang","year":"2016","unstructured":"Chang, T.-H., Liao, W.-C., Hong, M., Wang, X.: Asynchronous distributed admm for large-scale optimization\u2014part II: linear convergence analysis and numerical performance. IEEE Trans. Signal Process. 64(12), 3131\u20133144 (2016)","journal-title":"IEEE Trans. Signal Process."},{"issue":"2","key":"37_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/0024-3795(69)90028-7","volume":"2","author":"D Chazan","year":"1969","unstructured":"Chazan, D., Miranker, W.: Chaotic relaxation. Linear Algebra Appl. 2(2), 199\u2013222 (1969)","journal-title":"Linear Algebra Appl."},{"issue":"1\u20132","key":"37_CR7","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1007\/s10107-014-0826-5","volume":"155","author":"C Chen","year":"2016","unstructured":"Chen, C., He, B., Ye, Y., Yuan, X.: The direct extension of ADMM for multi-block convex minimization problems is not necessarily convergent. Math. Programm. 155(1\u20132), 57\u201379 (2016)","journal-title":"Math. Programm."},{"issue":"1","key":"37_CR8","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Rev. 43(1), 129\u2013159 (2001)","journal-title":"SIAM Rev."},{"issue":"1\u20132","key":"37_CR9","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s10107-016-1044-0","volume":"168","author":"PL Combettes","year":"2018","unstructured":"Combettes, P.L., Eckstein, J.: Asynchronous block-iterative primal\u2013dual decomposition methods for monotone inclusions. Math. Program. 168(1\u20132), 645\u2013672 (2018)","journal-title":"Math. Program."},{"issue":"3","key":"37_CR10","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1023\/A:1022627411411","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Mach. Learn. 20(3), 273\u2013297 (1995)","journal-title":"Mach. Learn."},{"issue":"4","key":"37_CR11","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s11228-017-0421-z","volume":"25","author":"D Davis","year":"2017","unstructured":"Davis, D., Yin, W.: A three-operator splitting scheme and its optimization applications. Set-Valued Var. Anal. 25(4), 829\u2013858 (2017)","journal-title":"Set-Valued Var. Anal."},{"issue":"2","key":"37_CR12","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1007\/s10915-016-0318-2","volume":"71","author":"W Deng","year":"2017","unstructured":"Deng, W., Lai, M.-J., Peng, Z., Yin, W.: Parallel multi-block ADMM with $$o(1\/k)$$ convergence. J. Sci. Comput. 71(2), 712\u2013736 (2017)","journal-title":"J. Sci. Comput."},{"issue":"4","key":"37_CR13","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1007\/s40305-015-0084-0","volume":"3","author":"J-K Feng","year":"2015","unstructured":"Feng, J.-K., Zhang, H.-B., Cheng, C.-Z., Pei, H.-M.: Convergence analysis of L-ADMM for multi-block linear-constrained separable convex minimization problem. J. Oper. Res. Soc. China 3(4), 563\u2013579 (2015)","journal-title":"J. Oper. Res. Soc. China"},{"key":"37_CR14","unstructured":"Gao, X., Xu, Y., Zhang, S.: Randomized primal\u2013dual proximal block coordinate updates. arXiv preprint arXiv:1605.05969 (2016)"},{"issue":"2","key":"37_CR15","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s40305-016-0131-5","volume":"5","author":"X Gao","year":"2017","unstructured":"Gao, X., Zhang, S.: First-order algorithms for convex optimization with nonseparable objective and coupled constraints. J. Oper. Res. Soc. China 5(2), 131\u2013159 (2017)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"1","key":"37_CR16","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10957-012-0003-z","volume":"155","author":"D Han","year":"2012","unstructured":"Han, D., Yuan, X.: A note on the alternating direction method of multipliers. J. Optim. Theory Appl. 155(1), 227\u2013238 (2012)","journal-title":"J. Optim. Theory Appl."},{"issue":"4","key":"37_CR17","doi-asserted-by":"publisher","first-page":"2274","DOI":"10.1137\/130922793","volume":"25","author":"B He","year":"2015","unstructured":"He, B., Hou, L., Yuan, X.: On full Jacobian decomposition of the augmented Lagrangian method for separable convex programming. SIAM J. Optim. 25(4), 2274\u20132312 (2015)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"37_CR18","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1137\/110822347","volume":"22","author":"B He","year":"2012","unstructured":"He, B., Tao, M., Yuan, X.: Alternating direction method with Gaussian back substitution for separable convex programming. SIAM J. Optim. 22(2), 313\u2013340 (2012)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"37_CR19","doi-asserted-by":"publisher","first-page":"662","DOI":"10.1287\/moor.2016.0822","volume":"42","author":"B He","year":"2017","unstructured":"He, B., Tao, M., Yuan, X.: Convergence rate analysis for the alternating direction method of multipliers with a substitution procedure for separable convex programming. Math. Oper. Res. 42(3), 662\u2013691 (2017)","journal-title":"Math. Oper. Res."},{"key":"37_CR20","unstructured":"Hong, M., Chang, T.-H., Wang, X., Razaviyayn, M., Ma, S., Luo, Z.-Q.: A block successive upper bound minimization method of multipliers for linearly constrained convex optimization. arXiv preprint arXiv:1401.7079 (2014)"},{"issue":"1\u20132","key":"37_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10107-016-1057-8","volume":"163","author":"M Hong","year":"2017","unstructured":"Hong, M., Wang, X., Razaviyayn, M., Luo, Z.-Q.: Iteration complexity analysis of block coordinate descent methods. Math. Program. 163(1\u20132), 85\u2013114 (2017)","journal-title":"Math. Program."},{"key":"37_CR22","unstructured":"James, G.M., Paulson, C., Rusmevichientong, P.: Penalized and Constrained Regression. Technical report (2013)"},{"issue":"04","key":"37_CR23","doi-asserted-by":"publisher","first-page":"1550024","DOI":"10.1142\/S0217595915500244","volume":"32","author":"M Li","year":"2015","unstructured":"Li, M., Sun, D., Toh, K.-C.: A convergent 3-block semi-proximal ADMM for convex minimization problems with one strongly convex block. Asia-Pac. J. Oper. Res. 32(04), 1550024 (2015)","journal-title":"Asia-Pac. J. Oper. Res."},{"issue":"1\u20132","key":"37_CR24","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/s10107-014-0850-5","volume":"155","author":"X Li","year":"2016","unstructured":"Li, X., Sun, D., Toh, K.-C.: A Schur complement based semi-proximal ADMM for convex quadratic conic programming and extensions. Math. Program. 155(1\u20132), 333\u2013373 (2016)","journal-title":"Math. Program."},{"issue":"3","key":"37_CR25","doi-asserted-by":"publisher","first-page":"1478","DOI":"10.1137\/140971178","volume":"25","author":"T Lin","year":"2015","unstructured":"Lin, T., Ma, S., Zhang, S.: On the global linear convergence of the ADMM with multiblock variables. SIAM J. Optim. 25(3), 1478\u20131497 (2015)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"37_CR26","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s40305-015-0092-0","volume":"3","author":"T Lin","year":"2015","unstructured":"Lin, T., Ma, S., Zhang, S.: On the sublinear convergence rate of multi-block ADMM. J. Oper. Res. Soc. China 3(3), 251\u2013274 (2015)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"1","key":"37_CR27","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1137\/140961134","volume":"25","author":"J Liu","year":"2015","unstructured":"Liu, J., Wright, S.J.: Asynchronous stochastic coordinate descent: parallelism and convergence properties. SIAM J. Optim. 25(1), 351\u2013376 (2015)","journal-title":"SIAM J. Optim."},{"key":"37_CR28","first-page":"285","volume":"16","author":"J Liu","year":"2015","unstructured":"Liu, J., Wright, S.J., R\u00e9, C., Bittorf, V., Sridhar, S.: An asynchronous parallel stochastic coordinate descent algorithm. J. Mach. Learn. Res. 16, 285\u2013322 (2015)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"37_CR29","first-page":"77","volume":"7","author":"H Markowitz","year":"1952","unstructured":"Markowitz, H.: Portfolio selection. J. Finance 7(1), 77\u201391 (1952)","journal-title":"J. Finance"},{"issue":"2","key":"37_CR30","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordinate descent methods on huge-scale optimization problems. SIAM J. Optim. 22(2), 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"37_CR31","doi-asserted-by":"crossref","first-page":"57","DOI":"10.4310\/AMSA.2016.v1.n1.a2","volume":"1","author":"Z Peng","year":"2016","unstructured":"Peng, Z., Wu, T., Xu, Y., Yan, M., Yin, W.: Coordinate friendly structures, algorithms and applications. Ann. Math. Sci. Appl. 1(1), 57\u2013119 (2016)","journal-title":"Ann. Math. Sci. Appl."},{"issue":"5","key":"37_CR32","doi-asserted-by":"publisher","first-page":"A2851","DOI":"10.1137\/15M1024950","volume":"38","author":"Z Peng","year":"2016","unstructured":"Peng, Z., Xu, Y., Yan, M., Yin, W.: ARock: an algorithmic framework for asynchronous parallel coordinate updates. SIAM J. Sci. Comput. 38(5), A2851\u2013A2879 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"37_CR33","unstructured":"Peng, Z., Xu, Y., Yan, M., Yin, W.: On the convergence of asynchronous parallel iteration with arbitrary delays. arXiv preprint arXiv:1612.04425 (2016)"},{"issue":"2","key":"37_CR34","doi-asserted-by":"publisher","first-page":"1126","DOI":"10.1137\/120891009","volume":"23","author":"M Razaviyayn","year":"2013","unstructured":"Razaviyayn, M., Hong, M., Luo, Z.-Q.: A unified convergence analysis of block successive minimization methods for nonsmooth optimization. SIAM J. Optim. 23(2), 1126\u20131153 (2013)","journal-title":"SIAM J. Optim."},{"key":"37_CR35","unstructured":"Recht, B., Re, C., Wright, S., Niu, F.: Hogwild: a lock-free approach to parallelizing stochastic gradient descent. In: Advances in Neural Information Processing Systems, pp. 693\u2013701 (2011)"},{"issue":"1\u20132","key":"37_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10107-012-0614-z","volume":"144","author":"P Richt\u00e1rik","year":"2014","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Math. Program. 144(1\u20132), 1\u201338 (2014)","journal-title":"Math. Program."},{"issue":"2","key":"37_CR37","doi-asserted-by":"publisher","first-page":"882","DOI":"10.1137\/140964357","volume":"25","author":"D Sun","year":"2015","unstructured":"Sun, D., Toh, K.-C., Yang, L.: A convergent 3-block semiproximal alternating direction method of multipliers for conic programming with 4-type constraints. SIAM J. Optim. 25(2), 882\u2013915 (2015)","journal-title":"SIAM J. Optim."},{"key":"37_CR38","unstructured":"Sun, R., Luo, Z.-Q., Ye, Y.: On the expected convergence of randomly permuted ADMM. arXiv preprint arXiv:1503.06387 (2015)"},{"issue":"4","key":"37_CR39","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1137\/0801036","volume":"1","author":"P Tseng","year":"1991","unstructured":"Tseng, P.: On the rate of convergence of a partially asynchronous gradient projection algorithm. SIAM J. Optim. 1(4), 603\u2013619 (1991)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"37_CR40","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1023\/A:1017501703105","volume":"109","author":"P Tseng","year":"2001","unstructured":"Tseng, P.: Convergence of a block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 109(3), 475\u2013494 (2001)","journal-title":"J. Optim. Theory Appl."},{"issue":"1\u20132","key":"37_CR41","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, S.: A coordinate gradient descent method for nonsmooth separable minimization. Math. Program. 117(1\u20132), 387\u2013423 (2009)","journal-title":"Math. Program."},{"key":"37_CR42","doi-asserted-by":"crossref","unstructured":"Wei, E., Ozdaglar, A.: On the $$o (1\/ k)$$ convergence of asynchronous distributed alternating direction method of multipliers. In: IEEE Global Conference on Signal and Information Processing (GlobalSIP), pp. 551\u2013554 (2013)","DOI":"10.1109\/GlobalSIP.2013.6736937"},{"key":"37_CR43","doi-asserted-by":"crossref","unstructured":"WhiteHouse. Big Data: Seizing Opportunities Preserving Values (2014)","DOI":"10.1002\/rwm3.20165"},{"issue":"1","key":"37_CR44","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1137\/16M1084705","volume":"28","author":"Y Xu","year":"2018","unstructured":"Xu, Y.: Hybrid Jacobian and Gauss\u2013Seidel proximal block coordinate update methods for linearly constrained convex programming. SIAM J. Optim. 28(1), 646\u2013670 (2018)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"37_CR45","doi-asserted-by":"publisher","first-page":"1758","DOI":"10.1137\/120887795","volume":"6","author":"Y Xu","year":"2013","unstructured":"Xu, Y., Yin, W.: A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion. SIAM J. Imaging Sci. 6(3), 1758\u20131789 (2013)","journal-title":"SIAM J. Imaging Sci."},{"issue":"2","key":"37_CR46","doi-asserted-by":"publisher","first-page":"700","DOI":"10.1007\/s10915-017-0376-0","volume":"72","author":"Y Xu","year":"2017","unstructured":"Xu, Y., Yin, W.: A globally convergent algorithm for nonconvex optimization based on block coordinate update. J. Sci. Comput. 72(2), 700\u2013734 (2017)","journal-title":"J. Sci. Comput."},{"key":"37_CR47","doi-asserted-by":"crossref","unstructured":"Zeng, Z.-Q., Yu, H.-B., Xu, H.-R., Xie, Y.-Q., Gao, J.: Fast training support vector machines using parallel sequential minimal optimization. In: Intelligent System and Knowledge Engineering, 2008. ISKE 2008. 3rd International Conference on, vol. 1, pp. 997\u20131001. IEEE (2008)","DOI":"10.1109\/ISKE.2008.4731075"},{"key":"37_CR48","unstructured":"Zhang, R., Kwok, J.: Asynchronous distributed ADMM for consensus optimization. In: International Conference on Machine Learning, pp. 1701\u20131709 (2014)"},{"key":"37_CR49","unstructured":"Zhang, Y., Yang, J., Yin, W.: YALL1: your algorithms for $$l_1$$. Online at yall1.blogs.rice.edu (2011)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-0037-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0037-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-0037-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,20]],"date-time":"2025-08-20T17:07:51Z","timestamp":1755709671000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-0037-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,27]]},"references-count":49,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,1]]}},"alternative-id":["37"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-0037-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,9,27]]},"assertion":[{"value":"17 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 September 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}