Operations Research.
convex function over a convex feasible set. A standard optimization problem is a convex optimization iff - The objective function is convex. - The inequality constraint functions are convex. - The equality constraint functions are affine. Standard Optimization Problem (cited from [1]) Any local