Convex Optimization: Elementary Results

This lecture covers the elementary results in convex optimization, focusing on affine, convex, and conic hulls. It explains the definitions of these sets, their combinations, and transformations that preserve convexity. The lecture also delves into proper cones, conic inequalities, convex functions, and their conditions, providing examples and insights into convexity-preserving operations.