A convergent decomposition algorithm for support vector machines

Computational Optimization and Applications

Volumn 38, Issue 2, 2007, Pages 217-234

  Lucidi, S ^a   Palagi, L ^a   Risi, A ^b   Sciandrone, M ^c  

^a SAPIENZA UNIVERSITY OF ROME   (Italy)

^b CNR   (Italy)

^c UNIVERSITY OF FLORENCE   (Italy)

Author keywords

Decomposition methods; Large scale optimization; Proximal point modification; Support vector machine

Indexed keywords

APPROXIMATION ALGORITHMS; CONVERGENCE OF NUMERICAL METHODS; LARGE SCALE SYSTEMS; OPTIMIZATION; PROBLEM SOLVING;

DECOMPOSITION METHODS; LARGE SCALE OPTIMIZATION; PROXIMAL POINT MODIFICATION; REAL WORLD PROBLEMS;

SUPPORT VECTOR MACHINES;

EID: 35348918845     PISSN: 09266003     EISSN: 15732894     Source Type: Journal    
DOI: 10.1007/s10589-007-9044-x     Document Type: Article

References (33)

1. Auslender, A.: Asymptotic properties of the Fenchel dual functional and applications to decomposition problems. J. Optim. Theory Appl. 73, 427-449 (1992)
2. Barr, R.O., Gilbert, E.G.: Some efficient algorithms for a class of abstract optimization problems arising in optimal control. IEEE Trans. Autom. Control 14, 640-652 (1969)
3. Bertsekas, D.P.: Nonlinear Programming, 2nd edn. Athena Scientific, Belmont (1999)
4. Bertsekas, D., Tseng, P.: Partial proximal minimization algorithm for convex programming. SIAM J. Optim. 4, 551-572 (1994)
5. Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation. Prentice-Hall, Englewood Cliffs (1989)
6. Bomze, I.M.: Evolution towards the Maximum clique. J. Glob. Optim. 10, 143-164 (1997)
7. Chang, C.-C., Lin, C.-J.: LIBSVM: a library for support vector machines. Software, available at http://www.csie.ntu.edu.tw/~cjlin/libsvm (2001)
8. Cristianini, N., Shawe-Taylor, J.: An introduction to support vector machines and other kernel-based learning methods. Cambridge University Press, Cambridge (2000)
9. Einbu, J.M.: Optimal allocation of continuous resources to several activities with a concave return function-some theoretical results. Math. Oper. Res. 3, 82-88 (1978)
10. Ferris, M.C., Mangasarian, O.L.: Parallel variable distribution. SIAM J. Optim. 4, 1-21 (1994)
11. Ferris, M.C., Munson, T.S.: Interior-point methods for massive support vector machines. SIAM J. Optim. 13, 783-804 (2003)
12. Grippo, L., Sciandrone, M.: Globally convergent block-coordinate techniques for unconstrained optimization. Optim. Methods Softw. 10(4), 587-637 (1999)
13. Grippo, L., Sciandrone, M.: On the convergence of the block nonlinear Gauss-Seidel method under convex constraints. Oper. Res. Lett. 26(3), 127-136 (2000)
14. Hearn, D.W., Lawphongpanich, S., Ventura, J.A.: Restricted simplicial decomposition: computation and extensions. Math. Program. Study 31, 99-118 (1987)
15. Joachims, T.: Making large scale SVM learning practical. In: Schölkopf, C.B.B., Smola, A. (eds.) Advances in Kernel Methods-Support Vector Learning. MIT, Cambridge (1998)
16. Kao, C., Lee, L.-F., Pitt, M.M.: Simulated Maximum Likelihood Estimation of the linear expenditure system with binding non-negativity constraints. Ann. Econ. Finance 2, 203-223 (2001)
17. Kiwiel, K.C.: A dual method for certain positive semidefinite quadratic problems. SIAM J. Sci. Stat. Comput. 10, 175-186 (1989)
18. Lin, C.-J.: On the convergence of the decomposition method for support vector machines. IEEE Trans. Neural Netw. 12, 1288-1298 (2001)
19. Lin, C.-J.: Asymptotic convergence of an SMO algorithm without any assumptions. IEEE Trans. Neural Netw. 13, 248-250 (2002)
20. Lin, C.-J.: A formal analysis of stopping criteria of decomposition methods for support vector machines. IEEE Trans. Neural Netw. 13, 1045-1052 (2002)
21. Lucidi, S., Sciandrone, M., Tseng, P.: Objective-derivative-free methods for constrained optimization. Math. Program. 92(1), 37-59 (2002)
22. Mangasarian, O.L.: Generalized support vector machines. In: Smola, A., Bartlett, P., Schölkopf, B., Schurmans, D. (eds.) Advances in Large Margin Classifiers, pp. 135-146. MIT, Cambridge (2000)
23. Mangasarian, O.L., Musicant, D.R.: Successive overrelaxation for support vector machines. IEEE Trans. Neural Netw. 10, 1032-1037 (1999)
24. Melman, A., Rabinowitz, G.: An efficient method for a class of continuous knapsack problems. SIAM Rev. 42, 440-448 (2000)
25. Motzkin, T.S., Strauß, E.G.: Maxima for graphs and a new proof of a theorem of Turan. Can. J. Math. 17, 533-540 (1965)
26. Nielsen, S.S., Zenios, S.A.: Massively parallel algorithms for singly constrained convex programming. ORSA J. Comput. 4, 166-181 (1992)
27. Pang, J.S.: A new and efficient algorithm for a class of portfolio selection problem. Oper. Res. 28, 754-767 (1980)
28. Patriksson, M.: Decomposition methods for differentiable optimization problems over Cartesian product sets. Comput. Optim. Appl. 9, 5-42 (1998)
29. Platt, J.: Sequential minimal optimization: a fast algorithm for training support vector machines. In: Schölkopf, C.B.B., Smola, A. (eds.) Advances in Kernel Methods-Support Vector Learning, pp. 185-208. MIT, Cambridge (1998)
30. Powell, M.J.D.: On search directions for minimization algorithms. Math. Program. 4, 193-201 (1973)
31. Tseng, P.: Decomposition algorithms for convex differentiable minimization. J. Optim. Theory Appl. 70, 109-135 (1991)
32. Vapnik, V.N.: The Nature of Statistical Learning Theory. Springer, New York (1995)
33. Ziemba, W.T., Parkan, C., Brooks-Hill, R.: Calculation of investment portfolios with risk free borrowing and lending. Manag. Sci. 21, 209-222 (1974)