January 1, 2002

Asymptotic convergence of an SMO algorithm without any assumptions

Key Points

Key points are not available for this paper at this time.

Abstract

The asymptotic convergence of C.-J. Lin (2001) can be applied to a modified SMO (sequential minimal optimization) algorithm by S.S. Keerthi et al. (2001) with some assumptions. The author shows that for this algorithm those assumptions are not necessary.

KI fragen

Bookmark

Cite This Study

Chih‐Jen Lin (Tue,) studied this question.

synapsesocial.com/papers/6a09b80616dfdfe7ed345101 https://doi.org/https://doi.org/10.1109/72.977319

Also Consider

Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context:

1On the convergence of the decomposition method for support vector machines2001 · 250 citations
2The analysis of decomposition methods for support vector machines2000 · 165 citations
3Convergence of a Generalized SMO Algorithm for SVM Classifier Design2002 · 306 citations
4Making Large-Scale SVM Learning Practical2006 · 4,328 citations
5Statistical Learning Theory1999 · 26,963 citations

KI fragen

Bookmark