This algorithm is proved to converge (i.e., there are no more updates) in the separable case (Collins, 2002a).
1 if there exist weight vector U (with ||U || = 1), δ (> 0), and R (> 0) that satisfy: the number of updates is at most R 2 /δ 2 .