Revision as of 10:25, 15 August 2014 edit Qwertyus (talk \| contribs) Extended confirmed users 31,640 edits see also kernel perceptron ← Previous edit		Revision as of 07:33, 6 October 2015 edit undo Tcmandan (talk \| contribs) 15 edits m →Algorithm: stressed on importance of heuristics Next edit →
Line 51: # Repeat steps 1 and 2 until convergence. 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. This is critical for large data sets since there are n(n − 1) possible choices for <math>\alpha_i</math> and <math>\alpha_j</math>. == See also ==

Sequential minimal optimization: Difference between revisions