On the convergence of a Jacobi-type algorithm for singly linearly-constrained problems subject to simple bounds

1. Bertsekas D.P., Tsitsiklis J.N.: Parallel and distributed computation. Prentice-Hall, Englewood Cliffs (1989)

   MATH  Google Scholar 

2. Bomze I.M.: Evolution towards the maximum clique. J. Global Optim. 10, 143–164 (1997)

   Article  MATH  MathSciNet  Google Scholar 

3. Cassioli A., Sciandrone M.: A convergent decomposition method for box-constrained optimization problems. Optim. Lett. 3, 397–409 (2009)

   Article  MATH  MathSciNet  Google Scholar 

4. Dai Y.-H., Fletcher R.: New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds. Math. Program. 106(3), 403–421 (2006)

   Article  MATH  MathSciNet  Google Scholar 

5. Ferris M.C., Mangasarian O.L.: Parallel variable distribution. SIAM J. Optim. 4, 815–832 (1994)

   Article  MATH  MathSciNet  Google Scholar 

6. Glasmachers T., Igel C.: Maximum-gain working set selection for SVMs. J. Mach. Learn. Res. 7, 1437–1466 (2006)

   MathSciNet  Google Scholar 

7. Grippo L., Sciandrone M.: Globally convergent block-coordinate techniques for unconstrained optimization. Optim. Methods Softw. 10(4), 587–637 (1999)

   Article  MATH  MathSciNet  Google Scholar 

8. 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)

   Article  MATH  MathSciNet  Google Scholar 

9. Joachims T.: Making large scale SVM learning practical. In: Schölkopf, C.B.B., Burges, C.J.C., Smola, A. (eds) Advances in Kernel Methods—Support Vector Learning, MIT Press, Cambridge (1998)

   Google Scholar 

10. Keerthi S.S., Gilbert E.G.: Convergence of a generalized SMO algorithm for SVM classifier design. Mach. Learn. 46, 351–360 (2002)

    Article  MATH  Google Scholar 

11. Lin C.-J.: On the convergence of the decomposition method for Support Vector Machines. IEEE Trans. Neural Netw. 12, 1288–1298 (2001)

    Article  Google Scholar 

12. Lin C.-J.: Asymptotic convergence of an SMO algorithm without any assumptions. IEEE Trans. Neural Netw. 13, 248–250 (2002)

    Article  Google Scholar 

13. Lin C.-J., Lucidi S., Palagi L., Risi A., Sciandrone M.: A decomposition algorithm model for singly linearly constrained problems subject to lower and upper bounds. J. Optim. Theory Appl. 141(1), 107–126 (2009)

    Article  MATH  MathSciNet  Google Scholar 

14. Lucidi S., Palagi L., Risi A., Sciandrone M.: A convergent decomposition algorithm for support vector machines. Comput. Optim. Appl. 38, 217–234 (2007)

    Article  MATH  MathSciNet  Google Scholar 

15. Lucidi S., Palagi L., Risi A., Sciandrone M.: A convergent hybrid decomposition algorithm model for SVM training. IEEE Trans. Neural Netw. 20(6), 1055–1060 (2009)

    Article  Google Scholar 

16. Markowitz H.: Portfolio selection. J. Finance 7(1), 77–91 (1952)

    Article  Google Scholar 

17. Motzkin T.S., Strauss E.G.: Maxima for graphs and a new proof of a theorem of Turan. Can. J. Math. 17, 533–540 (1965)

    Article  MATH  Google Scholar 

18. Palagi L., Sciandrone M.: On the convergence of a modified version of SVM ^light algorithm. Optim. Methods Softw. 20(2–3), 311–328 (2005)

    MathSciNet  Google Scholar 

19. Serafini T., Zanghirati G., Zanni L.: Gradient projection methods for large quadratic programs and applications in training support vector machines. Optim. Methods Softw. 20, 353–378 (2005)

    Article  MATH  MathSciNet  Google Scholar 

20. Vapnik V.N.: The Nature of Statistical Learning Theory. Springer, New York (1995)

    MATH  Google Scholar 

Download references