Polynomial-time decomposition algorithms for support vector machines

Machine Learning

Volumn 51, Issue 1, 2003, Pages 51-71

  Hush, Don ^a   Scovel, Clint ^a  

^a LOS ALAMOS NATIONAL LABORATORY   (United States)

Author keywords

Decomposition algorithms; Polynomial time algorithms; Support vector machines

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; LEARNING ALGORITHMS; POLYNOMIALS; VECTORS;

DECOMPOSITION ALGORITHMS; POLYNOMIAL TIME ALGORITHMS; SUPPORT VECTOR MACHINES;

LEARNING SYSTEMS;

EID: 0037399781     PISSN: 08856125     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1021877911972     Document Type: Article

References (14)

1. Avriel, M. (1976). Nonlinear programming: Analysis and methods, 1st edn. Englewood Cliffs, N.J.: Prentice Hall.
2. Chang, C., Hsu, C., & Lin, C. (2000). The analysis of decomposition methods for support vector machines. IEEE Transactions on Neural Networks, 11:4, 1003-1008.
3. Cortes, C., & Vapnik, V. (1995). Support-vector networks. Machine Learning, 20, 273-297.
4. Cristianini, N., & Shawe-Taylor, J. (2000). An introduction to support vector machines and other kernel-based learning methods, 1st edn. Cambridge, UK: Cambridge University Press.
5. Dunn, J. (1979). Rates of convergence for conditional gradient algorithms near singular and non-singular extremals. SIAM J. Control and Optimization, 17:2, 187-211.
6. Joachims, T. (1998). Making large-scale SVM learning practical. In B. Scholkopf, C. Burges, & A. Smola (Eds.), Advances in kernel methods - Support vector learning. Cambridge, MA: MIT Press.
7. Keerthi, S., & Gilbert, E. (2000). Convergence of a generalized SMO algorithm for SVM classifier design. Technical Report CD-00-01, Control Division Technical Report, Department of Mechanical and Production Engineering, National University of Singapor Also in Machine Learning, to appear.
8. Keerthi, S., & Ong, C. (2000). On the role of the threshold parameter in SVM training algorithms. Technical Report CD-00-09, Control Division Technical Report, Department of Mechanical and Production Engineering National University of Singapore.
9. Keerthi, S., Shevade, S., Bhattacharyya, C., Murthy, K. (2001). Improvements to Platt's SMO algorithm for SVM classifier design. Neural Computation, 13, 637-649.
10. Lin, C.-J. (2000) On the convergence of the decomposition method for support vector machines. Technical Report, Department of Computer Science and Information Engineering, National Taiwan University, Taipei, Taiwan. Also in IEEE Trans. Neural Networks, to appear.
11. Osuna, E., Freund, R., & Girosi, F. (1997). Support vector machines: Training and applications. Technical Report AIM-1602, MIT.
12. Platt, J. (1998). Fast training of support vector machines using sequential minimal optimization. In B. Scholkopf, C. Burges, & A. Smola (Eds.), Advances in kernel methods - Support vector learning (pp. 41-64). Cambridge, MA: MIT Press.
13. Vapnik, V. (1998). Statistical learning theory, New York, NY: John Wiley and Sons.
14. Zoutendijk, G. (1970). Methods of feasible directions: A study in linear and non-linear programming. Amsterdam: Elsevier.