Working Set Selection Using Second Order Information for Training Support Vector Machines
The Journal of Machine Learning Research
QP Algorithms with Guaranteed Accuracy and Run Time for Support Vector Machines
The Journal of Machine Learning Research
Parallel Software for Training Large Scale Support Vector Machines on Multiprocessor Systems
The Journal of Machine Learning Research
General Polynomial Time Decomposition Algorithms
The Journal of Machine Learning Research
On the complexity of working set selection
Theoretical Computer Science
Semismooth Newton support vector machine
Pattern Recognition Letters
A convergent decomposition algorithm for support vector machines
Computational Optimization and Applications
A support vector machine with integer parameters
Neurocomputing
Quadratic programming formulations for classificationand regression
Optimization Methods & Software - THE JOINT EUROPT-OMS CONFERENCE ON OPTIMIZATION, 4-7 JULY, 2007, PRAGUE, CZECH REPUBLIC, PART II
A convergent hybrid decomposition algorithm model for SVM training
IEEE Transactions on Neural Networks
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
The multiple pairs SMO: a modified SMO algorithm for the acceleration of the SVM training
IJCNN'09 Proceedings of the 2009 international joint conference on Neural Networks
An effective method of pruning support vector machine classifiers
IEEE Transactions on Neural Networks
Computational Optimization and Applications
Convergence of a new decomposition algorithm for support vector machines
ICIC'06 Proceedings of the 2006 international conference on Intelligent computing: Part II
The Journal of Machine Learning Research
Training support vector machines via SMO-type decomposition methods
ALT'05 Proceedings of the 16th international conference on Algorithmic Learning Theory
General polynomial time decomposition algorithms
COLT'05 Proceedings of the 18th annual conference on Learning Theory
Nonparallel hyperplane support vector machine for binary classification problems
Information Sciences: an International Journal
| Hi-index | 0.00 |
The asymptotic convergence of C.-J. Lin (2001) can be applied to a modified SMO (sequential minimal optimization) algorithm by S.S. Keerthi et al. (2001) with some assumptions. The author shows that for this algorithm those assumptions are not necessary