Ai
Created page with "== Introduction == Convex optimization is a subfield of mathematical optimization that studies the problem of minimizing convex functions over convex sets. The convexity property can make optimization in some sense "easier" than the general case - for example, any local minimum must be a global minimum. Image:Detail-69203.jpg|thumb|center|A 3D plot demonstrating a convex optimization problem, with a convex set and a convex function.|clas..."
