IE 521 N - Convex Optimization

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 415; MATH 444.

Option 1

Number of Required Visit(s): 0

Course Level: Graduate

Credit: 4

Term(s): Spring