{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T07:53:28Z","timestamp":1768722808861,"version":"3.49.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,3,2]],"date-time":"2018-03-02T00:00:00Z","timestamp":1519948800000},"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":[[2018,9]]},"DOI":"10.1007\/s10589-018-9987-0","type":"journal-article","created":{"date-parts":[[2018,3,2]],"date-time":"2018-03-02T11:10:58Z","timestamp":1519989058000},"page":"115-145","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Parallel decomposition methods for linearly constrained problems subject to simple bound with application to the SVMs training"],"prefix":"10.1007","volume":"71","author":[{"given":"Andrea","family":"Manno","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9496-6097","authenticated-orcid":false,"given":"Laura","family":"Palagi","sequence":"additional","affiliation":[]},{"given":"Simone","family":"Sagratella","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,3,2]]},"reference":[{"key":"9987_CR1","volume-title":"Nonlinear Programming","author":"DP Bertsekas","year":"1995","unstructured":"Bertsekas, D.P.: Nonlinear Programming. Athena Scientific, Belmont (1995)"},{"key":"9987_CR2","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. arXiv preprint \n                    arXiv:1606.04838\n                    \n                   (2016)"},{"issue":"4","key":"9987_CR3","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1109\/TNN.2006.875989","volume":"17","author":"LJ Cao","year":"2006","unstructured":"Cao, L.J., Keerthi, S.S., Ong, C.J., Zhang, J.Q., Lee, H.P.: Parallel sequential minimal optimization for the training of support vector machines. IEEE Trans. Neural Netw. 17(4), 1039\u20131049 (2006)","journal-title":"IEEE Trans. Neural Netw."},{"key":"9987_CR4","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2, 27:1\u201327:27 (2011). Software available at \n                    http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm"},{"issue":"4","key":"9987_CR5","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1109\/TNN.2006.875973","volume":"17","author":"PH Chen","year":"2006","unstructured":"Chen, P.H., Fan, R.E., Lin, C.J.: A study on SMO-type decomposition methods for support vector machines. IEEE Trans. Neural Netw. 17(4), 893\u2013908 (2006)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"4","key":"9987_CR6","doi-asserted-by":"publisher","first-page":"961","DOI":"10.1287\/moor.1040.0098","volume":"29","author":"JR Correa","year":"2004","unstructured":"Correa, J.R., Schulz, A.S., Stier-Moses, N.E.: Selfish routing in capacitated networks. Math. Oper. Res. 29(4), 961\u2013976 (2004)","journal-title":"Math. Oper. Res."},{"key":"9987_CR7","unstructured":"Defazio, A., Bach, F., Lacoste-Julien, S.: SAGA: a fast incremental gradient method with support for non-strongly convex composite objectives. In: Advances in Neural Information, vol.\u00a02, pp. 1646\u20131654 (2014)"},{"issue":"7","key":"9987_CR8","doi-asserted-by":"publisher","first-page":"1874","DOI":"10.1109\/TSP.2015.2399858","volume":"63","author":"F Facchinei","year":"2015","unstructured":"Facchinei, F., Scutari, G., Sagratella, S.: Parallel selective algorithms for nonconvex big data optimization. IEEE Trans. Signal Process. 63(7), 1874\u20131889 (2015). \n                    https:\/\/doi.org\/10.1109\/TSP.2015.2399858","journal-title":"IEEE Trans. Signal Process."},{"key":"9987_CR9","first-page":"1871","volume":"9","author":"RE Fan","year":"2008","unstructured":"Fan, R.E., Chang, K.W., Hsieh, C.J., Wang, X.R., Lin, C.J.: LIBLINEAR: a library for large linear classification. J. Mach. Learn. Res. 9, 1871\u20131874 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"9987_CR10","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":"9987_CR11","first-page":"1437","volume":"7","author":"T Glasmachers","year":"2006","unstructured":"Glasmachers, T., Igel, C.: Maximum-gain working set selection for SVMs. J. Mach. Learn. Res. 7, 1437\u20131466 (2006)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"9987_CR12","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1162\/neco.2007.10-06-354","volume":"20","author":"T Glasmachers","year":"2008","unstructured":"Glasmachers, T., Igel, C.: Second-order SMO improves SVM online and active learning. Neural Comput. 20(2), 374\u2013382 (2008)","journal-title":"Neural Comput."},{"issue":"1","key":"9987_CR13","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1137\/090766255","volume":"21","author":"MD Gonzalez-Lima","year":"2011","unstructured":"Gonzalez-Lima, M.D., Hager, W.W., Zhang, H.: An affine-scaling interior-point method for continuous knapsack constraints with application to support vector machines. SIAM J. Optim. 21(1), 361\u2013390 (2011)","journal-title":"SIAM J. Optim."},{"key":"9987_CR14","unstructured":"Graf, H.P., Cosatto, E., Bottou, L., Dourdanovic, I., Vapnik, V.: Parallel support vector machines: the cascade SVM. In: Saul, L.K., Weiss, Y., Bottou, L. (eds.) Advances in Neural Information, vol. 17, pp. 521\u2013528. MIT Press, Cambridge (2004). \n                    http:\/\/books.nips.cc\/papers\/files\/nips17\/NIPS2004_0190.pdf"},{"key":"9987_CR15","volume-title":"Advances in Kernel Methods\u2014Support Vector Learning","author":"T Joachims","year":"1998","unstructured":"Joachims, T.: Making large scale SVM learning practical. In: Sch\u00f6lkopf, C., Burges, C., Smola, A. (eds.) Advances in Kernel Methods\u2014Support Vector Learning. MIT Press, Cambridge (1998)"},{"key":"9987_CR16","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/BFb0121016","volume-title":"Mathematical Programming at Oberwolfach II","author":"PV Kamesam","year":"1984","unstructured":"Kamesam, P.V., Meyer, R.R.: Multipoint methods for separable nonlinear networks. In: Korte, B., Ritter, K. (eds.) Mathematical Programming at Oberwolfach II, pp. 185\u2013205. Springer, Berlin (1984)"},{"issue":"1","key":"9987_CR17","first-page":"203","volume":"2","author":"C Kao","year":"2001","unstructured":"Kao, C., Lee, L.F., Pitt, M.M.: Simulated maximum likelihood estimation of the linear expenditure system with binding non-negativity constraints. Ann. Econ. Finance 2(1), 203\u2013223 (2001)","journal-title":"Ann. Econ. Finance"},{"issue":"1\u20133","key":"9987_CR18","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1012431217818","volume":"46","author":"SS Keerthi","year":"2002","unstructured":"Keerthi, S.S., Gilbert, E.G.: Convergence of a generalized SMO algorithm for SVM classifier design. Mach. Learn. 46(1\u20133), 351\u2013360 (2002)","journal-title":"Mach. Learn."},{"issue":"1","key":"9987_CR19","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10957-008-9489-9","volume":"141","author":"C Lin","year":"2009","unstructured":"Lin, C., 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."},{"key":"9987_CR20","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1109\/72.977319","volume":"13","author":"CJ Lin","year":"2002","unstructured":"Lin, C.J.: Asymptotic convergence of an SMO algorithm without any assumptions. IEEE Trans. Neural Netw. 13, 248\u2013250 (2002)","journal-title":"IEEE Trans. Neural Netw."},{"issue":"5","key":"9987_CR21","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1109\/TNN.2002.1031937","volume":"13","author":"CJ Lin","year":"2002","unstructured":"Lin, C.J.: A formal analysis of stopping criteria of decomposition methods for support vector machines. IEEE Trans. Neural Netw. 13(5), 1045\u20131052 (2002)","journal-title":"IEEE Trans. Neural Netw."},{"key":"9987_CR22","first-page":"285","volume":"16","author":"J Liu","year":"2015","unstructured":"Liu, J., Wright, S., R\u00e9, C., Bittorf, V., Sridhar, S.: An asynchronous parallel stochastic coordinate descent algorithm. J. Mach. Learn. Res. 16, 285\u2013322 (2015)","journal-title":"J. Mach. Learn. Res."},{"issue":"2","key":"9987_CR23","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":"9987_CR24","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":"6","key":"9987_CR25","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1109\/TNN.2009.2020908","volume":"20","author":"S Lucidi","year":"2009","unstructured":"Lucidi, S., Palagi, L., Risi, A., Sciandrone, M.: A convergent hybrid decomposition algorithm model for SVM training. IEEE Trans. Neural Netw. 20(6), 1055\u20131060 (2009)","journal-title":"IEEE Trans. Neural Netw."},{"key":"9987_CR26","doi-asserted-by":"crossref","unstructured":"Manno, A., Sagratella, S., Livi, L.: A convergent and fully distributable SVMs training algorithm. In: 2016 International Joint Conference on Neural Networks (IJCNN), pp. 3076\u20133080. IEEE (2016)","DOI":"10.1109\/IJCNN.2016.7727590"},{"issue":"2\u20133","key":"9987_CR27","first-page":"311","volume":"20","author":"L Palagi","year":"2005","unstructured":"Palagi, L., Sciandrone, M.: On the convergence of a modified version of SVM\n                    \n                      \n                    \n                    $$^{light}$$\n                    \n                      \n                        \n                          \n                          \n                            light\n                          \n                        \n                      \n                    \n                   algorithm. Optim. Method Softw. 20(2\u20133), 311\u2013328 (2005)","journal-title":"Optim. Method Softw."},{"key":"9987_CR28","unstructured":"Risi, A.: Convergent decomposition methods for support vector machines. Ph.D. thesis, Sapienza University of Rome (2008)"},{"issue":"8","key":"9987_CR29","doi-asserted-by":"publisher","first-page":"1945","DOI":"10.1109\/TSP.2016.2637314","volume":"65","author":"G Scutari","year":"2017","unstructured":"Scutari, G., Facchinei, F., Lampariello, L., Sardellitti, S., Song, P.: Parallel and distributed methods for constrained nonconvex optimization-part II: applications in communications and machine learning. IEEE Trans. Signal Process. 65(8), 1945\u20131960 (2017)","journal-title":"IEEE Trans. Signal Process."},{"issue":"1","key":"9987_CR30","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10107-010-0420-4","volume":"127","author":"S Shalev-Shwartz","year":"2011","unstructured":"Shalev-Shwartz, S., Singer, Y., Srebro, N., Cotter, A.: Pegasos: primal estimated sub-gradient solver for SVM. Math. Program. 127(1), 3\u201330 (2011). \n                    https:\/\/doi.org\/10.1007\/s10107-010-0420-4","journal-title":"Math. Program."},{"issue":"1","key":"9987_CR31","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(1), 567\u2013599 (2013)","journal-title":"J. Mach. Learn. Res."},{"issue":"1\u20132","key":"9987_CR32","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/s10107-014-0839-0","volume":"155","author":"S Shalev-Shwartz","year":"2016","unstructured":"Shalev-Shwartz, S., Zhang, T.: Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization. Math. Program. 155(1\u20132), 105\u2013145 (2016)","journal-title":"Math. Program."},{"key":"9987_CR33","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809682","volume-title":"Kernel Methods for Pattern Analysis","author":"J Shawe-Taylor","year":"2004","unstructured":"Shawe-Taylor, J., Cristianini, N.: Kernel Methods for Pattern Analysis. Cambridge University Press, New York (2004)"},{"key":"9987_CR34","first-page":"141","volume":"12","author":"I Steinwart","year":"2011","unstructured":"Steinwart, I., Hush, D., Scovel, C.: Training SVMs without offset. J. Mach. Learn. Res. 12, 141\u2013202 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"9987_CR35","unstructured":"Tak\u00e1c, M., Bijral, A., Richt\u00e1rik, P., Srebro, N.: Mini-batch primal and dual methods for SVMs. In: 30th International Conference on Machine Learning, pp. 537\u2013552. Springer, Berlin (2013)"},{"issue":"2","key":"9987_CR36","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."},{"key":"9987_CR37","doi-asserted-by":"crossref","unstructured":"Yang, J.: An improved cascade SVM training algorithm with crossed feedbacks. In: First International Multi-Symposiums on Computer and Computational Sciences, 2006. IMSCCS \u201906, vol.\u00a02, pp. 735\u2013738 (2006)","DOI":"10.1109\/IMSCCS.2006.183"},{"issue":"4","key":"9987_CR38","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1016\/S0167-8191(03)00021-8","volume":"29","author":"G Zanghirati","year":"2003","unstructured":"Zanghirati, G., Zanni, L.: A parallel solver for large quadratic programs in training support vector machines. Parallel Comput. 29(4), 535\u2013551 (2003)","journal-title":"Parallel Comput."},{"key":"9987_CR39","first-page":"1467","volume":"7","author":"L Zanni","year":"2006","unstructured":"Zanni, L., Serafini, T., Zanghirati, G.: Parallel software for training large scale support vector machines on multiprocessor systems. J. Mach. Learn. Res. 7, 1467\u20131492 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"9987_CR40","unstructured":"Zhang, J.P., Li, Z.W., Yang, J.: A parallel SVM training algorithm on large-scale classification problems. In: Proceedings of 2005 International Conference on Machine Learning and Cybernetics, 2005, vol.\u00a03, pp. 1637\u20131641 (2005)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-018-9987-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-9987-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-018-9987-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T20:16:26Z","timestamp":1551471386000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-018-9987-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,2]]},"references-count":40,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,9]]}},"alternative-id":["9987"],"URL":"https:\/\/doi.org\/10.1007\/s10589-018-9987-0","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,2]]},"assertion":[{"value":"31 March 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 March 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}