Machine Learning, Svm, Convex Optimization, Lagrange Multiplier.
get the widest street. Since our objective is convex, we can use Lagrange Duality to get our solution. In this constrained optimization, suppose we have a following form of the primal equation. We then use Lagrangian multipliers so solve for the parameters. The generalized lagrangian is given by