My Question is although a straight forward one but I've searched through google, stackexhange,forums etc. but unable to find the answer. Almost everywhere it's been assumed that objective function of MMC is Convex or it says "Read these notes on Convex Optimization" but i'm unable to find the exact answer to my problem.
So here it is, How one can prove that Objective Function of Maximum Margin Classifier with constraint (as shown below in image) is Convex?. Do we also need to prove that constraint is convex too. If yes then How? Any thorough explanation will be highly appreciated.
Looking forward for your help.Thanks!
