Rigorous proof of termination of SMO algorithm for support vector machines

Norikazu Takahashi, Tetsuo Nishi

Research output: Contribution to journalArticle

37 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 1 2005
Externally publishedYes

Keywords

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

ASJC Scopus subject areas

  • Software
  • Computer Science Applications
  • Computer Networks and Communications
  • Artificial Intelligence

Fingerprint Dive into the research topics of 'Rigorous proof of termination of SMO algorithm for support vector machines'. Together they form a unique fingerprint.

  • Cite this