On the working set selection in gradient projection-based decomposition techniques for support vector machines

Optimization Methods and Software

Volumn 20, Issue 4-5, 2005, Pages 583-596

  Serafini, Thomas ^a   Zanni, Luca ^a  

^a UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

Author keywords

Decomposition techniques; Gradient projection methods; Large scale problems; Quadratic programs; Support vector machines

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; DECOMPOSITION; PROBLEM SOLVING; VECTORS;

DECOMPOSITION TECHNIQUES; GRADIENT PROJECTION METHODS; SUPPORT VECTOR MACHINES;

QUADRATIC PROGRAMMING;

EID: 27744479938     PISSN: 10556788     EISSN: 10294937     Source Type: Journal    
DOI: 10.1080/10556780500140714     Document Type: Conference Paper

References (27)

1. Cristianini, N. and Shawe-Taylor, J., 2000, An Introduction to Support Vector Machines and Other Kernel-Based Learning Methods (Cambridge: Cambridge University Press).
2. Vapnik, V.N., 1998, Statistical Learning Theory (New York: John Wiley and sons).
3. Chang, C.C. and Lin, C.J., 2002, LIBSVM: a library for support vector machines. Available online at: www.csie.ntu.edu.tw/~cjlin/libsvm.
4. Flake, G.W. and Lawrence, S., 2002, Efficient SVM regression training with SMO. Machine Learning, 46(1), 271-290.
5. Keerthi, S.S., Shevade, S.K., Bhattacharyya, C. and Murthy, K.R.K., 2001, Improvements to Platt's SMO algorithm for SVM classifier design. Neural Computation, 13, 637-649.
6. Platt, J.C., 1998, Fast training of support vector machines using sequential minimal optimization. In: B. Schölkopf, C. Burges and A. Smola (Eds) Advances in Kernel Methods-Support Vector Learning (Cambridge, MA: MIT Press).
7. Collobert, R. and Benjo, S., 2001, SVMTorch: support vector machines for large-scale regression problems. Journal of Machine Learning Research, 1, 143-160.
8. Hsu, C.W. and Lin, C.J., 2002, A simple decomposition method for support vector machines. Machine Learning, 46, 291-314.
9. Joachims, T., 1998, Making large-scale SVM learning practical. In: B. Schölkopf, C.J.C. Burges and A. Smola (Eds) Advances in Kernel Methods-Support Vector Learning (Cambridge, MA: MIT Press).
10. Osuna, E. and Freund, R., Girosi, F., 1997, Training support vector machines: an application to face detection. Proceedings of the CVPR'97, IEEE Computer Society, Puerto Rico, 130-136.
11. Zanghirati, G. and Zanni, L., 2003, A parallel solver for large quadratic programs in training support vector machines. Parallel Computing, 29, 535-551.
12. Serafini, T., Zanghirati, G. and Zanni, L., 2005, Gradient projection methods for quadratic programs and applications in training support vector machines. Optimization Methods and Software, 20(2-3), 353-378.
13. Zanghirati, G. and Zanni, L., 2003, Variable projection method for large quadratic programs in training support vector machines. Technical Report 339, Department of Mathematics, University of Ferrara.
14. Dai, Y.H. and Fletcher, R., 2003, New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. Research Report NA/216, Department of Mathematics, University of Dundee.
15. Pardalos, P.M. and Kovoor, N., 1990, An algorithm for a singly constrained class of quadratic programs subject to upper and lower bounds. Mathematical Programming, 46, 321-328.
16. Galligani, E., Ruggiero, V. and Zanni, L., 2003, Variable projection methods for large-scale quadratic optimization in data analysis applications, In: P. Daniele et al., (Ed.) Equilibrium Problems and Variational Models, Nonconvex Optimization and Its Application, 68 (Boston: Kluwer Academic Publication), pp. 186-211.
17. Ruggiero, V. and Zanni, L., 2000, A modified projection algorithm for large strictly convex quadratic programs. Journal of Optimization and Theory Application, 104(2), 281-299.
18. Ruggiero, V. and Zanni, L., 2000, Variable projection methods for large convex quadratic programs. In: D. Trigiante (Ed.) Recent Trends in Numerical Analysis. Advances in the Theory of Computational Mathematics 3, Nova Science Publication, 299-313.
19. Chang, C.C., Hsu, C.W. and Lin, C.J., 2000, The analysis of decomposition methods for support vector machines. IEEE Transactions on Neural Networks, 11(4), 1003-1008.
20. Lin, C.J., 2001, On the convergence of the decomposition method for support vector machines. IEEE Transactions on Neural Networks, 12, 1288-1298.
21. Lin, C.J., 2001, Linear convergence of a decomposition method for support vector machines. Technical Report, Department of Computer Science and Information Engineering, National Taiwan University.
22. Keerthi, S.S. and Gilbert, E.G., 2002, Convergence of a generalized SMO algorithm for SVM classifier design. Machine Learning, 46, 351-360.
23. Lin, C.J., 2002, Asymptotic convergence of an SMO algorithm without any assumptions. IEEE Transactions on Neural Networks, 13, 248-250.
24. light algorithm. Optimization Methods and Software, 20(2-3), 317-334.
25. Mangasarian, O.L. and Musicant, D.R., 1999, Successive overrelaxation for support vector machines. IEEE Transactions on Neural Networks, 10, 1032-1037.
26. Murphy, P.M. and Aha, D.W., 1992, UCI repository of machine learning databases. Avabilable online at: www.ics.uci.edu/~mlearn/MLRepository.html.
27. LeCun, Y., The MNIST Database of handwritten digit. Available online at: yann.lecun.com/exdb/mnist.