View Single Post
  #3  
Old 05-22-2013, 07:34 AM
alasdairj alasdairj is offline
Member
 
Join Date: Mar 2013
Posts: 12
Default Re: Q1 Quadratic Programming

Well, the problem was to minimize wrt w and b the value w'w (which is a combination of 2 values of our variable) subject to yn(w'xn + b) >= 1 where yn and xn are constants (our training data) i.e. a linear combination of our variable w.

So, the original problem for hard-margin SVM seems like a "quadratic programming" problem - so my real question is this: why do we do the "dual" mapping to get the problem stated in terms of alpha? Is this purely to get it into a more convenient form for QP packages? I am missing something, but I don't know what :-).
Reply With Quote