Rigorous proof of termination of SMO algorithm for support vector machines

Norikazu Takahashi, Tetsuo Nishi

Research output: Contribution to journalArticle

35 Citations (Scopus)

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.

Original languageEnglish
Pages (from-to)774-776
Number of pages3
JournalIEEE Transactions on Neural Networks
Volume16
Issue number3
DOIs
Publication statusPublished - May 2005
Externally publishedYes

    Fingerprint

Keywords

  • Convergence
  • Sequential minimal optimization (SMO) algorithm
  • Support vector machines (SVMs)
  • Termination

ASJC Scopus subject areas

  • Control and Systems Engineering
  • Theoretical Computer Science
  • Electrical and Electronic Engineering
  • Artificial Intelligence
  • Computational Theory and Mathematics
  • Hardware and Architecture

Cite this