{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,13]],"date-time":"2025-11-13T06:46:21Z","timestamp":1763016381151},"reference-count":31,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Parallel Computing"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0167-8191(03)00021-8","type":"journal-article","created":{"date-parts":[[2003,3,26]],"date-time":"2003-03-26T00:16:29Z","timestamp":1048637789000},"page":"535-551","source":"Crossref","is-referenced-by-count":107,"title":["A parallel solver for large quadratic programs in training support vector machines"],"prefix":"10.1016","volume":"29","author":[{"given":"G.","family":"Zanghirati","sequence":"first","affiliation":[]},{"given":"L.","family":"Zanni","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0167-8191(03)00021-8_BIB1","series-title":"Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory","first-page":"144","article-title":"A training algorithm for optimal margin classifiers","author":"Boser","year":"1992"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB2","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1016\/0167-6377(84)90010-5","article-title":"An O(n) algorithm for quadratic knapsack problems","volume":"3","author":"Brucker","year":"1984","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0167-8191(03)00021-8_BIB3","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1023\/A:1009715923555","article-title":"A tutorial on support vector machines for pattern recognition","volume":"2","author":"Burges","year":"1998","journal-title":"Data Mining and Knowledge Discovery"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00994018","article-title":"Support vector network","volume":"20","author":"Cortes","year":"1995","journal-title":"Machine Learning"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB5","unstructured":"M.C. Ferris, T.S. Munson, Interior Point Methods for Massive Support Vector Machines, Technical Report 00-05, Data Mining Institute, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, 2000"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0167-8191(89)90003-3","article-title":"Performance of parallel processors","volume":"12","author":"Flatt","year":"1989","journal-title":"Parallel Comput."},{"key":"10.1016\/S0167-8191(03)00021-8_BIB7","doi-asserted-by":"crossref","unstructured":"G. Fung, O.L. Mangasarian, Proximal Support Vector Machines Classifiers, Technical Report 01-02, Data Mining Institute, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, 2001","DOI":"10.1145\/502512.502527"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB8","series-title":"Advances in Kernel Methods\u2013\u2013Support Vector Learning","article-title":"Making large-scale SVM learning practical","author":"Joachims","year":"1998"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB9","unstructured":"Y. LeCun, MNIST Handwritten Digit Database, available at www.research.att.com\/~yann\/ocr\/mnist"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB10","unstructured":"Y.J. Lee, O.L. Mangasarian, SSVM: A Smooth Support Vector Machines, Technical Report 99-03, Data Mining Institute, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, 1999"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB11","doi-asserted-by":"crossref","unstructured":"Y.J. Lee, O.L. Mangasarian, RSVM: Reduced Support Vector Machines, Technical Report 00-07, Data Mining Institute, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, 2000","DOI":"10.1137\/1.9781611972719.13"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB12","doi-asserted-by":"crossref","first-page":"1288","DOI":"10.1109\/72.963765","article-title":"On the convergence of the decomposition method for support vector machines","volume":"12","author":"Lin","year":"2001","journal-title":"IEEE Trans. Neural Networks"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB13","unstructured":"C.J. Lin, Linear Convergence of a Decomposition Method for Support Vector Machines, Technical Report, Department of Computer Science and Information Engineering, National Taiwan University, Taiwan, 2002"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB14","doi-asserted-by":"crossref","first-page":"1032","DOI":"10.1109\/72.788643","article-title":"Successive overrelaxation for support vector machines","volume":"10","author":"Mangasarian","year":"1999","journal-title":"IEEE Trans. Neural Networks"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB15","unstructured":"O.L. Mangasarian, D.R. Musicant, Active Support Vector Machine Classification, Technical Report 00-04, Data Mining Institute, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, 2000"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB16","unstructured":"O.L. Mangasarian, D.R. Musicant, Lagrangian Support Vector Machines, Technical Report 00-06, Data Mining Institute, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, 2000"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB17","unstructured":"Message Passing Interface Forum, MPI 1.2: A Message-Passing Interface standard (version 1.2), Technical Report, 1995. Available at www.mpi-forum.org"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB18","doi-asserted-by":"crossref","unstructured":"P.M. Murphy, D.W. Aha, UCI Repository of Machine Learning Databases, 1992. Available at www.ics.uci.edu\/~mlearn\/MLRepository.html","DOI":"10.1016\/B978-1-55860-247-2.50006-1"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB19","unstructured":"B. Murtagh, M. Saunders, MINOS 5.4 User\u2019s Guide, System Optimization Laboratory, Stanford University, 1995"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB20","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1287\/ijoc.4.2.166","article-title":"Massively parallel algorithms for single constrained convex programs","volume":"4","author":"Nielsen","year":"1992","journal-title":"ORSA J. Comput."},{"key":"10.1016\/S0167-8191(03)00021-8_BIB21","doi-asserted-by":"crossref","unstructured":"E. Osuna, R. Freund, F. Girosi, An improved training algorithm for support vector machines, in: J. Principe, L. Giles, N. Morgan, E. Wilson, (Eds.), Proceedings of the IEEE Workshop on Neural Networks for Signal Processing, Amelia Island, FL, 1997, pp. 276\u2013285","DOI":"10.1109\/NNSP.1997.622408"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB22","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF01585748","article-title":"An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds","volume":"46","author":"Pardalos","year":"1990","journal-title":"Math. Prog."},{"key":"10.1016\/S0167-8191(03)00021-8_BIB23","series-title":"Advances in Kernel Methods\u2013\u2013Support Vector Learning","article-title":"Fast training of support vector machines using sequential minimal optimization","author":"Platt","year":"1998"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB24","article-title":"Using analytic QP and sparseness to speed training of support vector machines","volume":"vol. 11","author":"Platt","year":"1999"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB25","first-page":"401","article-title":"On the efficiency of splitting and projection methods for large strictly convex quadratic programs","volume":"vol. 36","author":"Ruggiero","year":"1999"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB26","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1023\/A:1004605612267","article-title":"A modified projection algorithm for large strictly convex quadratic programs","volume":"104","author":"Ruggiero","year":"2000","journal-title":"J. Optim. Theory Appl."},{"key":"10.1016\/S0167-8191(03)00021-8_BIB27","first-page":"299","article-title":"Variable projection methods for large convex quadratic programs","volume":"vol. 3","author":"Ruggiero","year":"2000"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB28","unstructured":"A.J. Smola, pr_LOQO, www.kernel-machines.org\/code\/prloqo.tar.gz"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB29","unstructured":"R.J. Vanderbei, LOQO: An Interior Point Code for Quadratic Programming, Technical Report SOR-94-15 Revised, Princeton University, 1998"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB30","series-title":"The Nature of Statistical Learning Theory","author":"Vapnik","year":"1995"},{"key":"10.1016\/S0167-8191(03)00021-8_BIB31","doi-asserted-by":"crossref","unstructured":"G. Zanghirati, L. Zanni, The Variable Projection Methods for Large Quadratic Programs in Training Support Vector Machines, Technical Report, Department of Mathematics, University of Modena and Reggio Emilia, Italy, 2003","DOI":"10.1016\/S0167-8191(03)00021-8"}],"container-title":["Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000218?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167819103000218?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T03:14:23Z","timestamp":1584501263000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167819103000218"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0167819103000218"],"URL":"https:\/\/doi.org\/10.1016\/s0167-8191(03)00021-8","relation":{},"ISSN":["0167-8191"],"issn-type":[{"value":"0167-8191","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}