IE 521
IE 521 - Convex Optimization
Fall 2024
| Title | Rubric | Section | CRN | Type | Hours | Times | Days | Location | Instructor |
|---|---|---|---|---|---|---|---|---|---|
| Convex Optimization | IE521 | A | 60067 | LCD | 4 | 1300 - 1420 | M W | 103 Transportation Building | Roy Dong Heling Zhang |
See full schedule from Course Explorer
Documents
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.