Convex Optimization - Convex Optimization Problem

Convex Optimization Problem

An optimization problem (also referred to as a mathematical programming problem or minimization problem) of finding some such that

where is the feasible set and is the objective, is called convex if is a closed convex set and is convex on . Alternatively, an optimization problem on the form

\begin{align}
&\operatorname{minimize}& & f(x) \\
&\operatorname{subject\;to}
& &g_i(x) \leq 0, \quad i = 1,\dots,m
\end{align}

is called convex if the functions are convex.

Read more about this topic:  Convex Optimization

Famous quotes containing the word problem:

    A serious problem in America is the gap between academe and the mass media, which is our culture. Professors of humanities, with all their leftist fantasies, have little direct knowledge of American life and no impact whatever on public policy.
    Camille Paglia (b. 1947)