![]() |
#1
|
|||
|
|||
![]()
From that well known source, wikipedia:
Quadratic programming (QP) is a special type of mathematical optimization problem. It is the problem of optimizing (minimizing or maximizing) a quadratic function of several variables subject to linear constraints on these variables. The hard-margin SVM problem is to minimize 0.5w'w subject to (yn(w'xn + b) >= 1. So is this a quadratic programming problem? |
Thread Tools | |
Display Modes | |
|
|