A parallel solver for large quadratic programs in training support vector machines

Parallel Computing

Volumn 29, Issue 4 SPEC., 2003, Pages 535-551

  Zanghirati, G ^a   Zanni, L ^b  

^a UNIVERSITY OF FERRARA   (Italy)

^b UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

Author keywords

Convex quadratic programs; Parallel computation; Pattern recognition; Projection type methods; Support vector machines

Indexed keywords

PATTERN RECOGNITION; PROBLEM SOLVING; QUADRATIC PROGRAMMING; VECTORS;

SUPPORT VECTOR MACHINES;

PARALLEL PROCESSING SYSTEMS;

EID: 0037378238     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0167-8191(03)00021-8     Document Type: Conference Paper

References (31)

1. Boser B.E., Guyon I.M., Vapnik V.N. A training algorithm for optimal margin classifiers. Haussler D. Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory. 1992;144-152 ACM Press, Pittsburgh, PA.
2. Brucker P. An. O(n) algorithm for quadratic knapsack problems Oper. Res. Lett. 3:1984;163-166.
3. Burges C.J.C. A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery. 2:1998;121-167.
4. Cortes C., Vapnik V.N. Support vector network. Machine Learning. 20:1995;1-25.
5. 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.
6. Flatt H.P., Kennedy K. Performance of parallel processors. Parallel Comput. 12:1989;1-20.
7. 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.
8. Joachims T. Making large-scale SVM learning practical. Schölkopf B., Burges C.J.C., Smola A. Advances in Kernel Methods - Support Vector Learning. 1998;MIT Press, Cambridge, MA.
9. Y. LeCun, MNIST Handwritten Digit Database, available at www.research.att.com/̃yann/ocr/mnist.
10. 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.
11. 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.
12. Lin C.J. On the convergence of the decomposition method for support vector machines. IEEE Trans. Neural Networks. 12:2001;1288-1298.
13. 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.
14. Mangasarian O.L., Musicant D.R. Successive overrelaxation for support vector machines. IEEE Trans. Neural Networks. 10:1999;1032-1037.
15. 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.
16. 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.
17. Message Passing Interface Forum, MPI 1.2: A Message-Passing Interface standard (version 1.2), Technical Report, 1995. Available at www.mpi-forum.org.
18. P.M. Murphy, D.W. Aha, UCI Repository of Machine Learning Databases, 1992. Available at www.ics.uci.edu/̃mlearn/MLRepository.html.
19. B. Murtagh, M. Saunders, MINOS 5.4 User's Guide, System Optimization Laboratory, Stanford University, 1995.
20. Nielsen S.N., Zenios S.A. Massively parallel algorithms for single constrained convex programs. ORSA J. Comput. 4:1992;166-181.
21. 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-285.
22. Pardalos P.M., Kovoor N. An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds. Math. Prog. 46:1990;321-328.
23. Platt J.C. Fast training of support vector machines using sequential minimal optimization. Schölkopf B., Burges C., Smola A. Advances in Kernel Methods - Support Vector Learning. 1998;MIT Press, Cambridge, MA.
24. Platt J.C. Using analytic QP and sparseness to speed training of support vector machines. Kearns M.S., Solla S.A., Cohn D.A. Advances in Neural Information Processing Systems. vol. 11:1999;MIT Press, Cambridge, Mass.
25. Ruggiero V., Zanni L. On the efficiency of splitting and projection methods for large strictly convex quadratic programs. Di Pillo G., Giannessi F. Nonlinear Optimization and Related Topics, Applied Optimization. vol. 36:1999;401-413 Kluwer Academic Publishers.
26. Ruggiero V., Zanni L. A modified projection algorithm for large strictly convex quadratic programs. J. Optim. Theory Appl. 104:2000;281-299.
27. Ruggiero V., Zanni L. Variable projection methods for large convex quadratic programs. Trigiante D. Recent Trends in Numerical Analysis. vol. 3:2000;299-313 Nova Science Publishers.
28. A.J. Smola, pr_LOQO, www.kernel-machines.org/code/prloqo.tar.gz.
29. R.J. Vanderbei, LOQO: An Interior Point Code for Quadratic Programming, Technical Report SOR-94-15 Revised, Princeton University, 1998.
30. Vapnik V.N. The Nature of Statistical Learning Theory. 1995;Springer-Verlag, New York.
31. 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.