Groups
Category
A set is convex if every line segment between any two of its points lies entirely inside the set.
Convex optimization studies minimizing convex functions over convex sets, where every local minimum is guaranteed to be a global minimum.