Real Convex Optimization Problems
Definition
Suppose $X \subset \R ^d$ and $f: \R ^d \to \R $. An optimization problem $(X, f)$ is convex (a convex optimization problem, convex program, ordinary convex program) if $X$ is a convex set and $f$ is a convex function.