Revision as of 13:57, 11 March 2014 edit Qwertyus (talk \| contribs) Extended confirmed users 31,640 edits more specifically, it's a QP problem ← Previous edit		Revision as of 15:02, 13 June 2014 edit undo Koertefa (talk \| contribs) Extended confirmed users 5,248 edits →Online version: this is not significant enough to be mentioned here, looks like WP:SPAM Next edit →
Line 52: When all the Lagrange multipliers satisfy the KKT conditions (within a user-defined tolerance), the problem has been solved. Although this algorithm is guaranteed to converge, heuristics are used to choose the pair of multipliers so as to accelerate the rate of convergence. ~~==Online version==~~ An [[online machine learning\|online]] approximation to SMO is described by Bordes ''et al.''<ref>{{cite journal \|author1=Antoine Bordes \|author2=Seyda Ertekin \|author3=Jason Weston \|author4=Leon Bottou \|title=Fast Kernel Classifiers with Online and Active Learning \|journal=[[Journal of Machine Learning Research\|JMLR]] \|volume=6 \|pages=1579–1619 \|year=2005}}</ref> == References ==

Sequential minimal optimization: Difference between revisions