NMK404: Unconstrained minimization

* Unconstrained minimization * Before tackling such a complicated problem, let us start with a simpler one. We will first look at how to solve an unconstrained optimization problem, more specifically, we will study unconstrained minimization.
* That is the problem of finding which input makes a function return its minimum.
(Note: in the SVM case, we wish to minimize the function computing the norm of w, we could call it f and write it f(w)=∥w∥).