Convexity and Well-Posed Problems

We shall consider convex functions from the most modern point of view: a function is de?ned to be convex whenever its epigraph, the set of the points lying above the graph, is a convex set. Except for trivial cases, the minimum value must be taken at a point where the function is not +?, hence at a point in the constraint set.