Polynomial-time decomposition algorithms for support vector machines

DOI10.1023/A:1021877911972zbMath1056.68118OpenAlexW1556115774MaRDI QIDQ1397416

Don Hush, Clint Scovel

Publication date: 6 August 2003

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021877911972

zbMATH Keywords

decomposition algorithmssupport vector machinespolynomial-time algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (10)

Binary separation and training support vector machines ⋮ On the complexity of working set selection ⋮ Linear convergence rate for the MDM algorithm for the nearest point problem ⋮ Radial kernels and their reproducing kernel Hilbert spaces ⋮ A simple decomposition algorithm for support vector machines with polynomial-time convergence ⋮ The 2-coordinate descent method for solving double-sided simplex constrained minimization problems ⋮ Provably fast training algorithms for support vector machines ⋮ A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training ⋮ Choosing the kernel parameters for support vector machines by the inter-cluster distance in the feature space ⋮ Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization

Uses Software

• SVMlight

This page was built for publication: Polynomial-time decomposition algorithms for support vector machines