typo week48

2020-11-26 11:35:25 +01:00
parent 2e3bb0d244
commit f3be9b9268
7 changed files with 6 additions and 6 deletions
@@ -575,7 +575,7 @@ We have the general problem

 o With a given kernel we can thus define the matrix $\bm{P}$.
 o The matrix $\bm{P}$ has matrix elements $p_{ij}=y_iy_jK(\bm{x}_i,\bm{x}_j)$. Given a kernel $K$ and the targets $y_i$ this matrix is easy to set up.
-o The vector $\bm{q}$ is zero.
+o The vector $\bm{q}$ has all elements equal 1.
 o The constraint $\bm{y}^T\bm{\lambda}=0$ leads to $f=0$ and $\bm{A}=\bm{y}$.
 o To set up the matrix $\bm{G}$ we note that the inequalities $0\leq \lambda_i \leq C$ can be split up into $0\leq \lambda_i$ and $\lambda_i \leq C$. These two inequalities define then the matrix $\bm{G}$ and the vector $\bm{h}$.