Machine Learning 38: Support Vector Machines - Dual Problem

We use techniques from convex optimization to derive a dual formulation of finding the maximum margin separating hyperplane. This involves using the Karush-Kuhn-Tucker conditions to rewrite the original support vector machines optimization problem.