Convex Optimization: Exercises

This lecture covers exercises related to convex optimization, including topics such as SOCP dual via conic duality, KKT conditions for sums of logarithms, equality constrained least squares, and suboptimality of a simple covering ellipsoid. The exercises involve deriving dual problems, determining convexity, stating KKT conditions, and finding optimal solutions.