{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T17:17:10Z","timestamp":1782926230146,"version":"3.54.5"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2016,8,19]],"date-time":"2016-08-19T00:00:00Z","timestamp":1471564800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2016,8,19]],"date-time":"2016-08-19T00:00:00Z","timestamp":1471564800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"NSF","award":["CCF-1526078"],"award-info":[{"award-number":["CCF-1526078"]}]},{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"crossref","award":["15RT0767"],"award-info":[{"award-number":["15RT0767"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"NSFC","doi-asserted-by":"crossref","award":["61571384"],"award-info":[{"award-number":["61571384"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Leading Talents of Guang Dong Province program,","award":["00201510"],"award-info":[{"award-number":["00201510"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2017,5]]},"DOI":"10.1007\/s10107-016-1057-8","type":"journal-article","created":{"date-parts":[[2016,8,19]],"date-time":"2016-08-19T11:20:17Z","timestamp":1471605617000},"page":"85-114","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":108,"title":["Iteration complexity analysis of block coordinate descent methods"],"prefix":"10.1007","volume":"163","author":[{"given":"Mingyi","family":"Hong","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiangfeng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Meisam","family":"Razaviyayn","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zhi-Quan","family":"Luo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,8,19]]},"reference":[{"issue":"1","key":"1057_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1137\/13094829X","volume":"25","author":"A Beck","year":"2015","unstructured":"Beck, A.: On the convergence of alternating minimization with applications to iteratively reweighted least squares and decomposition schemes. SIAM J. Optim. 25(1), 185\u2013209 (2015)","journal-title":"SIAM J. Optim."},{"issue":"4","key":"1057_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":"1057_CR3","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"key":"1057_CR4","volume-title":"Neuro-Dynamic Programming","author":"DP Bertsekas","year":"1996","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Neuro-Dynamic Programming. Athena Scientific, Belmont (1996)"},{"key":"1057_CR5","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"DP Bertsekas","year":"1997","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods, 2nd edn. Athena Scientific, Belmont (1997)","edition":"2"},{"issue":"1","key":"1057_CR6","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1137\/110834524","volume":"22","author":"B Chen","year":"2012","unstructured":"Chen, B., He, S., Li, Z., Zhang, S.: Maximum block improvement and polynomial optimization. SIAM J. Optim. 22(1), 87\u2013107 (2012)","journal-title":"SIAM J. Optim."},{"key":"1057_CR7","doi-asserted-by":"crossref","unstructured":"Combettes, P., Pesquet, J.-C.: Proximal splitting methods in signal processing. In: Bauschke, H.H., Burachik, R., Combettes, P.L., Elser, V., Luke, D.R., Wolkowicz, H. (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering, Springer Optimization and Its Applications, pp. 185\u2013212. Springer, New York (2011)","DOI":"10.1007\/978-1-4419-9569-8_10"},{"key":"1057_CR8","doi-asserted-by":"publisher","DOI":"10.1002\/047174882X","volume-title":"Elements of Information Theory","author":"TM Cover","year":"2005","unstructured":"Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley, Hoboken (2005)","edition":"2"},{"issue":"1","key":"1057_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1002\/cpa.20303","volume":"63","author":"I Daubechies","year":"2010","unstructured":"Daubechies, I., DeVore, R., Fornasier, M., Gunturk, C.S.: Iteratively reweighted least squares minimization for sparse recovery. Commun. Pure Appl. Math. 63(1), 1\u201338 (2010)","journal-title":"Commun. Pure Appl. Math."},{"issue":"1","key":"1057_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.18637\/jss.v033.i01","volume":"33","author":"J Friedman","year":"2010","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: Regularization paths for generalized linear models via coordinate descent. J. Stat. Softw. 33(1), 1\u201322 (2010)","journal-title":"J. Stat. Softw."},{"key":"1057_CR11","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0167-6377(99)00074-7","volume":"26","author":"L Grippo","year":"2000","unstructured":"Grippo, L., Sciandrone, M.: On the convergence of the block nonlinear Gauss\u2013Seidel method under convex constraints. Oper. Res. Lett. 26, 127\u2013136 (2000)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"1057_CR12","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1007\/s101070100280","volume":"92","author":"B He","year":"2002","unstructured":"He, B., Liao, L., Han, D., Yang, H.: A new inexact alternating directions method for monotone variational inequalities. Math. Program. 92(1), 103\u2013118 (2002)","journal-title":"Math. Program."},{"key":"1057_CR13","volume-title":"Convex Analysis and Minimization Algorithms I: Fundamentals","author":"J-B Hiriart-Urruty","year":"1996","unstructured":"Hiriart-Urruty, J.-B., Lemarechal, C.: Convex Analysis and Minimization Algorithms I: Fundamentals. Springer, Berlin (1996)"},{"issue":"1","key":"1057_CR14","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, Z.-Q., Pang, J.-S.: A unified algorithmic framework for block-structured optimization involving big data. IEEE Signal Process. Mag. 33(1), 57\u201377 (2016)","journal-title":"IEEE Signal Process. Mag."},{"key":"1057_CR15","doi-asserted-by":"crossref","unstructured":"Lu, Z., Xiao, L.: On the complexity analysis of randomized block-coordinate descent methods. Math. Program. 152(1), 615\u2013642 (2015)","DOI":"10.1007\/s10107-014-0800-2"},{"issue":"1","key":"1057_CR16","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00939948","volume":"72","author":"Z-Q Luo","year":"1992","unstructured":"Luo, Z.-Q., Tseng, P.: On the convergence of the coordinate descent method for convex differentiable minimization. J. Optim. Theory Appl. 72(1), 7\u201335 (1992)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1057_CR17","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1137\/0330025","volume":"30","author":"Z-Q Luo","year":"1992","unstructured":"Luo, Z.-Q., Tseng, P.: On the linear convergence of descent methods for convex essentially smooth minimization. SIAM J. Control Optim. 30(2), 408\u2013425 (1992)","journal-title":"SIAM J. Control Optim."},{"key":"1057_CR18","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02096261","volume":"46\u201347","author":"Z-Q Luo","year":"1993","unstructured":"Luo, Z.-Q., Tseng, P.: Error bounds and convergence analysis of feasible descent methods: a general approach. Ann. Oper. Res. 46\u201347, 157\u2013178 (1993)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"1057_CR19","doi-asserted-by":"publisher","first-page":"846","DOI":"10.1287\/moor.18.4.846","volume":"18","author":"Z-Q Luo","year":"1993","unstructured":"Luo, Z.-Q., Tseng, P.: On the convergence rate of dual ascent methods for strictly convex minimization. Math. Oper. Res. 18(4), 846\u2013867 (1993)","journal-title":"Math. Oper. Res."},{"key":"1057_CR20","unstructured":"Mairal, J.: Optimization with first-order surrogate functions. In: The Proceedings of the International Conference on Machine Learning (ICML) (2013)"},{"key":"1057_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-8853-9","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"V Nesterov","year":"2004","unstructured":"Nesterov, V.: Introductory Lectures on Convex Optimization: A Basic Course. Springer, Berlin (2004)"},{"issue":"2","key":"1057_CR22","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/100802001","volume":"22","author":"Y Nesterov","year":"2012","unstructured":"Nesterov, Y.: Efficiency of coordiate descent methods on huge-scale optimization problems. SIAM J. Optim. 22(2), 341\u2013362 (2012)","journal-title":"SIAM J. Optim."},{"key":"1057_CR23","volume-title":"Iterative Solution of Nonlinear Equations in Several Variables","author":"JM Ortega","year":"1972","unstructured":"Ortega, J.M., Rheinboldt, W.C.: Iterative Solution of Nonlinear Equations in Several Variables. Academic Press, Cambridge (1972)"},{"issue":"2","key":"1057_CR24","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":"1057_CR25","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\u201338 (2014)","journal-title":"Math. Program."},{"issue":"1","key":"1057_CR26","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1137\/110840054","volume":"23","author":"A Saha","year":"2013","unstructured":"Saha, A., Tewari, A.: On the nonasymptotic convergence of cyclic coordinate descent method. SIAM J. Optim. 23(1), 576\u2013601 (2013)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"1057_CR27","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1109\/TSP.2013.2293126","volume":"63","author":"G Scutari","year":"2014","unstructured":"Scutari, G., Facchinei, F., Song, P., Palomar, D.P., Pang, J.-S.: Decomposition by partial linearization: parallel optimization of multi-agent systems. IEEE Trans. Signal Process. 63(3), 641\u2013656 (2014)","journal-title":"IEEE Trans. Signal Process."},{"key":"1057_CR28","first-page":"1865","volume":"12","author":"S Shalev-Shwartz","year":"2011","unstructured":"Shalev-Shwartz, S., Tewari, A.: Stochastic methods for $$\\ell _1$$ regularized loss minimization. J. Mach. Learn. Res. 12, 1865\u20131892 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"9","key":"1057_CR29","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1023\/A:1017501703105","volume":"103","author":"P Tseng","year":"2001","unstructured":"Tseng, P.: Convergence of a block coordinate descent method for nondifferentiable minimization. J. Optim. Theory Appl. 103(9), 475\u2013494 (2001)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"1057_CR30","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/s10107-010-0394-2","volume":"125","author":"P Tseng","year":"2010","unstructured":"Tseng, P.: Approximation accuracy, gradient methods, and error bound for structured convex optimization. Math. Program. 125(2), 263\u2013295 (2010)","journal-title":"Math. Program."},{"key":"1057_CR31","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/s10957-008-9458-3","volume":"140","author":"P Tseng","year":"2009","unstructured":"Tseng, P., Yun, S.: Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization. J. Optim. Theory Appl. 140, 513\u2013535 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"1057_CR32","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, 387\u2013423 (2009)","journal-title":"Math. Program."},{"issue":"5","key":"1057_CR33","doi-asserted-by":"publisher","first-page":"2792","DOI":"10.1137\/110833543","volume":"34","author":"X Wang","year":"2012","unstructured":"Wang, X., Yuan, X.: The linearized alternating direction method of multipliers for dantzig selector. SIAM J. Sci. Comput. 34(5), 2792\u20132811 (2012)","journal-title":"SIAM J. Sci. Comput."},{"issue":"2","key":"1057_CR34","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1109\/JSTSP.2010.2042333","volume":"4","author":"J Yang","year":"2010","unstructured":"Yang, J., Zhang, Y., Yin, W.: A fast alternating direction method for TVL1-L2 signal reconstruction from partial fourier data. IEEE J. Sel. Top. Signal Process. 4(2), 288\u2013297 (2010)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"issue":"1","key":"1057_CR35","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1109\/TIT.2003.821988","volume":"50","author":"W Yu","year":"2004","unstructured":"Yu, W., Rhee, W., Boyd, S., Cioffi, J.M.: Iterative water-filling for Gaussian vector multiple-access channels. IEEE Trans. Inf. Theory 50(1), 145\u2013152 (2004)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1057_CR36","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s40305-013-0015-x","volume":"1","author":"H Zhang","year":"2013","unstructured":"Zhang, H., Jiang, J., Luo, Z.-Q.: On the linear convergence of a proximal gradient method for a class of nonsmooth convex minimization problems. J. Oper. Res. Soc. China 1(2), 163\u2013186 (2013)","journal-title":"J. Oper. Res. Soc. China"},{"issue":"1","key":"1057_CR37","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s10915-010-9408-8","volume":"46","author":"X Zhang","year":"2011","unstructured":"Zhang, X., Burger, M., Osher, S.: A unified primal-dual algorithm framework based on Bregman iteration. J. Sci. Comput. 46(1), 20\u201346 (2011)","journal-title":"J. Sci. Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1057-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-016-1057-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1057-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-016-1057-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T16:15:07Z","timestamp":1589645707000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-016-1057-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,8,19]]},"references-count":37,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2017,5]]}},"alternative-id":["1057"],"URL":"https:\/\/doi.org\/10.1007\/s10107-016-1057-8","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,8,19]]},"assertion":[{"value":"28 April 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 July 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 August 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}