Groups
Category
A convex optimization problem minimizes a convex function over a convex set, guaranteeing that every local minimum is a global minimum.
Convex optimization studies minimizing convex functions over convex sets, where every local minimum is guaranteed to be a global minimum.