{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,30]],"date-time":"2024-07-30T09:12:21Z","timestamp":1722330741148},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,2,17]],"date-time":"2006-02-17T00:00:00Z","timestamp":1140134400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["CMS"],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1007\/s10287-005-0004-6","type":"journal-article","created":{"date-parts":[[2006,2,16]],"date-time":"2006-02-16T08:36:20Z","timestamp":1140078980000},"page":"131-145","source":"Crossref","is-referenced-by-count":18,"title":["An Improved Gradient Projection-based Decomposition Technique for Support Vector Machines"],"prefix":"10.1007","volume":"3","author":[{"given":"Luca","family":"Zanni","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,2,17]]},"reference":[{"issue":"1","key":"4_CR1","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1093\/imanum\/8.1.141","volume":"8","author":"J Barzilai","year":"1988","unstructured":"Barzilai J, Borwein JM (1988) Two-point step size gradient methods. IMA J Numer Anal 8(1):141\u2013148","journal-title":"IMA J Numer Anal"},{"key":"4_CR2","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas DP (1999) Nonlinear programming. Athena Scientific, Belmont, MA"},{"issue":"4","key":"4_CR3","doi-asserted-by":"crossref","first-page":"1196","DOI":"10.1137\/S1052623497330963","volume":"10","author":"EG Birgin","year":"2000","unstructured":"Birgin EG, Mart\u00ednez JM, Raydan M (2000) Nonmonotone spectral projected gradient methods on convex sets. SIAM J Optim 10(4):1196\u20131211","journal-title":"SIAM J Optim"},{"key":"4_CR4","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/130385.130401","volume-title":"Proceedings of the 5th annual ACM workshop on computational learning theory","author":"B Boser","year":"1992","unstructured":"Boser B, Guyon I, Vapnik VN (1992). A training algorithm for optimal margin classifiers. In: Haussler D (eds). Proceedings of the 5th annual ACM workshop on computational learning theory. ACM Press, Pittsburgh, PA, pp 144\u2013152"},{"key":"4_CR5","unstructured":"Chang CC, Lin CJ (2001), LIBSVM: a library for support vector machines. www.csie.ntu.edu.tw\/\u223ccjlin\/libsvm"},{"key":"4_CR6","first-page":"143","volume":"1","author":"R Collobert","year":"2001","unstructured":"Collobert R, Bengio S (2001) SVMTorch: support vector machines for large-scale regression problems. J Mach Learn Res 1:143\u2013160","journal-title":"J Mach Learn Res"},{"key":"4_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 (2000) An introduction to support vector machines and other Kernel-based learning methods. Cambridge University Press, Cambridge, UK"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Dai YH, Fletcher R (2005a) New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. Math Program (To appear). Also published as research report NA\/216, Department of Mathematics, University of Dundee, Dundee, UK","DOI":"10.1007\/s10107-005-0595-2"},{"issue":"1","key":"4_CR9","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s00211-004-0569-y","volume":"100","author":"YH Dai","year":"2005b","unstructured":"Dai YH, Fletcher R (2005b) Projected Barzilai\u2013Borwein methods for large-scale box-constrained quadratic programming. Numer Math 100(1):21\u201347","journal-title":"Numer Math"},{"key":"4_CR10","volume-title":"On the Barzilai\u2013Borwein method","author":"R Fletcher","year":"2001","unstructured":"Fletcher R (2001) On the Barzilai\u2013Borwein method. Research report NA 207, Department of Mathematics, University of Dundee, Dundee UK"},{"key":"4_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02591962","volume":"27","author":"D Goldfarb","year":"1983","unstructured":"Goldfarb D, Idnani A (1983) A numerically stable dual method for solving strictly convex quadratic programs. Math Program 27:1\u201333","journal-title":"Math Program"},{"key":"4_CR12","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1137\/0723046","volume":"23","author":"L Grippo","year":"1986","unstructured":"Grippo L, Lampariello F, Lucidi S (1986) A nonmonotone line search technique for Newton\u2019s method. SIAM J Numer Anal 23:707\u2013716","journal-title":"SIAM J Numer Anal"},{"key":"4_CR13","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1023\/A:1020587701058","volume":"23","author":"L Grippo","year":"2002","unstructured":"Grippo L, Sciandrone M (2002) Nonmonotone globalization techniques for the Barzilai\u2013Borwein gradient method. Comput Optim Appl 23:143\u2013169","journal-title":"Comput Optim Appl"},{"key":"4_CR14","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1023\/A:1012427100071","volume":"46","author":"CW Hsu","year":"2002","unstructured":"Hsu CW, Lin CJ (2002) A simple decomposition method for support vector machines. Mach Learn 46:291\u2013314","journal-title":"Mach Learn"},{"key":"4_CR15","volume-title":"Advances in kernel methods \u2013 support vector learning","author":"T Joachims","year":"1998","unstructured":"Joachims T (1998). Making large-scale SVM learning practical. In: Sch\u00f6lkopf B, Burges C, Smola A (eds). Advances in kernel methods \u2013 support vector learning. MIT, Cambridge"},{"key":"4_CR16","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1023\/A:1012431217818","volume":"46","author":"S Keerthi","year":"2002","unstructured":"Keerthi S, Gilbert E (2002) Convergence of a generalized SMO algorithm for SVM classifier design. Mach Learn 46:351\u2013360","journal-title":"Mach Learn"},{"key":"4_CR17","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1162\/089976601300014493","volume":"13","author":"S Keerthi","year":"2001","unstructured":"Keerthi S, Shevade S, Bhattacharyya C, Murthy K (2001) Improvements to platt\u2019s SMO algorithm for SVM classifier design. Neural Comput 13:637\u2013649","journal-title":"Neural Comput"},{"key":"4_CR18","unstructured":"LeCun Y (1998) The MNIST database of handwritten digits yann.lecun.com\/exdb\/mnist"},{"key":"4_CR19","doi-asserted-by":"crossref","first-page":"1288","DOI":"10.1109\/72.963765","volume":"12","author":"CJ Lin","year":"2001a","unstructured":"Lin CJ (2001a) On the convergence of the decomposition method for support vector machines. IEEE Trans Neural Netw 12:1288\u20131298","journal-title":"IEEE Trans Neural Netw"},{"key":"4_CR20","volume-title":"Linear convergence of a decomposition method for support vector machines","author":"CJ Lin","year":"2001b","unstructured":"Lin CJ (2001b) Linear convergence of a decomposition method for support vector machines. Technical report, Department of Computer Science and Information Engineering, National Taiwan University, Taipei Taiwan"},{"key":"4_CR21","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1109\/72.977319","volume":"13","author":"CJ Lin","year":"2002","unstructured":"Lin CJ (2002) Asymptotic convergence of an SMO algorithm without any assumptions. IEEE Trans Neural Netw 13:248\u2013250","journal-title":"IEEE Trans Neural Netw"},{"key":"4_CR22","unstructured":"Murphy P, Aha D (1992) UCI repository of machine learning data-bases. www.ics.uci.edu\/\u223cmlearn\/MLRepository.html"},{"key":"4_CR23","doi-asserted-by":"crossref","unstructured":"Osuna E, Freund R, Girosi F (1997) Training support vector machines: an application to face detection. In: Proceedings of the IEEE conference on computer vision and pattern recognition (CVPR97). IEEE Computer Society, New York, pp 130\u2013136","DOI":"10.1109\/CVPR.1997.609310"},{"key":"4_CR24","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1080\/10556780512331318209","volume":"20","author":"L Palagi","year":"2005","unstructured":"Palagi L, Sciandrone M (2005) On the convergence of a modified version of SVM l ight algorithm. Optim Methods Softw 20:317\u2013334","journal-title":"Optim Methods Softw"},{"key":"4_CR25","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF01585748","volume":"46","author":"PM Pardalos","year":"1990","unstructured":"Pardalos PM, Kovoor N (1990) An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds. Math Program 46:321\u2013328","journal-title":"Math Program"},{"key":"4_CR26","volume-title":"Advances in kernel methods \u2013 support vector learning","author":"JC Platt","year":"1998","unstructured":"Platt JC (1998). Fast training of support vector machines using sequential minimal optimization. In: Sch\u00f6lkopf B, Burges C, Smola A (eds). Advances in kernel methods \u2013 support vector learning. MIT, Cambridge, MA"},{"key":"4_CR27","volume-title":"Advances in neural information processing systems","author":"JC Platt","year":"1999","unstructured":"Platt JC (1999). Using analytic QP and sparseness to speed training of support vector machines. In: Kearns M et al. (eds). Advances in neural information processing systems, vol 11. MIT, Cambridge, MA"},{"issue":"2","key":"4_CR28","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1004605612267","volume":"104","author":"V Ruggiero","year":"2000a","unstructured":"Ruggiero V, Zanni L (2000a) A modified projection algorithm for large strictly convex quadratic programs. J Optim Theory Appl 104(2):281\u2013299","journal-title":"J Optim Theory Appl"},{"key":"4_CR29","unstructured":"Ruggiero V, Zanni L (2000b) Variable projection methods for large convex quadratic programs. In: Trigiante D (ed) Recent trends in numerical analysis, advances in the theory of computational mathematics, vol 3. Nova Science Publisher, pp 299\u2013313"},{"key":"4_CR30","volume-title":"QL: A Fortran code for convex quadratic programming \u2013 user\u2019s guide","author":"K Schittkowski","year":"2003","unstructured":"Schittkowski K (2003) QL: A Fortran code for convex quadratic programming \u2013 user\u2019s guide. Technical report, Department of Mathematics, University of Bayreuth, Germany"},{"key":"4_CR31","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1080\/10556780512331318182","volume":"20","author":"T Serafini","year":"2005","unstructured":"Serafini T, Zanghirati G, Zanni L (2005) Gradient projection methods for quadratic programs and applications in training support vector machines. Optim Methods Softw 20:353\u2013378","journal-title":"Optim Methods Softw"},{"key":"4_CR32","doi-asserted-by":"crossref","first-page":"583","DOI":"10.1080\/10556780500140714","volume":"20","author":"T Serafini","year":"2005","unstructured":"Serafini T, Zanni L (2005) On the working set selection in gradient projection-based decomposition techniques for support vector machines. Optim Methods Softw 20:583\u2013596","journal-title":"Optim Methods Softw"},{"key":"4_CR33","volume-title":"Statistical learning theory","author":"VN Vapnik","year":"1998","unstructured":"Vapnik VN (1998) Statistical learning theory. Wiley, New York"},{"key":"4_CR34","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1016\/S0167-8191(03)00021-8","volume":"29","author":"G Zanghirati","year":"2003","unstructured":"Zanghirati G, Zanni L (2003) A parallel solver for large quadratic programs in training support vector machines. Parallel Comput 29:535\u2013551","journal-title":"Parallel Comput"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-005-0004-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-005-0004-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-005-0004-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,7,24]],"date-time":"2021-07-24T01:32:11Z","timestamp":1627090331000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-005-0004-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2,17]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["4"],"URL":"https:\/\/doi.org\/10.1007\/s10287-005-0004-6","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2,17]]}}}