A common framework for the convergence of the GSK, MDM and SMO algorithms

Authors:
Jorge López;José R. Dorronsoro
Affiliations:
Dpto. de Ingeniería Informática and Instituto de Ingeniería del Conocimiento, Universidad Autónoma de Madrid, Madrid, Spain;Dpto. de Ingeniería Informática and Instituto de Ingeniería del Conocimiento, Universidad Autónoma de Madrid, Madrid, Spain
Venue:
ICANN'10 Proceedings of the 20th international conference on Artificial neural networks: Part II
Year:
2010

Citing 3
Cited 2

A Simple Proof of the Convergence of the SMO Algorithm for Linearly Separable Problems

ICANN '09 Proceedings of the 19th International Conference on Artificial Neural Networks: Part I
A fast iterative nearest point algorithm for support vector machine classifier design

IEEE Transactions on Neural Networks
On the convergence of the decomposition method for support vector machines

IEEE Transactions on Neural Networks

Clipping algorithms for solving the nearest point problem over reduced convex hulls

Pattern Recognition
Geometric algorithms for parametric-margin ν-support vector machine

Neurocomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Building upon Gilbert's convergence proof of his algorithtm to solve the Minimum Norm Problem, we establish a framework where a much simplified version of his proof allows us to prove the convergence of two algorithms for solving the Nearest Point Problem for disjoint convex hulls, namely the GSK and the MDM algorithms, as well as the convergence of the SMO algorithm for SVMs over linearly separable two-class samples.