After the fields already visited—linear and quadratic programming—the optimization theory is expanding to other scenarios taking advantage of convexity benefits. This chapter introduces concepts around convexity and then Cone Programming, Semidefinite Programming, and disciplined Convex Programming. Some important traits of the chapter are second-order cone programming (SOCP), copositive programming, cutting plane in general contexts, and the ellipsoid method.