Course Websites

IE 521 - Convex Optimization

Last offered Fall 2024

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: 4 graduate hours. No professional credit. Prerequisite: ECE 490 or IE 411; MATH 416; MATH 444.

Related Faculty

Convex OptimizationA60067LCD41300 - 1420 M W  214 Ceramics Building Roy Dong