On the convergence of a modified version of SVMlight algorithm

Optimization Methods and Software

Volumn 20, Issue 2-3, 2005, Pages 317-334

  Palagi, L ^a   Sciandrone, M ^b  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b CNR   (Italy)

Author keywords

Decomposition methods; Proximal point; Support vector machines; SVMlight algorithm

Indexed keywords

COMPUTATIONAL COMPLEXITY; HEURISTIC METHODS; LEARNING SYSTEMS; OPTIMIZATION; PATTERN RECOGNITION; QUADRATIC PROGRAMMING; SET THEORY;

CARTESIAN PRODUCTS; DECOMPOSITION METHODS; PROXIMAL POINTS; SUPPORT VECTOR MACHINES;

ALGORITHMS;

EID: 12444281083     PISSN: 10556788     EISSN: None     Source Type: Journal    
DOI: 10.1080/10556780512331318209     Document Type: Conference Paper

References (16)

1. Cortes, C. and Vapnik, V., 1995, Support-Vector network. Machine Learning, 20, 273-297.
2. Vapnik, V., 1995, The Nature of Statistical Learning Theory (New York: Springer-Verlag).
3. Joachims, T., 1998, Making large scale SVM learning practical. In: C.B.B Schölkopf and A. Smola (Eds) Advances in Kernel Methods-Support Vector Learning (MA: MIT Press).
4. Lucidi, S., Palagi, L. and Sciandrone, M., 2002, Convergent decomposition techniques for linearly constrained optimization. Tech. Rep. 16-02, Department of Computer and System Sciences, University of Rome 'La Sapienza', Rome, Italy.
5. Platt, J.C. 1998, Fast training of support vector machines using sequential minimal optimization. In: C.B.B. Schölkopf and A. Smola (Eds) Advances Kernel Methods-Support Vector Learning (Cambridge, MA: MIT Press).
6. Bertsekas, D. and Tsitsiklis, J., 1989, Parallel and Distributed Computation (Englewood Cliffs, NJ: Prentice-Hall International Editions).
7. Keerthi, S. and Gilbert, E., 2002, Convergence of a generalized SMO algorithm for SVM. Machine Learning, 46, 351-360.
8. Lin, C.-J., 2001, On the convergence of the decomposition method for Support Vector Machines. IEEE Transactions on Neural Networks, 12, 1288-1298.
9. Lin, C.-J., 2002, Asymptotic convergence of an SMO algorithm without any assumptions. IEEE Transactions on Neural Networks, 13, 248-250.
10. Grippo, L. and Sciandrone, M., 1999, Globally convergent block-coordinate techniques for unconstrained optimization. Optimization Methods and Software, 10, 587-637.
11. Grippo, L. and Sciandrone, M., 2000, On the convergence of the block nonlinear Gauss-Seidel method under convex constraints. Operations Research Letters, 26, 127-136.
12. Chang, C.-C. and Lin, C.-J., 2001, LIBSVM: A library for Support Vector Machines (Software available at http://www.csie.ntu.edu.tw/cjlin/libsvm).
13. Lin, C.-J., 2002, A formal analysis of stopping criteria of decomposition methods for support vector machines. IEEE Transactions on Neural Networks, 13, 1045-1052.
14. Chang, C.-C., Hsu, C.-W. and Lin, C.-J., 2000, The anlysis of decomposition methods for support vector machines. IEEE Transactions on Neural Networks, 11, 1003-1008.
15. Auslender, A., 1992, Asymptotic properties of the fenchel dual functional and applications to decomposition problems. Journal of Optimisation Theory and Applications, 73, 427-449.
16. Bertsekas, D. and Tseng, P., 1994, Partial proximal minimization algorithm for convex programming. SIAM Journal of Optimization, 4, 551-572.