Polynomial-time decomposition algorithms for support vector machines
From MaRDI portal
Publication:1397416
DOI10.1023/A:1021877911972zbMath1056.68118MaRDI QIDQ1397416
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
68T05: Learning and adaptive systems in artificial intelligence
Related Items
The 2-coordinate descent method for solving double-sided simplex constrained minimization problems, Radial kernels and their reproducing kernel Hilbert spaces, A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training, A simple decomposition algorithm for support vector machines with polynomial-time convergence, Provably fast training algorithms for support vector machines, 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, Linear convergence rate for the MDM algorithm for the nearest point problem, On the complexity of working set selection, Binary separation and training support vector machines
Uses Software