IE 521 N - Convex Optimization
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 415; MATH 444.
Option 1Number of Required Visit(s): 0
Course Level: Graduate