{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T17:36:34Z","timestamp":1767893794345,"version":"3.49.0"},"reference-count":75,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,5,23]],"date-time":"2018-05-23T00:00:00Z","timestamp":1527033600000},"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":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2018,6]]},"DOI":"10.1007\/s10288-018-0378-2","type":"journal-article","created":{"date-parts":[[2018,5,23]],"date-time":"2018-05-23T12:08:13Z","timestamp":1527077293000},"page":"111-149","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Nonlinear optimization and support vector machines"],"prefix":"10.1007","volume":"16","author":[{"given":"Veronica","family":"Piccialli","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5234-3174","authenticated-orcid":false,"given":"Marco","family":"Sciandrone","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,23]]},"reference":[{"key":"378_CR1","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1007\/s10957-013-0458-6","volume":"164","author":"A Astorino","year":"2015","unstructured":"Astorino A, Fuduli A (2015) Support vector machine polyhedral separability in semisupervised learning. J Optim Theory Appl 164:1039\u20131050","journal-title":"J Optim Theory Appl"},{"key":"378_CR2","volume-title":"Nonlinear programming","author":"DP Bertsekas","year":"1999","unstructured":"Bertsekas DP (1999) Nonlinear programming. Athena Scientific, Belmont"},{"key":"378_CR3","volume-title":"Pattern recognition and machine learning","author":"CM Bishop","year":"2006","unstructured":"Bishop CM (2006) Pattern recognition and machine learning. Springer, Berlin"},{"key":"378_CR4","doi-asserted-by":"crossref","unstructured":"Boser BE, Guyon IM, Vapnik VN (1992) A training algorithm for optimal margin classifiers. In: Proceedings of the fifth annual workshop on computational learning theory, COLT \u201992. ACM, New York, pp 144\u2013152","DOI":"10.1145\/130385.130401"},{"key":"378_CR5","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1137\/10079923X","volume":"21","author":"RH Byrd","year":"2011","unstructured":"Byrd RH, Chin GM, Neveitt W, Nocedal J (2011) On the use of stochastic hessian information in optimization methods for machine learning. SIAM J Optim 21:977\u2013995","journal-title":"SIAM J Optim"},{"key":"378_CR6","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/j.cor.2012.05.015","volume":"40","author":"E Carrizosa","year":"2013","unstructured":"Carrizosa E, Romero Morales D (2013) Supervised classification and mathematical optimization. Comput Oper Res 40:150\u2013165","journal-title":"Comput Oper Res"},{"key":"378_CR7","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1016\/j.ejor.2012.09.004","volume":"224","author":"A Cassioli","year":"2013","unstructured":"Cassioli A, Chiavaioli A, Manes C, Sciandrone M (2013) An incremental least squares algorithm for large scale linear classification. Eur J Oper Res 224:560\u2013565","journal-title":"Eur J Oper Res"},{"key":"378_CR8","doi-asserted-by":"publisher","first-page":"1003","DOI":"10.1109\/72.857780","volume":"11","author":"CC Chang","year":"2000","unstructured":"Chang CC, Hsu CW, Lin CJ (2000) The analysis of decomposition methods for support vector machines. IEEE Trans Neural Netw Learn Syst 11:1003\u20131008","journal-title":"IEEE Trans Neural Netw Learn Syst"},{"key":"378_CR9","first-page":"1369","volume":"9","author":"KW Chang","year":"2008","unstructured":"Chang KW, Hsieh CJ, Lin CJ (2008) Coordinate descent method for large-scale l2-loss linear support vector machines. J Mach Learn Res 9:1369\u20131398","journal-title":"J Mach Learn Res"},{"key":"378_CR10","doi-asserted-by":"publisher","first-page":"1155","DOI":"10.1162\/neco.2007.19.5.1155","volume":"19","author":"O Chapelle","year":"2007","unstructured":"Chapelle O (2007) Training a support vector machine in the primal. Neural Comput 19:1155\u20131178","journal-title":"Neural Comput"},{"key":"378_CR11","doi-asserted-by":"publisher","first-page":"893","DOI":"10.1109\/TNN.2006.875973","volume":"17","author":"PH Chen","year":"2006","unstructured":"Chen PH, Fan RE, Lin CJ (2006) A study on smo-type decomposition methods for support vector machines. IEEE Trans Neural Netw 17:893\u2013908","journal-title":"IEEE Trans Neural Netw"},{"key":"378_CR12","doi-asserted-by":"crossref","unstructured":"Chiang WL, Lee MC, Lin CJ (2016) Parallel dual coordinate descent method for large-scale linear classification in multi-core environments. In: Proceedings of the 22Nd ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201916. ACM, New York, pp 1485\u20131494","DOI":"10.1145\/2939672.2939826"},{"key":"378_CR13","first-page":"273","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes C, Vapnik V (1995) Support-vector networks. Mach Learn 20:273\u2013297","journal-title":"Mach Learn"},{"key":"378_CR14","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1007\/s10107-005-0595-2","volume":"106","author":"HY Dai","year":"2006","unstructured":"Dai HY, Fletcher R (2006) New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. Math Programm 106:403\u2013421","journal-title":"Math Programm"},{"key":"378_CR15","first-page":"1871","volume":"9","author":"RE Fan","year":"2008","unstructured":"Fan RE, Chang KW, Hsieh CJ, Wang XR, Lin CJ (2008) Liblinear: a library for large linear classification. J Mach Learn Res 9:1871\u20131874","journal-title":"J Mach Learn Res"},{"key":"378_CR16","first-page":"1889","volume":"6","author":"RE Fan","year":"2005","unstructured":"Fan RE, Chen PH, Lin CJ (2005) Working set selection using second order information for training support vector machines. J Mach Learn Res 6:1889\u20131918","journal-title":"J Mach Learn Res"},{"key":"378_CR17","first-page":"185","volume":"101","author":"MC Ferris","year":"2004","unstructured":"Ferris MC, Munson TS (2004) Semismooth support vector machines. Math Programm B 101:185\u2013204","journal-title":"Math Programm B"},{"key":"378_CR18","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1137\/S1052623400374379","volume":"13","author":"MC Ferris","year":"2002","unstructured":"Ferris MC, Munson TS (2002) Interior-point methods for massive support vector machines. SIAM J Optim 13:783\u2013804","journal-title":"SIAM J Optim"},{"key":"378_CR19","first-page":"243","volume":"2","author":"S Fine","year":"2001","unstructured":"Fine S, Scheinberg K (2001) Efficient svm training using low-rank kernel representations. J Mach Learn Res 2:243\u2013264","journal-title":"J Mach Learn Res"},{"key":"378_CR20","volume-title":"Practical methods of optimization","author":"R Fletcher","year":"1987","unstructured":"Fletcher R (1987) Practical methods of optimization, 2nd edn. Wiley, New York","edition":"2"},{"key":"378_CR21","first-page":"2157","volume":"10","author":"V Franc","year":"2009","unstructured":"Franc V, Sonnenburg S (2009) Optimized cutting plane algorithm for large-scale risk minimization. J Mach Learn Res 10:2157\u20132192","journal-title":"J Mach Learn Res"},{"key":"378_CR22","doi-asserted-by":"crossref","unstructured":"Franc V, Sonnenburg S (2008) Optimized cutting plane algorithm for support vector machines. In: Proceedings of the 25th international conference on machine learning, ICML \u201908. ACM, New York, pp 320\u2013327","DOI":"10.1145\/1390156.1390197"},{"key":"378_CR23","doi-asserted-by":"crossref","unstructured":"Fung G, Mangasarian OL (2001) Proximal support vector machine classifiers. In: Proceedings of the seventh ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201901. ACM New York, pp 77\u201386","DOI":"10.1145\/502512.502527"},{"key":"378_CR24","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.cor.2017.06.001","volume":"87","author":"M Gaudioso","year":"2017","unstructured":"Gaudioso M, Gorgone E, Labb\u00e9 M, Rodr\u00edguez-Ch\u00eda AM (2017) Lagrangian relaxation for svm feature selection. Comput OR 87:137\u2013145","journal-title":"Comput OR"},{"key":"378_CR25","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/s10589-008-9228-z","volume":"47","author":"EM Gertz","year":"2010","unstructured":"Gertz EM, Griffin JD (2010) Using an iterative linear solver in an interior-point method for generating support vector machines. Comput Optim Appl 47:431\u2013453","journal-title":"Comput Optim Appl"},{"key":"378_CR26","first-page":"1437","volume":"7","author":"T Glasmachers","year":"2006","unstructured":"Glasmachers T, Igel C (2006) Maximum-gain working set selection for svms. J Mach Learn Res 7:1437\u20131466","journal-title":"J Mach Learn Res"},{"key":"378_CR27","doi-asserted-by":"publisher","first-page":"806","DOI":"10.1093\/imanum\/drn058","volume":"28","author":"D Goldfarb","year":"2008","unstructured":"Goldfarb D, Scheinberg K (2008) Numerically stable ldlt factorizations in interior point methods for convex quadratic programming. IMA J Numer Anal 28:806\u2013826","journal-title":"IMA J Numer Anal"},{"key":"378_CR28","volume-title":"Matrix computations","author":"GH Golub","year":"1996","unstructured":"Golub GH, Van Loan CF (1996) Matrix computations, 3rd edn. Johns Hopkins University Press, Baltimore","edition":"3"},{"key":"378_CR29","doi-asserted-by":"crossref","unstructured":"Hsieh CJ, Chang KW, Lin CJ, Keerthi SS, Sundararajan S (2008) A dual coordinate descent method for large-scale linear svm. In: Proceedings of the 25th international conference on machine learning, ICML \u201908. ACM, New York, pp 408\u2013415","DOI":"10.1145\/1390156.1390208"},{"key":"378_CR30","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1109\/TNN.2002.1000139","volume":"13","author":"CW Hsu","year":"2002","unstructured":"Hsu CW, Lin CJ (2002) A comparison of methods for multiclass support vector machines. IEEE Trans Neural Netw 13:415\u2013425","journal-title":"IEEE Trans Neural Netw"},{"key":"378_CR31","doi-asserted-by":"publisher","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":"378_CR32","first-page":"311","volume":"11","author":"CH Teo","year":"2010","unstructured":"Teo CH, Vishwanthan SVN, Smola AJ, Le QV (2010) Bundle methods for regularized risk minimization. J Mach Learn Res 11:311\u2013365","journal-title":"J Mach Learn Res"},{"key":"378_CR33","first-page":"169","volume-title":"Advances in kernel methods. Chapter making large-scale support vector machine learning practical","author":"T Joachims","year":"1999","unstructured":"Joachims T (1999) Advances in kernel methods. Chapter making large-scale support vector machine learning practical. MIT Press, Cambridge, pp 169\u2013184"},{"key":"378_CR34","doi-asserted-by":"crossref","unstructured":"Joachims T ( 2006) Training linear svms in linear time. In: Proceedings of the 12th ACM SIGKDD international conference on knowledge discovery and data mining, KDD \u201906. ACM, New York, pp 217\u2013226","DOI":"10.1145\/1150402.1150429"},{"key":"378_CR35","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s10994-009-5108-8","volume":"77","author":"T Joachims","year":"2009","unstructured":"Joachims T, Finley T, Yu CNJ (2009) Cutting-plane training of structural svms. Mach Learn 77:27\u201359","journal-title":"Mach Learn"},{"key":"378_CR36","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/s10994-009-5126-6","volume":"76","author":"T Joachims","year":"2009","unstructured":"Joachims T, Yu CNJ (2009) Sparse kernel svms via cutting-plane training. Mach Learn 76:179\u2013193","journal-title":"Mach Learn"},{"key":"378_CR37","first-page":"341","volume":"6","author":"SS Keerthi","year":"2005","unstructured":"Keerthi SS, DeCoste D (2005) A modified finite Newton method for fast solution of large scale linear svms. J Mach Learn Res 6:341\u2013361","journal-title":"J Mach Learn Res"},{"key":"378_CR38","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1023\/A:1012431217818","volume":"46","author":"SS Keerthi","year":"2002","unstructured":"Keerthi SS, Gilbert EG (2002) Convergence of a generalized smo algorithm for svm classifier design. Mach Learn 46:351\u2013360","journal-title":"Mach Learn"},{"key":"378_CR39","doi-asserted-by":"publisher","first-page":"1667","DOI":"10.1162\/089976603321891855","volume":"15","author":"SS Keerthi","year":"2003","unstructured":"Keerthi SS, Lin CJ (2003) Asymptotic behaviors of support vector machines with gaussian kernel. Neural Comput 15:1667\u20131689","journal-title":"Neural Comput"},{"key":"378_CR40","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1214\/aoms\/1177697089","volume":"41","author":"GS Kimeldorf","year":"1970","unstructured":"Kimeldorf GS, Wahba G (1970) A correspondence between bayesian estimation on stochastic processes and smoothing by splines. Ann Math Stat 41:495\u2013502","journal-title":"Ann Math Stat"},{"key":"378_CR41","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1007\/s10107-006-0050-z","volume":"112","author":"KC Kiwiel","year":"2008","unstructured":"Kiwiel KC (2008) Breakpoint searching algorithms for the continuous quadratic knapsack problem. Math Program 112:473\u2013491","journal-title":"Math Program"},{"key":"378_CR42","first-page":"1377","volume-title":"Advances in neural information processing systems 20","author":"QV Le","year":"2008","unstructured":"Le QV, Smola AJ, Vishwanathan S (2008) Bundle methods for machine learning. In: Platt JC, Koller D, Singer Y, Roweis ST (eds) Advances in neural information processing systems 20. Curran Associates Inc, New York, pp 1377\u20131384"},{"key":"378_CR43","doi-asserted-by":"crossref","unstructured":"Lee MC, Chiang WL, Lin CJ (2015) Fast matrix-vector multiplications for large-scale logistic regression on shared-memory systems. In: Aggarwal C, Zhou Z-H, Tuzhilin A, Xiong H, Wu X (eds) ICDM. IEEE Computer Society, pp 835\u2013840","DOI":"10.1109\/ICDM.2015.75"},{"key":"378_CR44","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1011215321374","volume":"20","author":"YJ Lee","year":"2001","unstructured":"Lee YJ, Mangasarian OL (2001) SSVM: a smooth support vector machine for classification. Comput Optim Appl 20:5\u201322","journal-title":"Comput Optim Appl"},{"key":"378_CR45","doi-asserted-by":"publisher","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 (2009) A decomposition algorithm model for singly linearly constrained problems subject to lower and upper bounds. J Optim Theory Appl 141:107\u2013126","journal-title":"J Optim Theory Appl"},{"key":"378_CR46","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1162\/089976601300014547","volume":"13","author":"CJ Lin","year":"2001","unstructured":"Lin CJ (2001) Formulations of support vector machines: a note from an optimization point of view. Neural Comput 13:307\u2013317","journal-title":"Neural Comput"},{"key":"378_CR47","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1109\/72.963765","volume":"12","author":"CJ Lin","year":"2001","unstructured":"Lin CJ (2001) 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":"378_CR48","doi-asserted-by":"publisher","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":"378_CR49","doi-asserted-by":"publisher","first-page":"1045","DOI":"10.1109\/TNN.2002.1031937","volume":"13","author":"CJ Lin","year":"2002","unstructured":"Lin CJ (2002) A formal analysis of stopping criteria of decomposition methods for support vector machines. IEEE Trans Neural Netw 13:1045\u20131052","journal-title":"IEEE Trans Neural Netw"},{"key":"378_CR50","doi-asserted-by":"publisher","first-page":"1100","DOI":"10.1137\/S1052623498345075","volume":"9","author":"CJ Lin","year":"1999","unstructured":"Lin CJ, Mor\u00e8 JJ (1999) Newton\u2019s method for large bound-constrained optimization problems. SIAM J Optim 9:1100\u20131127","journal-title":"SIAM J Optim"},{"key":"378_CR51","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 (2007) A convergent decomposition algorithm for support vector machines. Comput Optim Appl 38:217\u2013234","journal-title":"Comput Optim Appl"},{"key":"378_CR52","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 (2009) A convergent hybrid decomposition algorithm model for svm training. IEEE Trans Neural Netw 20:1055\u20131060","journal-title":"IEEE Trans Neural Netw"},{"key":"378_CR53","doi-asserted-by":"crossref","unstructured":"Mangasarian OL (1994) Nonlinear programming. Classics in applied mathematics. Society for Industrial and Applied Mathematics. ISBN: 9780898713411","DOI":"10.1137\/1.9781611971255"},{"key":"378_CR54","doi-asserted-by":"publisher","first-page":"913","DOI":"10.1080\/1055678021000028375","volume":"17","author":"OL Mangasarian","year":"2002","unstructured":"Mangasarian OL (2002) A finite Newton method for classification. Optim Methods Softw 17:913\u2013929","journal-title":"Optim Methods Softw"},{"key":"378_CR55","first-page":"1517","volume":"7","author":"OL Mangasarian","year":"2006","unstructured":"Mangasarian OL (2006) Exact 1-norm support vector machines via unconstrained convex differentiable minimization. J Mach Learn Res 7:1517\u20131530","journal-title":"J Mach Learn Res"},{"key":"378_CR56","doi-asserted-by":"publisher","first-page":"1032","DOI":"10.1109\/72.788643","volume":"10","author":"OL Mangasarian","year":"1999","unstructured":"Mangasarian OL, Musicant DR (1999) Successive overrelaxation for support vector machines. IEEE Trans Neural Netw 10:1032\u20131037","journal-title":"IEEE Trans Neural Netw"},{"key":"378_CR57","first-page":"161","volume":"1","author":"OL Mangasarian","year":"2001","unstructured":"Mangasarian OL, Musicant DR (2001) Lagrangian support vector machines. J Mach Learn Res 1:161\u2013177","journal-title":"J Mach Learn Res"},{"key":"378_CR58","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1109\/TNN.2006.873281","volume":"17","author":"ME Mavroforakis","year":"2006","unstructured":"Mavroforakis ME, Theodoridis S (2006) A geometric approach to support vector machine (SVM) classification. IEEE Trans Neural Netw 17:671\u2013682","journal-title":"IEEE Trans Neural Netw"},{"key":"378_CR59","doi-asserted-by":"crossref","unstructured":"Osuna E, Freund R, Girosi F (1997) An improved training algorithm for support vector machines. In: Neural networks for signal processing VII. Proceedings of the 1997 IEEE signal processing society workshop, pp 276\u2013285","DOI":"10.1109\/NNSP.1997.622408"},{"key":"378_CR60","doi-asserted-by":"crossref","unstructured":"Osuna E, Freund R, Girosit F (1997) Training support vector machines: an application to face detection. In Proceedings of IEEE computer society conference on computer vision and pattern recognition, pp 130\u2013136","DOI":"10.1109\/CVPR.1997.609310"},{"key":"378_CR61","doi-asserted-by":"publisher","first-page":"315","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 the svmlight algorithm. Optim Methods Softw 20:315\u2013332","journal-title":"Optim Methods Softw"},{"key":"378_CR62","doi-asserted-by":"publisher","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":"378_CR63","first-page":"185","volume-title":"Advances in kernel methods. Chapter fast training of support vector machines using sequential minimal optimization","author":"JC Platt","year":"1999","unstructured":"Platt JC (1999) Advances in kernel methods. Chapter fast training of support vector machines using sequential minimal optimization. MIT Press, Cambridge, pp 185\u2013208"},{"key":"378_CR64","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4175.001.0001","volume-title":"Learning with Kernels: support vector machines, regularization, optimization, and beyond","author":"B Scholkopf","year":"2001","unstructured":"Scholkopf B, Smola AJ (2001) Learning with Kernels: support vector machines, regularization, optimization, and beyond. MIT Press, Cambridge"},{"key":"378_CR65","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 (2011) Pegasos: primal estimated sub-gradient solver for svm. Math Program 127:3\u201330","journal-title":"Math Program"},{"key":"378_CR66","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 (2004) Kernel methods for pattern analysis. Cambridge University Press, New York"},{"key":"378_CR67","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1023\/A:1018628609742","volume":"9","author":"JAK Suykens","year":"1999","unstructured":"Suykens JAK, Vandewalle J (1999) Least squares support vector machine classifiers. Neural Process Lett 9:293\u2013300","journal-title":"Neural Process Lett"},{"key":"378_CR68","unstructured":"Glasmachers T, Dogan U (2013) Accelerated coordinate descent with adaptive coordinate frequencies. In: Asian conference on machine learning, ACML 2013, Canberra, ACT, Australia, pp 72\u201386"},{"key":"378_CR69","doi-asserted-by":"publisher","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":"378_CR70","first-page":"363","volume":"6","author":"IW Tsang","year":"2005","unstructured":"Tsang IW, Kwok JT, Cheung PM (2005) Core vector machines: fast svm training on very large data sets. J Mach Learn Res 6:363\u2013392","journal-title":"J Mach Learn Res"},{"key":"378_CR71","volume-title":"Statistical learning theory","author":"VN Vapnik","year":"1998","unstructured":"Vapnik VN (1998) Statistical learning theory. Wiley-Interscience, New York"},{"key":"378_CR72","first-page":"1523","volume":"15","author":"PW Wang","year":"2014","unstructured":"Wang PW, Lin CJ (2014) Iteration complexity of feasible descent methods for convex optimization. J Mach Learn Res 15:1523\u20131548","journal-title":"J Mach Learn Res"},{"key":"378_CR73","first-page":"3103","volume":"13","author":"Z Wang","year":"2012","unstructured":"Wang Z, Crammer K, Vucetic S (2012) Breaking the curse of kernelization: budgeted stochastic gradient descent for large-scale svm training. J Mach Learn Res 13:3103\u20133131","journal-title":"J Mach Learn Res"},{"key":"378_CR74","first-page":"1937","volume":"10","author":"K Woodsend","year":"2009","unstructured":"Woodsend K, Gondzio J (2009) Hybrid mpi\/openmp parallel linear support vector machine training. J Mach Learn Res 10:1937\u20131953","journal-title":"J Mach Learn Res"},{"key":"378_CR75","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/s10589-009-9296-8","volume":"49","author":"K Woodsend","year":"2011","unstructured":"Woodsend K, Gondzio J (2011) Exploiting separability in large-scale linear support vector machine training. Comput Optim Appl 49:241\u2013269","journal-title":"Comput Optim Appl"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-018-0378-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0378-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0378-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,6]],"date-time":"2024-07-06T23:04:48Z","timestamp":1720307088000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-018-0378-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,23]]},"references-count":75,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,6]]}},"alternative-id":["378"],"URL":"https:\/\/doi.org\/10.1007\/s10288-018-0378-2","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,23]]},"assertion":[{"value":"22 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 April 2018","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 May 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}