Algorithm 1. Pseudocode for training a support vector machine

Require:X and y loaded with training labeled data, $\alpha \leftarrow 0$ or α $\leftarrow$ partially trained SVM 1: C $\leftarrow$ some value (10 for example) 2: repeat 3:  for all $\left\{x_i{y}_i\right\}, \left\{x_i{y}_i\right\}$ do 4:   Optimize ${\propto }_i and {\propto }_j$ 5:  end for 6: until no changes in $\alpha$ or other resource constraint criteria met Ensure: Retain only the support vectors (${\propto }_i>0$)