On the convergence of the decomposition method for support vector machines
Resource
IEEE Transactions on Neural Networks 12 (6): 1288-1298
Journal
IEEE Transactions on Neural Networks
Journal Volume
12
Journal Issue
6
Pages
1288-1298
Date Issued
2001
Author(s)
Abstract
The decomposition method is currently one of the major methods for solving support vector machines (SVM). Its convergence properties have not been fully understood. The general asymptotic convergence was first proposed by Chang et al. However, their working set selection does not coincide with existing implementation. A later breakthrough by Keerthi and Gilbert (2000, 2002) proved the convergence finite termination for practical cases while the size of the working set is restricted to two. In this paper, we prove the asymptotic convergence of the algorithm used by the software SVM(light) and other later implementation. The size of the working set can be any even number. Extensions to other SVM formulations are also discussed.
Type
journal article
File(s)![Thumbnail Image]()
Loading...
Name
10.pdf
Size
253.87 KB
Format
Adobe PDF
Checksum
(MD5):8351c30268f8e410042ce5ce31637cc1