Document SVM Operation

[frobnitzem]

The SVM classifier uses a convex optimization strategy that doesn't match the original benchmark. Instead, it solves for the Bayesian maximum likelihood estimate of a linear classifier model as specified in Interior-point methods for large-scale cone programming (pdf), from the book Convex Optimization, Boyd and Vandenberghe. A Jeffrey's prior of |w| is added.

We need plots of iterations to convergence vs. N, M.