IE 521 - Convex Optimization

Semesters Offered

TitleRubricSectionCRNTypeHoursTimesDaysLocationInstructor
Convex OptimizationIE521N60406LCD1300 - 1420 M W  136 Loomis Laboratory Niao He

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.