convex optimization

An mathematical optimization problem is convex when the objective function to be minimized (and the constraint set in case of constrained problem) are convex. For maximization problem, the objective function and constraints are concave

The standard form of a constrained minimizing problem is an objective function is subject to multiple constraints

This convex optimization has a unique global extremum