I have a toy question on SVM , where i have to find the weight $w$ by solving the Lagrangian multiplier method by hand . I know Lagrangain with equalities only . Here I have to deal with inequalities and I dont know how to proceed .
We have to minimize $$Q(\alpha)=\alpha_1+\alpha_2+\alpha_3+\alpha_4-\frac{1}{2}(\alpha_2^2-4\alpha_2\alpha_3+4\alpha_3^2+4\alpha_4^2)$$
subjected to $$\alpha_1+\alpha_2-\alpha_3-\alpha_4 = 0 $$ and $$\alpha_i\ge0,\ \ \ \ \ i=1,2,3,4$$ .
I believe this problem is unbounded. Let $\alpha_2=\alpha_3=0$. Then, your objective function reduces to:
$$ \alpha_1+\alpha_4−2\alpha_4^2 $$
and your constraint reduces to
$$ \alpha_1-\alpha_4 = 0. $$
Note, since $\alpha_2=\alpha_3=0$ we also have $\alpha_2\geq 0$ and $\alpha_3\geq 0$. Now, set $\alpha_1=\alpha_4$ and let both go to infinity. We remain feasible $\alpha_1-\alpha_4=0$ and $\alpha_1\geq 0$ and $\alpha_4\geq 0$. However, the objective function goes to $-\infty$ since $-2\alpha_4^2$ grows to $-\infty$ much faster than $\alpha_1+\alpha_4$ grows to $\infty$.