Course Websites
IE 521 - Convex Optimization
Last offered Fall 2026
Official Description
Finite dimensional convex optimization problems; characterization of optimal solutions; iterative algorithms for differentiable and nondifferentiable problems; distributed optimization algorithms; robust problems and solutions; applications of convex optimization models. Course Information: Prerequisite: ECE 490 or IE 411; MATH 416; MATH 444.