{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T00:10:19Z","timestamp":1773792619713,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,1,12]],"date-time":"2017-01-12T00:00:00Z","timestamp":1484179200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Uefiscdi Romania","award":["176\/01.10.2015"],"award-info":[{"award-number":["176\/01.10.2015"]}]},{"DOI":"10.13039\/501100002910","name":"Federation Wallonia-Brussels","doi-asserted-by":"crossref","award":["ARC 14\/19-060"],"award-info":[{"award-number":["ARC 14\/19-060"]}],"id":[{"id":"10.13039\/501100002910","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Optim Theory Appl"],"published-print":{"date-parts":[[2017,4]]},"DOI":"10.1007\/s10957-016-1058-z","type":"journal-article","created":{"date-parts":[[2017,1,12]],"date-time":"2017-01-12T20:14:57Z","timestamp":1484252097000},"page":"227-254","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":39,"title":["Random Block Coordinate Descent Methods for Linearly Constrained Optimization over Networks"],"prefix":"10.1007","volume":"173","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1102-2654","authenticated-orcid":false,"given":"Ion","family":"Necoara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yurii","family":"Nesterov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Glineur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,12]]},"reference":[{"issue":"8","key":"1058_CR1","doi-asserted-by":"crossref","first-page":"2001","DOI":"10.1109\/TAC.2013.2250071","volume":"58","author":"I Necoara","year":"2013","unstructured":"Necoara, I.: Random coordinate descent algorithms for multi-agent convex optimization over networks. IEEE Trans. Autom. Control 58(8), 2001\u20132012 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"1058_CR2","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1007\/s10957-006-9080-1","volume":"129","author":"L Xiao","year":"2006","unstructured":"Xiao, L., Boyd, S.: Optimal scaling of a gradient method for distributed resource allocation. J. Optim. Theory Appl. 129(3), 469\u2013488 (2006)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"1058_CR3","doi-asserted-by":"crossref","first-page":"2703","DOI":"10.1109\/TAC.2012.2190161","volume":"57","author":"H Ishii","year":"2012","unstructured":"Ishii, H., Tempo, R., Bai, E.: A web aggregation approach for distributed randomized pagerank algorithms. IEEE Trans. Autom. Control 57(1), 2703\u20132717 (2012)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"10","key":"1058_CR4","doi-asserted-by":"crossref","first-page":"2262","DOI":"10.1109\/TAC.2011.2164017","volume":"56","author":"K You","year":"2011","unstructured":"You, K., Xie, L.: Network topology and communication data rate for consensusability of discrete-time multi-agent systems. IEEE Trans. Autom. Control 56(10), 2262\u20132275 (2011)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"1058_CR5","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1137\/S0036144593251710","volume":"38","author":"H Bauschke","year":"1996","unstructured":"Bauschke, H., Borwein, J.: On projection algorithms for solving convex feasibility problems. SIAM Rev. 38(3), 367\u2013426 (1996)","journal-title":"SIAM Rev."},{"key":"1058_CR6","first-page":"155","volume-title":"Advances in Imaging and Electron Physics","author":"P Combettes","year":"1996","unstructured":"Combettes, P.: The convex feasibility problem in image recovery. In: Hawkes, P. (ed.) Advances in Imaging and Electron Physics, pp. 155\u2013270. Academic Press, Cambridge (1996)"},{"issue":"1","key":"1058_CR7","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1137\/100808563","volume":"22","author":"S Wright","year":"2012","unstructured":"Wright, S.: Accelerated block coordinate relaxation for regularized optimization. SIAM J. Optim. 22(1), 159\u2013186 (2012)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"1058_CR8","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1137\/140961134","volume":"25","author":"J Liu","year":"2014","unstructured":"Liu, J., Wright, S.: Asynchronous stochastic coordinate descent: parallelism and convergence properties. SIAM J. Optim. 25(1), 351\u2013376 (2014)","journal-title":"SIAM J. Optim."},{"issue":"2","key":"1058_CR9","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/s12532-013-0051-x","volume":"5","author":"Z Qin","year":"2013","unstructured":"Qin, Z., Scheinberg, K., Goldfarb, D.: Efficient block-coordinate descent algorithms for the group lasso. Math. Program. Comput. 5(2), 143\u2013169 (2013)","journal-title":"Math. Program. Comput."},{"issue":"1","key":"1058_CR10","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/s10107-015-0901-6","volume":"156","author":"P Richtarik","year":"2016","unstructured":"Richtarik, P., Takac, M.: Parallel coordinate descent methods for big data optimization. Math. Program. 156(1), 433\u2013484 (2016)","journal-title":"Math. Program."},{"issue":"4","key":"1058_CR11","doi-asserted-by":"crossref","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."},{"issue":"3","key":"1058_CR12","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/s10957-008-9458-3","volume":"140","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: A block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization. J. Optim. Theory Appl. 140(3), 513\u2013535 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1058_CR13","doi-asserted-by":"crossref","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":"1058_CR14","doi-asserted-by":"crossref","unstructured":"Patrascu, A., Necoara, I.: Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization. J. Global Optim. 61(1), 19\u201346 (2015)","DOI":"10.1007\/s10898-014-0151-9"},{"issue":"1\u20132","key":"1058_CR15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10107-012-0614-z","volume":"144","author":"P Richtarik","year":"2014","unstructured":"Richtarik, P., Takac, 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":"1","key":"1058_CR16","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1137\/130950288","volume":"26","author":"I Necoara","year":"2016","unstructured":"Necoara, I., Clipici, D.: Parallel coordinate descent methods for composite minimization: convergence analysis and error bounds. SIAM J. Optim. 26(1), 197\u2013226 (2016)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1058_CR17","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1007\/s10957-013-0491-5","volume":"162","author":"A Beck","year":"2014","unstructured":"Beck, A.: The 2-coordinate descent method for solving double-sided simplex constrained minimization problems. J. Optim. Theory Appl. 162(3), 892\u2013919 (2014)","journal-title":"J. Optim. Theory Appl."},{"key":"1058_CR18","doi-asserted-by":"crossref","unstructured":"Necoara, I., Patrascu, A.: A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints. Comput. Optim. Appl. 57(2), 307\u2013337 (2014)","DOI":"10.1007\/s10589-013-9598-8"},{"key":"1058_CR19","unstructured":"Reddi, S., Hefny, A., Downey, C., Dubey, A., Sra, S.: Large-scale randomized-coordinate descent methods with non-separable linear constraints. Tech. rep. (2014). http:\/\/arxiv.org\/abs\/1409.2617.pdf"},{"key":"1058_CR20","unstructured":"Necoara, I., Nesterov, Y., Glineur, F.: A random coordinate descent method on large optimization problems with linear constraints. Tech. rep. (2011). https:\/\/acse.pub.ro\/person\/ion-necoara"},{"key":"1058_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1034-2","author":"M Hong","year":"2016","unstructured":"Hong, M., Luo, Z.: On the linear convergence of the alternating direction method of multipliers. Math. Program. (2016). doi: 10.1007\/s10107-016-1034-2","journal-title":"Math. Program."},{"issue":"9","key":"1058_CR22","doi-asserted-by":"crossref","first-page":"2176","DOI":"10.1109\/TAC.2013.2253223","volume":"58","author":"E Wei","year":"2013","unstructured":"Wei, E., Ozdaglar, A., Jadbabaie, A.: A distributed Newton method for network utility maximization part II. IEEE Trans. Autom. Control 58(9), 2176\u20132188 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"key":"1058_CR23","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2004","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course. Kluwer, Boston (2004)"},{"key":"1058_CR24","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0163-9","volume-title":"Algebraic Graph Theory","author":"C Godsil","year":"2001","unstructured":"Godsil, C., Royle, G.: Algebraic Graph Theory. Springer, Berlin (2001)"}],"container-title":["Journal of Optimization Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-016-1058-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10957-016-1058-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10957-016-1058-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T13:29:33Z","timestamp":1589722173000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10957-016-1058-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,12]]},"references-count":24,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2017,4]]}},"alternative-id":["1058"],"URL":"https:\/\/doi.org\/10.1007\/s10957-016-1058-z","relation":{},"ISSN":["0022-3239","1573-2878"],"issn-type":[{"value":"0022-3239","type":"print"},{"value":"1573-2878","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,12]]}}}