<P> The algorithm proceeds as follows: </P> <Ol> <Li> Find a Lagrange multiplier α 1 (\ displaystyle \ alpha _ (1)) that violates the Karush--Kuhn--Tucker (KKT) conditions for the optimization problem . </Li> <Li> Pick a second multiplier α 2 (\ displaystyle \ alpha _ (2)) and optimize the pair (α 1, α 2) (\ displaystyle (\ alpha _ (1), \ alpha _ (2))). </Li> <Li> Repeat steps 1 and 2 until convergence . </Li> </Ol> <Li> Find a Lagrange multiplier α 1 (\ displaystyle \ alpha _ (1)) that violates the Karush--Kuhn--Tucker (KKT) conditions for the optimization problem . </Li> <Li> Pick a second multiplier α 2 (\ displaystyle \ alpha _ (2)) and optimize the pair (α 1, α 2) (\ displaystyle (\ alpha _ (1), \ alpha _ (2))). </Li>

Sequential minimal optimization a fast algorithm for training support vector machines