{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,11]],"date-time":"2026-02-11T18:31:45Z","timestamp":1770834705134,"version":"3.50.1"},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T00:00:00Z","timestamp":1571702400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,10,22]],"date-time":"2019-10-22T00:00:00Z","timestamp":1571702400000},"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":["1720237"],"award-info":[{"award-number":["1720237"]}],"id":[{"id":"10.13039\/100000086","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000141712162"],"award-info":[{"award-number":["N000141712162"]}],"id":[{"id":"10.13039\/100000006","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":[[2020,1]]},"DOI":"10.1007\/s10589-019-00140-7","type":"journal-article","created":{"date-parts":[[2019,10,23]],"date-time":"2019-10-23T07:07:16Z","timestamp":1571814436000},"page":"35-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Markov chain block coordinate descent"],"prefix":"10.1007","volume":"75","author":[{"given":"Tao","family":"Sun","sequence":"first","affiliation":[]},{"given":"Yuejiao","family":"Sun","sequence":"additional","affiliation":[]},{"given":"Yangyang","family":"Xu","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6697-9731","authenticated-orcid":false,"given":"Wotao","family":"Yin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,10,22]]},"reference":[{"key":"140_CR1","unstructured":"Allen-Zhu, Z., Qu, Z., Richt\u00e1rik, P., Yuan, Y.: Even faster accelerated coordinate descent using non-uniform sampling. In: International Conference on Machine Learning (ICML), pp. 1110\u20131119 (2016)"},{"issue":"4","key":"140_CR2","doi-asserted-by":"publisher","first-page":"2037","DOI":"10.1137\/120887679","volume":"23","author":"A Beck","year":"2013","unstructured":"Beck, A., Tetruashvili, L.: On the convergence of block coordinate descent type methods. SIAM J. Optim. 23(4), 2037\u20132060 (2013)","journal-title":"SIAM J. Optim."},{"key":"140_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1214\/154957805100000104","volume":"2","author":"RC Bradley","year":"2005","unstructured":"Bradley, R.C., et al.: Basic properties of strong mixing conditions\u2014a survey and some open questions. Probab Surv 2, 107\u2013144 (2005)","journal-title":"Probab Surv"},{"issue":"1","key":"140_CR4","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0377-2217(98)00204-5","volume":"112","author":"P Brucker","year":"1999","unstructured":"Brucker, P., Drexl, A., M\u00f6hring, R., Neumann, K., Pesch, E.: Resource-constrained project scheduling: notation, classification, models, and methods. Eur. J. Oper. Res. 112(1), 3\u201341 (1999)","journal-title":"Eur. J. Oper. Res."},{"issue":"4","key":"140_CR5","doi-asserted-by":"publisher","first-page":"A1280","DOI":"10.1137\/16M1102653","volume":"39","author":"YT Chow","year":"2017","unstructured":"Chow, Y.T., Wu, T., Yin, W.: Cyclic coordinate-update algorithms for fixed-point problems: analysis and applications. SIAM J. Sci. Comput. 39(4), A1280\u2013A1300 (2017)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"140_CR6","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1137\/130936361","volume":"25","author":"C Dang","year":"2015","unstructured":"Dang, C., Lan, G.: Stochastic block mirror descent methods for nonsmooth and stochastic optimization. SIAM J. Optim. 25(2), 856\u2013881 (2015)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"140_CR7","doi-asserted-by":"publisher","first-page":"1997","DOI":"10.1137\/130949993","volume":"25","author":"O Fercoq","year":"2015","unstructured":"Fercoq, O., Richt\u00e1rik, P.: Accelerated, parallel, and proximal coordinate descent. SIAM J. Optim. 25(4), 1997\u20132023 (2015)","journal-title":"SIAM J. Optim."},{"key":"140_CR8","unstructured":"Hannah, R., Feng, F., Yin, W.: A2BCD: asynchronous acceleration with optimal complexity. In: International Conference on Learning Representations (ICLR), New Orleans, LA (2019)"},{"key":"140_CR9","doi-asserted-by":"crossref","unstructured":"Johansson, B., Rabi, M., Johansson, M.: A simple peer-to-peer algorithm for distributed optimization in sensor networks. In: 2007 46th IEEE Conference on Decision and Control, pp. 4705\u20134710. IEEE (2007)","DOI":"10.1109\/CDC.2007.4434888"},{"key":"140_CR10","doi-asserted-by":"crossref","unstructured":"Lee, Y.T., Sidford, A.: Efficient accelerated coordinate descent methods and faster algorithms for solving linear systems. In: 2013 IEEE 54th Annual Symposium on Foundations of Computer Science, Berkeley, CA, USA, pp. 147\u2013156. IEEE (2013)","DOI":"10.1109\/FOCS.2013.24"},{"issue":"3","key":"140_CR11","doi-asserted-by":"publisher","first-page":"487","DOI":"10.3934\/ipi.2009.3.487","volume":"3","author":"Y Li","year":"2009","unstructured":"Li, Y., Osher, S.: Coordinate descent optimization for $$\\ell ^1$$ minimization with application to compressed sensing; a greedy algorithm. Inverse Probl. Imaging 3(3), 487\u2013503 (2009)","journal-title":"Inverse Probl. Imaging"},{"issue":"1","key":"140_CR12","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1137\/130939110","volume":"25","author":"Z Li","year":"2015","unstructured":"Li, Z., Uschmajew, A., Zhang, S.: On convergence of the maximum block improvement method. SIAM J. Optim. 25(1), 210\u2013233 (2015)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"140_CR13","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":"140_CR14","volume-title":"Markov Chains and Stochastic Stability","author":"SP Meyn","year":"2012","unstructured":"Meyn, S.P., Tweedie, R.L.: Markov Chains and Stochastic Stability. Springer, Berlin (2012)"},{"issue":"2","key":"140_CR15","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."},{"key":"140_CR16","unstructured":"Nutini, J., Schmidt, M., Laradji, I.H., Friedlander, M., Koepke, H.: Coordinate descent converges faster with the Gauss\u2013Southwell rule than random selection. In: International Conference on Machine Learning (ICML), pp. 1632\u20131641 (2015)"},{"issue":"1","key":"140_CR17","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":"140_CR18","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."},{"issue":"1","key":"140_CR19","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s40305-017-0183-1","volume":"1","author":"Z Peng","year":"2019","unstructured":"Peng, Z., Xu, Y., Yan, M., Yin, W.: On the convergence of asynchronous parallel iteration with arbitrary delays. J. Oper. Res. Soc. China 1(1), 5\u201342 (2019)","journal-title":"J. Oper. Res. Soc. China"},{"key":"140_CR20","doi-asserted-by":"crossref","unstructured":"Peng, Z., Yan, M., Yin, W.: Parallel and distributed sparse optimization. In: 2013 Asilomar Conference On Signals, Systems and Computers, pp. 659\u2013646. IEEE (2013)","DOI":"10.1109\/ACSSC.2013.6810364"},{"issue":"2","key":"140_CR21","doi-asserted-by":"publisher","first-page":"691","DOI":"10.1137\/080726380","volume":"20","author":"SS Ram","year":"2009","unstructured":"Ram, S.S., Nedi\u0107, A., Veeravalli, V.V.: Incremental stochastic subgradient algorithms for convex optimization. SIAM J. Optim. 20(2), 691\u2013717 (2009)","journal-title":"SIAM J. Optim."},{"issue":"1\u20132","key":"140_CR22","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1007\/s10107-015-0901-6","volume":"156","author":"P Richt\u00e1rik","year":"2016","unstructured":"Richt\u00e1rik, P., Tak\u00e1\u010d, M.: Parallel coordinate descent methods for big data optimization. Math. Program. 156(1\u20132), 433\u2013484 (2016)","journal-title":"Math. Program."},{"key":"140_CR23","volume-title":"Variational Analysis","author":"RT Rockafellar","year":"2009","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis, vol. 317. Springer, Berlin (2009)"},{"issue":"Jun","key":"140_CR24","first-page":"1865","volume":"12","author":"S Shalev-Shwartz","year":"2011","unstructured":"Shalev-Shwartz, S., Tewari, A.: Stochastic methods for l1-regularized loss minimization. J. Mach. Learn. Res. 12(Jun), 1865\u20131892 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"Feb","key":"140_CR25","first-page":"567","volume":"14","author":"S Shalev-Shwartz","year":"2013","unstructured":"Shalev-Shwartz, S., Zhang, T.: Stochastic dual coordinate ascent methods for regularized loss minimization. J. Mach. Learn. Res. 14(Feb), 567\u2013599 (2013)","journal-title":"J. Mach. Learn. Res."},{"key":"140_CR26","unstructured":"Sun, R., Hong, M.: Improved iteration complexity bounds of cyclic block coordinate descent for convex problems. In: Advances in Neural Information Processing Systems, pp. 1306\u20131314 (2015)"},{"key":"140_CR27","unstructured":"Sun, T., Hannah, R., Yin, W.: Asynchronous coordinate descent under more realistic assumptions. In: Advances in Neural Information Processing Systems, pp. 6183\u20136191 (2017)"},{"key":"140_CR28","volume-title":"Reinforcement Learning: An Introduction","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Reinforcement Learning: An Introduction. MIT Press, Cambridge (1998)"},{"issue":"1\u20132","key":"140_CR29","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."},{"issue":"3","key":"140_CR30","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":"3","key":"140_CR31","doi-asserted-by":"publisher","first-page":"1686","DOI":"10.1137\/140983938","volume":"25","author":"Y Xu","year":"2015","unstructured":"Xu, Y., Yin, W.: Block stochastic gradient iteration for convex and nonconvex optimization. SIAM J. Optim. 25(3), 1686\u20131716 (2015)","journal-title":"SIAM J. Optim."},{"key":"140_CR32","unstructured":"Yin, W., Mao, X., Yuan, K., Gu, Y., Sayed, A.H.: A communication-efficient random-walk algorithm for decentralized optimization. arXiv preprint arXiv:1804.06568 (2018)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00140-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-019-00140-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00140-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,2]],"date-time":"2022-10-02T10:45:12Z","timestamp":1664707512000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00140-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,10,22]]},"references-count":32,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,1]]}},"alternative-id":["140"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00140-7","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,10,22]]},"assertion":[{"value":"21 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}