I was reading this paper related to Multiclass Classication withMulti-Prototype Support Vector Machines - paperHowever, I am having difficulty in understanding why they have mentioned the following problem non convex.I am really struggling figuring out the convexity/concavity of the functions. Can anyone just skim through the paper to help me out. The paper is about SVM (multi class classification) where each class can have multiple weight vectors/prototypes.
Confusion related to convexity of a problem
machine learning;support vector machines
Sounds too simple so maybe I've misunderstood you, but they have binary variables, hence obviously a nonconvex problem (a binary variable is either 0 or 1, which is a nonconvex set)