We are given the following unconstrained optimization problem:
x∗=argminxf(x)where f:Rn→R is a differentiable objective function, and x∈Rn is the vector of decision variables.
The first-order necessary conditions for optimality are given by:
∇f(x∗)=0where ∇f(x) denotes the gradient of f(x).