Machine Learning, Cost Function, Convex Optimization.
find an optimal point( a point for which the derivate of our function vanishes ) we are 100% sure that this point is the “global optimum” in other words the best point and for which our objective function achieves its minimum: ∇f(X*) = 0 ⇔ X* is the global and unique optimal point III) Convex