skip to main content

Course Websites

IE 521 - Convex Optimization

Fall 2020

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

Documents

TitleSectionCRNTypeHoursTimesDaysLocationInstructor
Convex Optimization060067LCD1300 - 1420 M W