Convex Optimization When to Use Use this skill when working on convex-optimization problems in optimization. Decision Tree 1. Verify Convexity - Objective function: Hessian positive semidefinite? - Constraint set: intersection of convex sets? - 2. Problem Classification | Type | Solver | |------|--------| | Linear Programming | | | Quadratic Programming | | | General Convex | Interior point methods | | Semidefinite | CVXPY with SDP solver | 3. Standard Form - minimize f(x) subject to g i(x) <= 0, h j(x) = 0 - Convert max to min by negating - Convert = to <= by negating 4. KKT Conditions (Nece…