What algorithm do SVMs use to minimize their objective function?
The SVM problem (and other related problems) can be described as a minimization \ maximization of a quadratic function.
This can be easily solved with the gradient descent algorithm, however I recommend using the SMO algorithm since it is a direct solution (to the dual of the SVM problem), and can be also used for kernelized SVMs