{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T07:28:09Z","timestamp":1777447689589,"version":"3.51.4"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,9,19]],"date-time":"2013-09-19T00:00:00Z","timestamp":1379548800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2014,3]]},"DOI":"10.1007\/s10589-013-9598-8","type":"journal-article","created":{"date-parts":[[2013,9,18]],"date-time":"2013-09-18T18:49:41Z","timestamp":1379530181000},"page":"307-337","source":"Crossref","is-referenced-by-count":54,"title":["A random coordinate descent algorithm for optimization problems with composite objective function and linear coupled constraints"],"prefix":"10.1007","volume":"57","author":[{"given":"Ion","family":"Necoara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrei","family":"Patrascu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,19]]},"reference":[{"key":"9598_CR1","unstructured":"Beck, A., Tetruashvili, L.: On the convergence of block coordinate descent type methods. Tecnical report, Technion (2012)"},{"key":"9598_CR2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1142\/9789814354363_0003","volume-title":"Complexity in Numerical Optimization","author":"P. Berman","year":"1993","unstructured":"Berman, P., Kovoor, N., Pardalos, P.M.: Algorithms for least distance problem. In: Pardalos, P.M. (ed.) Complexity in Numerical Optimization, pp.\u00a033\u201356. World Scientific, Singapore (1993)"},{"key":"9598_CR3","volume-title":"Parallel and Distributed Computation: Numerical Methods","author":"D.P. Bertsekas","year":"2003","unstructured":"Bertsekas, D.P.: Parallel and Distributed Computation: Numerical Methods. Athena Scientific, Nashua (2003)"},{"key":"9598_CR4","volume-title":"Nonlinear Programming","author":"D.P. Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Nashua (1999)"},{"key":"9598_CR5","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1109\/TIT.2005.862083","volume":"52","author":"E. Candes","year":"2006","unstructured":"Candes, E., Romberg, J., Tao, T.: Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inf. Theory 52, 489\u2013509 (2006)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"9598_CR6","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"S. Chen","year":"2001","unstructured":"Chen, S., Donoho, D., Saunders, M.: Atomic decomposition by basis pursuit. SIAM Rev. 43, 129\u2013159 (2001)","journal-title":"SIAM Rev."},{"key":"9598_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"27","author":"C.C. Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 27, 1\u201327 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"issue":"3","key":"9598_CR8","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s10107-005-0595-2","volume":"106","author":"Y.H. Dai","year":"2006","unstructured":"Dai, Y.H., Fletcher, R.: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. Math. Program. 106(3), 403\u2013421 (2006)","journal-title":"Math. Program."},{"issue":"3","key":"9598_CR9","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1137\/S1052623400374379","volume":"13","author":"M.C. Ferris","year":"2003","unstructured":"Ferris, M.C., Munson, T.S.: Interior-point methods for massive support vector machines. SIAM J. Optim. 13(3), 783\u2013804 (2003)","journal-title":"SIAM J. Optim."},{"key":"9598_CR10","first-page":"733","volume":"7","author":"D. Hush","year":"2006","unstructured":"Hush, D., Kelly, P., Scovel, C., Steinwart, I.: QP algorithms with guaranteed accuracy and run time for support vector machines. J. Mach. Learn. Res. 7, 733\u2013769 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"9598_CR11","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1007\/s11075-008-9194-7","volume":"47","author":"J. Judice","year":"2008","unstructured":"Judice, J., Raydan, M., Rosa, S., Santos, S.: On the solution of the symmetric eigenvalue complementarity problem by the spectral projected gradient algorithm. Numer. Algorithms 47, 391\u2013407 (2008)","journal-title":"Numer. Algorithms"},{"key":"9598_CR12","doi-asserted-by":"crossref","first-page":"549","DOI":"10.1007\/s10957-007-9259-0","volume":"134","author":"K.C. Kiwiel","year":"2007","unstructured":"Kiwiel, K.C.: On linear-time algorithms for the continuous quadratic Knapsack problem. J. Optim. Theory Appl. 134, 549\u2013554 (2007)","journal-title":"J. Optim. Theory Appl."},{"key":"9598_CR13","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1007\/s10957-008-9489-9","volume":"141","author":"C.J. Lin","year":"2009","unstructured":"Lin, C.J., Lucidi, S., Palagi, L., Risi, A., Sciandrone, M.: A decomposition algorithm model for singly linearly constrained problems subject to lower and upper bounds. J. Optim. Theory Appl. 141, 107\u2013126 (2009)","journal-title":"J. Optim. Theory Appl."},{"key":"9598_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1007\/11503415_21","volume-title":"General Polynomial Time Decomposition Algorithms","author":"N. List","year":"2005","unstructured":"List, N., Simon, H.U.: General Polynomial Time Decomposition Algorithms. Lecture Notes in Computer Science, vol.\u00a03559, pp.\u00a0308\u2013322. Springer, Berlin (2005)"},{"issue":"5","key":"9598_CR15","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1016\/j.jprocont.2010.12.010","volume":"21","author":"I. Necoara","year":"2011","unstructured":"Necoara, I., Nedelcu, V., Dumitrache, I.: Parallel and distributed optimization methods for estimation and control in networks. J. Process Control 21(5), 756\u2013766 (2011)","journal-title":"J. Process Control"},{"key":"9598_CR16","unstructured":"Necoara, I., Nesterov, Y., Glineur, F.: A random coordinate descent method on large optimization problems with linear constraints. Technical report, University Politehnica Bucharest (2011) http:\/\/acse.pub.ro\/person\/ion-necoara"},{"issue":"7","key":"9598_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/TAC.2013.2265991","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(7), 1\u201312 (2013)","journal-title":"IEEE Trans. Autom. Control"},{"issue":"3","key":"9598_CR18","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/j.jprocont.2012.12.012","volume":"23","author":"I. Necoara","year":"2013","unstructured":"Necoara, I., Clipici, D.: Efficient parallel coordinate descent algorithm for convex optimization problems with separable constraints: application to distributed MPC. J. Process Control 23(3), 243\u2013253 (2013)","journal-title":"J. Process Control"},{"key":"9598_CR19","unstructured":"Nesterov, Y., Shpirko, S.: Primal-dual subgradient method for huge-scale linear conic problems (2012). http:\/\/www.optimization-online.org\/DB_FILE\/2012\/08\/3590.pdf"},{"key":"9598_CR20","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 Academic, Norwell (2004)"},{"key":"9598_CR21","unstructured":"Nesterov, Y.: Gradient methods for minimizing composite objective functions. Core discussion paper, 76\/2007, Universite Catholique de Louvain (2007)"},{"issue":"2","key":"9598_CR22","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":"9598_CR23","series-title":"Advances in Kernel Methods: Support Vector Learning","volume-title":"Fast Training of Support Vector Machines Using Sequential Minimal Optimization","author":"J.C. Platt","year":"1999","unstructured":"Platt, J.C.: Fast Training of Support Vector Machines Using Sequential Minimal Optimization. Advances in Kernel Methods: Support Vector Learning. MIT Press, Cambridge (1999)"},{"key":"9598_CR24","unstructured":"Qin, Z., Scheinberg, K., Goldfarb, D.: Efficient block-coordinate descent algorithms for the group Lasso (2010), submitted"},{"key":"9598_CR25","author":"P. Richtarik","year":"2012","unstructured":"Richtarik, P., Takac, M.: Iteration complexity of randomized block-coordinate descent methods for minimizing a composite function. Math. Program., Ser. A (2012). doi: 10.1007\/s10107-012-0614-z","journal-title":"Math. Program., Ser. A"},{"key":"9598_CR26","doi-asserted-by":"crossref","unstructured":"Richtarik, P., Takac, M.: Efficient serial and parallel coordinate descent methods for huge-scale truss topology design. Oper. Res. Proc., 27\u201332 (2012)","DOI":"10.1007\/978-3-642-29210-1_5"},{"key":"9598_CR27","unstructured":"Richtarik, P., Takac, M.: Parallel coordinate descent methods for big data optimization. Technical report (2012). arXiv:1212.0873"},{"key":"9598_CR28","series-title":"Combinatorial Mathematics and Its Applications","first-page":"104","volume-title":"Proceedings of the Chapel Hill Conference 1967","author":"R.T. Rockafellar","year":"1969","unstructured":"Rockafellar, R.T.: The elementary vectors of a subspace in $\\mathbb {R}^{N}$ . In: Bose, R.C., Downling, T.A. (eds.) Proceedings of the Chapel Hill Conference 1967. Combinatorial Mathematics and Its Applications, pp.\u00a0104\u2013127. University of North Carolina Press, Chapel Hill (1969)"},{"key":"9598_CR29","volume-title":"Network Flows and Monotropic Optimization","author":"R.T. Rockafellar","year":"1984","unstructured":"Rockafellar, R.T.: Network Flows and Monotropic Optimization. Wiley-Interscience, New York (1984)"},{"issue":"1","key":"9598_CR30","doi-asserted-by":"crossref","first-page":"576","DOI":"10.1137\/110840054","volume":"23","author":"A. Saha","year":"2013","unstructured":"Saha, A., Tewari, A.: On the finite time convergence of cyclic coordinate descent methods. SIAM J. Optim. 23(1), 576\u2013601 (2013)","journal-title":"SIAM J. Optim."},{"key":"9598_CR31","unstructured":"Tappenden, R., Richtarik, P., Gondzio, J.: Inexact coordinate descent: complexity and preconditioning (2013). arXiv:1304.5530"},{"key":"9598_CR32","doi-asserted-by":"crossref","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."},{"key":"9598_CR33","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/s10589-008-9215-4","volume":"47","author":"P. Tseng","year":"2010","unstructured":"Tseng, P., Yun, S.: A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training. Comput. Optim. Appl. 47, 179\u2013206 (2010)","journal-title":"Comput. Optim. Appl."},{"key":"9598_CR34","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, 513\u2013535 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"9598_CR35","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1111\/j.1467-9868.2005.00532.x","volume":"68","author":"M. Yuan","year":"2006","unstructured":"Yuan, M., Lin, Y.: Model selection and estimation in regression with grouped variables. J. R. Stat. Soc. B 68(1), 49\u201367 (2006)","journal-title":"J. R. Stat. Soc. B"},{"issue":"3","key":"9598_CR36","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\u20133","key":"9598_CR37","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1023\/A:1022977709811","volume":"25","author":"S. Xu","year":"2003","unstructured":"Xu, S., Freund, M., Sun, J.: Solution methodologies for the smallest enclosing circle problem. Comput. Optim. Appl. 25(1\u20133), 283\u2013292 (2003)","journal-title":"Comput. Optim. Appl."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9598-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-013-9598-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-013-9598-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,24]],"date-time":"2019-07-24T05:52:56Z","timestamp":1563947576000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-013-9598-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,19]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,3]]}},"alternative-id":["9598"],"URL":"https:\/\/doi.org\/10.1007\/s10589-013-9598-8","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,19]]}}}