Groups
Category
A convex optimization problem minimizes a convex function over a convex set, guaranteeing that every local minimum is a global minimum.
The Hessian matrix collects all second-order partial derivatives of a scalar function and measures local curvature.