Convex Optimization credit:

4 Hours

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. Prerequisite: ECE 490 or IE 411 ; MATH 416 ; MATH 444 .