title: Rigorous proof of termination of SMO algorithm for support vector machines.
abstract: Sequential minimal optimization (SMO) algorithm is one of the simplest decomposition methods for learning of support vector machines (SVMs). Keerthi and Gilbert have recently studied the convergence property of SMO algorithm and given a proof that SMO algorithm always stops within a finite number of iterations. In this letter, we point out the incompleteness of their proof and give a more rigorous proof.
authors.forename: Norikazu
authors.initials: N
authors.lastname: Takahashi
authors.forename: Tetsuo
authors.initials: T
authors.lastname: Nishi
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D016000:Cluster Analysis; D003198:Computer Simulation; D003205:Computing Methodologies; D008962:Models, Theoretical; D016571:Neural Networks, Computer; D010363:Pattern Recognition, Automated / Q000379:methods*