{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:49:52Z","timestamp":1764784192583,"version":"3.37.3"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T00:00:00Z","timestamp":1551052800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2019,6]]},"DOI":"10.1007\/s10589-019-00082-0","type":"journal-article","created":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T07:36:22Z","timestamp":1551080182000},"page":"411-452","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["An almost cyclic 2-coordinate descent method for singly linearly constrained problems"],"prefix":"10.1007","volume":"73","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9126-3994","authenticated-orcid":false,"given":"Andrea","family":"Cristofari","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,2,25]]},"reference":[{"issue":"3","key":"82_CR1","doi-asserted-by":"publisher","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."},{"issue":"4","key":"82_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."},{"issue":"2","key":"82_CR3","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/0320018","volume":"20","author":"DP Bertsekas","year":"1982","unstructured":"Bertsekas, D.P.: Projected Newton methods for optimization problems with simple constraints. SIAM J. Control Optim. 20(2), 221\u2013246 (1982)","journal-title":"SIAM J. Control Optim."},{"key":"82_CR4","unstructured":"Bomze, I.M., Rinaldi, F., Rota\u00a0Bul\u00f2, S.: First-order methods for the impatient: support identification in finite time with convergent Frank-Wolfe variants. Optimization Online (2018). \n                    http:\/\/www.optimization-online.org\/DB_HTML\/2018\/07\/6694.html"},{"key":"82_CR5","doi-asserted-by":"crossref","unstructured":"Boser, B.E., Guyon, I.M., Vapnik, V.N.: A training algorithm for optimal margin classifiers. In: Proceedings of the Fifth Annual Workshop on Computational Learning Theory, pp. 144\u2013152. ACM (1992)","DOI":"10.1145\/130385.130401"},{"issue":"3","key":"82_CR6","first-page":"27","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. (TIST) 2(3), 27 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"key":"82_CR7","first-page":"1369","volume":"9","author":"KW Chang","year":"2008","unstructured":"Chang, K.W., Hsieh, C.J., Lin, C.J.: Coordinate descent method for large-scale l2-loss linear support vector machines. J. Mach. Learn. Res. 9, 1369\u20131398 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"82_CR8","unstructured":"Cristofari, A., De\u00a0Santis, M., Lucidi, S., Rinaldi, F.: An active-set algorithmic framework for non-convex optimization problems over the simplex (2018). arXiv preprint \n                    arXiv:1703.07761"},{"key":"82_CR9","first-page":"1889","volume":"6","author":"RE Fan","year":"2005","unstructured":"Fan, R.E., Chen, P.H., Lin, C.J.: Working set selection using second order information for training support vector machines. J. Mach. Learn. Res. 6, 1889\u20131918 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"82_CR10","doi-asserted-by":"crossref","unstructured":"Hsieh, C.J., Chang, K.W., Lin, C.J., Keerthi, S.S., Sundararajan, S.: A dual coordinate descent method for large-scale linear SVM. In: Proceedings of the 25th International Conference on Machine Learning, pp. 408\u2013415. ACM (2008)","DOI":"10.1145\/1390156.1390208"},{"key":"82_CR11","first-page":"169","volume-title":"Advances in Kernel Methods\u2014Support Vector Learning, B","author":"T Joachims","year":"1999","unstructured":"Joachims, T.: Making large-scale support vector machine learning practical. In: Sch\u00f6lkopf, B., Burges, C.J., Smola, A.J. (eds.) Advances in Kernel Methods\u2014Support Vector Learning, B, pp. 169\u2013184. MIT Press, Cambridge (1999)"},{"issue":"3","key":"82_CR12","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1007\/s10589-016-9824-2","volume":"64","author":"IV Konnov","year":"2016","unstructured":"Konnov, I.V.: Selective bi-coordinate variations for resource allocation type problems. Comput. Optim. Appl. 64(3), 821\u2013842 (2016)","journal-title":"Comput. Optim. Appl."},{"issue":"6","key":"82_CR13","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1109\/72.963765","volume":"12","author":"CJ Lin","year":"2001","unstructured":"Lin, C.J.: On the convergence of the decomposition method for support vector machines. IEEE Trans. Neural Netw. 12(6), 1288\u20131298 (2001)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"1","key":"82_CR14","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10957-008-9489-9","volume":"141","author":"CJ Lin","year":"2009","unstructured":"Lin, C.J., Lucidi, S., Palagi, L., Risi, A., Sciandrone, M.: Decomposition algorithm model for singly linearly-constrained problems subject to lower and upper bounds. J. Optim. Theory Appl. 141(1), 107\u2013126 (2009)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"82_CR15","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s11590-010-0214-x","volume":"5","author":"G Liuzzi","year":"2011","unstructured":"Liuzzi, G., Palagi, L., Piacentini, M.: On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds. Optim. Lett. 5(2), 347\u2013362 (2011)","journal-title":"Optim. Lett."},{"issue":"2","key":"82_CR16","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s10589-007-9044-x","volume":"38","author":"S Lucidi","year":"2007","unstructured":"Lucidi, S., Palagi, L., Risi, A., Sciandrone, M.: A convergent decomposition algorithm for support vector machines. Comput. Optim. Appl. 38(2), 217\u2013234 (2007)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"82_CR17","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00939948","volume":"72","author":"ZQ 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":"1","key":"82_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10589-018-9987-0","volume":"71","author":"A Manno","year":"2018","unstructured":"Manno, A., Palagi, L., Sagratella, S.: Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training. Comput. Optim. Appl. 71(1), 115\u2013145 (2018)","journal-title":"Comput. Optim. Appl."},{"issue":"8","key":"82_CR19","doi-asserted-by":"publisher","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":"1","key":"82_CR20","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/s10957-016-1058-z","volume":"173","author":"I Necoara","year":"2017","unstructured":"Necoara, I., Nesterov, Y., Glineur, F.: Random block coordinate descent methods for linearly constrained optimization over networks. J. Optim. Theory Appl. 173(1), 227\u2013254 (2017)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"82_CR21","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s10589-013-9598-8","volume":"57","author":"I Necoara","year":"2014","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)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"82_CR22","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":"82_CR23","volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","author":"Y Nesterov","year":"2013","unstructured":"Nesterov, Y.: Introductory Lectures on Convex Optimization: A Basic Course, vol. 87. Springer, New York (2013)"},{"issue":"2\u20133","key":"82_CR24","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1080\/10556780512331318209","volume":"20","author":"L Palagi","year":"2005","unstructured":"Palagi, L., Sciandrone, M.: On the convergence of a modified version of SVM light algorithm. Optim. Methods Softw. 20(2\u20133), 317\u2013334 (2005)","journal-title":"Optim. Methods Softw."},{"issue":"1","key":"82_CR25","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10898-014-0151-9","volume":"61","author":"A Patrascu","year":"2015","unstructured":"Patrascu, A., Necoara, I.: Efficient random coordinate descent algorithms for large-scale structured nonconvex optimization. J. Glob. Optim. 61(1), 19\u201346 (2015)","journal-title":"J. Glob. Optim."},{"key":"82_CR26","first-page":"185","volume-title":"Advances in Kernel Methods\u2014Support Vector Learning","author":"JC Platt","year":"1998","unstructured":"Platt, J.C.: Sequential minimal optimization: a fast algorithm for training support vector machines. In: Sch\u00f6lkopf, B., Burges, C.J., Smola, A.J. (eds.) Advances in Kernel Methods\u2014Support Vector Learning, pp. 185\u2013208. MIT Press, Cambridge (1998)"},{"key":"82_CR27","unstructured":"Raj, A., Olbrich, J., G\u00e4rtner, B., Sch\u00f6lkopf, B., Jaggi, M.: Screening rules for convex problems (2016). arXiv preprint \n                    arXiv:1609.07478"},{"key":"82_CR28","unstructured":"Reddi, S., Hefny, A., Downey, C., Dubey, A., Sra, S.: Large-scale randomized-coordinate descent methods with non-separable linear constraints (2014). arXiv preprint \n                    arXiv:1409.2617"},{"issue":"3","key":"82_CR29","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1007\/BF00941397","volume":"71","author":"P Tseng","year":"1991","unstructured":"Tseng, P.: Descent methods for convex essentially smooth minimization. J. Optim. Theory Appl. 71(3), 425\u2013463 (1991)","journal-title":"J. Optim. Theory Appl."},{"issue":"2","key":"82_CR30","doi-asserted-by":"publisher","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(2), 179\u2013206 (2010)","journal-title":"Comput. Optim. Appl."},{"issue":"1","key":"82_CR31","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-015-0892-3","volume":"151","author":"SJ Wright","year":"2015","unstructured":"Wright, S.J.: Coordinate descent algorithms. Math. Program. 151(1), 3\u201334 (2015)","journal-title":"Math. Program."},{"issue":"3","key":"82_CR32","doi-asserted-by":"publisher","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":"82_CR33","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1023\/A:1022977709811","volume":"25","author":"S Xu","year":"2003","unstructured":"Xu, S., Freund, R.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\/article\/10.1007\/s10589-019-00082-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00082-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-019-00082-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,24]],"date-time":"2020-02-24T19:23:58Z","timestamp":1582572238000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-019-00082-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,25]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,6]]}},"alternative-id":["82"],"URL":"https:\/\/doi.org\/10.1007\/s10589-019-00082-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[2019,2,25]]},"assertion":[{"value":"15 June 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 February 2019","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}