{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,5]],"date-time":"2026-04-05T14:55:42Z","timestamp":1775400942011,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2008,10,30]],"date-time":"2008-10-30T00:00:00Z","timestamp":1225324800000},"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":[[2010,10]]},"DOI":"10.1007\/s10589-008-9215-4","type":"journal-article","created":{"date-parts":[[2008,10,29]],"date-time":"2008-10-29T11:08:07Z","timestamp":1225278487000},"page":"179-206","source":"Crossref","is-referenced-by-count":42,"title":["A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training"],"prefix":"10.1007","volume":"47","author":[{"given":"Paul","family":"Tseng","sequence":"first","affiliation":[]},{"given":"Sangwoon","family":"Yun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,10,30]]},"reference":[{"key":"9215_CR1","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 the least distance problem. In: Pardalos, P.M. (ed.) Complexity in Numerical Optimization, pp. 33\u201356. World Scientific, Singapore (1993)"},{"key":"9215_CR2","volume-title":"Nonlinear Programming","author":"D.P. Bertsekas","year":"1999","unstructured":"Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)","edition":"2"},{"key":"9215_CR3","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0167-6377(84)90010-5","volume":"3","author":"P. Brucker","year":"1984","unstructured":"Brucker, P.: An O(n) algorithm for quadratic knapsack problems. Oper. Res. Lett. 3, 163\u2013166 (1984)","journal-title":"Oper. Res. Lett."},{"key":"9215_CR4","unstructured":"Chang, C.-C., Lin, C.-J.: LIBSVM: a library for support vector machines (2001). Available from http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm"},{"key":"9215_CR5","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1109\/72.857780","volume":"11","author":"C.-C. Chang","year":"2000","unstructured":"Chang, C.-C., Hsu, C.-W., Lin, C.-J.: The analysis of decomposition methods for support vector machines. IEEE Trans. Neural Netw. 11, 1003\u20131008 (2000)","journal-title":"IEEE Trans. Neural Netw."},{"key":"9215_CR6","doi-asserted-by":"crossref","first-page":"893","DOI":"10.1109\/TNN.2006.875973","volume":"17","author":"P.-H. 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, 893\u2013908 (2006)","journal-title":"IEEE Trans. Neural Netw."},{"key":"9215_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511801389","volume-title":"An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods","author":"N. Cristianini","year":"2000","unstructured":"Cristianini, N., Shawe-Taylor, J.: An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods. Cambridge University Press, Cambridge (2000)"},{"key":"9215_CR8","first-page":"1889","volume":"6","author":"R.-E. 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":"9215_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, 783\u2013804 (2003)","journal-title":"SIAM J. Optim."},{"key":"9215_CR10","first-page":"185","volume":"101","author":"M.C. Ferris","year":"2004","unstructured":"Ferris, M.C., Munson, T.S.: Semismooth support vector machines. Math. Program. 101, 185\u2013204 (2004)","journal-title":"Math. Program."},{"key":"9215_CR11","first-page":"243","volume":"2","author":"S. Fine","year":"2001","unstructured":"Fine, S., Scheinberg, K.: Efficient SVM training using low-rank kernel representations. J. Mach. Learn. Res. 2, 243\u2013264 (2001)","journal-title":"J. Mach. Learn. Res."},{"key":"9215_CR12","volume-title":"Practical Methods of Optimization","author":"R. Fletcher","year":"1987","unstructured":"Fletcher, R.: Practical Methods of Optimization, 2nd edn. Wiley, New York (1987)","edition":"2"},{"key":"9215_CR13","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."},{"key":"9215_CR14","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1023\/A:1021877911972","volume":"51","author":"D. Hush","year":"2003","unstructured":"Hush, D., Scovel, C.: Polynomial-time decomposition algorithms for support vector machines. Mach. Learn. 51, 51\u201371 (2003)","journal-title":"Mach. Learn."},{"key":"9215_CR15","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":"9215_CR16","first-page":"169","volume-title":"Advances in Kernel Methods\u2014Support Vector Learning","author":"T. Joachims","year":"1999","unstructured":"Joachims, T.: Making large-scale SVM learning practical. In: Sch\u00f6lkopf, B., Burges, C.J.C., Smola, A.J. (eds.) Advances in Kernel Methods\u2014Support Vector Learning, pp. 169\u2013184. MIT Press, Cambridge (1999)"},{"key":"9215_CR17","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1023\/A:1012431217818","volume":"46","author":"S.S. Keerthi","year":"2002","unstructured":"Keerthi, S.S., Gilbert, E.G.: Convergence of a generalized SMO algorithm for SVM classifier design. Mach. Learn. 46, 351\u2013360 (2002)","journal-title":"Mach. Learn."},{"key":"9215_CR18","unstructured":"Keerthi, S.S., Ong, C.J.: On the role of the threshold parameter in SVM training algorithm. Technical Report CD-00-09, Department of Mathematical and Production Engineering, National University of Singapore, Singapore (2000)"},{"key":"9215_CR19","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1162\/089976603762553013","volume":"15","author":"S.S. Keerthi","year":"2003","unstructured":"Keerthi, S.S., Shevade, S.K.: SMO algorithm for least-squares SVM formulations. Neural Comput. 15, 487\u2013507 (2003)","journal-title":"Neural Comput."},{"key":"9215_CR20","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1162\/089976601300014493","volume":"13","author":"S.S. Keerthi","year":"2001","unstructured":"Keerthi, S.S., Shevade, S.K., Bhattacharyya, C., Murthy, K.R.K.: Improvements to Platt\u2019s SMO algorithm for SVM classifier design. Neural Comput. 13, 637\u2013649 (2001)","journal-title":"Neural Comput."},{"key":"9215_CR21","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":"9215_CR22","doi-asserted-by":"crossref","first-page":"1288","DOI":"10.1109\/72.963765","volume":"12","author":"C.-J. Lin","year":"2001","unstructured":"Lin, C.-J.: On the convergence of the decomposition method for support vector machines. IEEE Trans. Neural Netw. 12, 1288\u20131298 (2001)","journal-title":"IEEE Trans. Neural Netw."},{"key":"9215_CR23","unstructured":"Lin, C.-J.: Linear convergence of a decomposition method for support vector machines. Technical Report, Department of Computer Science and Information Engineering, Taiwan University, Taipei, Taiwan (2001)"},{"key":"9215_CR24","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1109\/72.977319","volume":"13","author":"C.-J. 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."},{"key":"9215_CR25","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. Technical Report, DIS-Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Rome, January (2007). To appear in J. Optim. Theory Appl."},{"key":"9215_CR26","doi-asserted-by":"crossref","unstructured":"List, N., Simon, H.U.: A general convergence theorem for the decomposition method. In: Proceedings of the 17th Annual Conference on Learning Theory, pp. 363\u2013377 (2004)","DOI":"10.1007\/978-3-540-27819-1_25"},{"key":"9215_CR27","first-page":"308","volume-title":"Lecture Notes in Computer Science","author":"N. List","year":"2005","unstructured":"List, N., Simon, H.U.: General polynomial time decomposition algorithms. In: Lecture Notes in Computer Science, vol. 3559, pp. 308\u2013322. Springer, Berlin (2005)"},{"key":"9215_CR28","unstructured":"Lucidi, S., Palagi, L., Risi, A., Sciandrone, M.: On the convergence of hybrid decomposition methods for SVM training. Technical Report, DIS-Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Rome, July 2006. Submitted to IEEE Trans. Neural Netw."},{"key":"9215_CR29","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1137\/0802004","volume":"2","author":"Z.-Q. Luo","year":"1992","unstructured":"Luo, Z.-Q., Tseng, P.: Error bounds and the convergence analysis of matrix splitting algorithms for the affine variational inequality problem. SIAM J. Optim. 2, 43\u201354 (1992)","journal-title":"SIAM J. Optim."},{"key":"9215_CR30","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1007\/BF02096261","volume":"46","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, 157\u2013178 (1993)","journal-title":"Ann. Oper. Res."},{"key":"9215_CR31","doi-asserted-by":"crossref","first-page":"1032","DOI":"10.1109\/72.788643","volume":"10","author":"O.L. Mangasarian","year":"1999","unstructured":"Mangasarian, O.L., Musicant, D.R.: Successive overrelaxation for support vector machines. IEEE Trans. Neural Netw. 10, 1032\u20131037 (1999)","journal-title":"IEEE Trans. Neural Netw."},{"key":"9215_CR32","doi-asserted-by":"crossref","DOI":"10.1007\/b98874","volume-title":"Numerical Optimization","author":"J. Nocedal","year":"1999","unstructured":"Nocedal, J., Wright, S.J.: Numerical Optimization. Springer, New York (1999)"},{"key":"9215_CR33","doi-asserted-by":"crossref","unstructured":"Osuna, E., Freund, R., Girosi, F.: Improved training algorithm for support vector machines. In: Proc. IEEE NNSP\u201997 (1997)","DOI":"10.1109\/NNSP.1997.622408"},{"key":"9215_CR34","doi-asserted-by":"crossref","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, 317\u2013334 (2005)","journal-title":"Optim. Methods Softw."},{"key":"9215_CR35","first-page":"185","volume-title":"Advances in Kernel Methods-Support Vector Learning","author":"J. Platt","year":"1999","unstructured":"Platt, J.: Sequential minimal optimization: A fast algorithm for training support vector machines. In: Sch\u00f6lkopf, B., Burges, C.J.C., Smola, A.J. (eds.) Advances in Kernel Methods-Support Vector Learning, pp. 185\u2013208. MIT Press, Cambridge (1999)"},{"key":"9215_CR36","first-page":"104","volume-title":"Combinatorial Mathematics and Its Applications, Proc. of the Chapel Hill Conference 1967","author":"R.T. Rockafellar","year":"1969","unstructured":"Rockafellar, R.T.: The elementary vectors of a subspace of R N . In: Bose, R.C., Dowling, T.A. (eds.) Combinatorial Mathematics and Its Applications, Proc. of the Chapel Hill Conference 1967, pp. 104\u2013127. Univ. North Carolina Press, Chapel Hill (1969)"},{"key":"9215_CR37","volume-title":"Network Flows and Monotropic Optimization","author":"R.T. Rockafellar","year":"1998","unstructured":"Rockafellar, R.T.: Network Flows and Monotropic Optimization. Wiley, New York, 1984. Republished by Athena Scientific, Belmont (1998)"},{"key":"9215_CR38","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"R.T. Rockafellar","year":"1998","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Variational Analysis. Springer, New York (1998)"},{"key":"9215_CR39","unstructured":"Saunders, C., Stitson, M.O., Weston, J., Bottou, L., Sch\u00f6lkopf., B., Smola, A.J.: Support vector machine\u2014reference manual. Report CSD-TR-98-03, Department of Computer Science, Royal Holloway, University of London, Egham, UK (1998)"},{"key":"9215_CR40","first-page":"2237","volume":"7","author":"K. Scheinberg","year":"2006","unstructured":"Scheinberg, K.: An efficient implementation of an active set method for SVM. J. Mach. Learn. Res. 7, 2237\u20132257 (2006)","journal-title":"J. Mach. Learn. Res."},{"key":"9215_CR41","doi-asserted-by":"crossref","first-page":"1207","DOI":"10.1162\/089976600300015565","volume":"12","author":"B. Sch\u00f6lkopf","year":"2000","unstructured":"Sch\u00f6lkopf, B., Smola, A.J., Williamson, R.C., Bartlett, P.L.: New support vector algorithms. Neural Comput. 12, 1207\u20131245 (2000)","journal-title":"Neural Comput."},{"key":"9215_CR42","doi-asserted-by":"crossref","unstructured":"Simon, H.U.: On the complexity of working set selection. In: Proceedings of the 15th International Conference on Algorithmic Learning Theory, pp. 324\u2013337 (2004)","DOI":"10.1007\/978-3-540-30215-5_25"},{"key":"9215_CR43","doi-asserted-by":"crossref","DOI":"10.1142\/5089","volume-title":"Least Squares Support Vector Machines","author":"J.A.K. Suykens","year":"2002","unstructured":"Suykens, J.A.K., Van Gestel, T., De Brabanter, J., De Moor, B., Vandewalle, J.: Least Squares Support Vector Machines. World Scientific, Singapore (2002)"},{"key":"9215_CR44","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. B 117, 387\u2013423 (2009)","journal-title":"Math. Program. B"},{"key":"9215_CR45","volume-title":"Estimation of Dependences Based on Empirical Data","author":"V. Vapnik","year":"1982","unstructured":"Vapnik, V.: Estimation of Dependences Based on Empirical Data. Springer, New York (1982)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-008-9215-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-008-9215-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-008-9215-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T07:36:35Z","timestamp":1559288195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-008-9215-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,30]]},"references-count":45,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,10]]}},"alternative-id":["9215"],"URL":"https:\/\/doi.org\/10.1007\/s10589-008-9215-4","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,10,30]]}}}