Machine Learning, Svm, Convex Optimization, Lagrange Multiplier.
d1+d2. Now this is simply a projection so if we take the difference between H1 and H2 and multiple by a unit normal , we will get the width of the street using equation 6. This is now a convex objective with linear constraints which can be solved by quadratic programming (interior point/ gradient