IE 521
Summer 2026 All Classes
All Classes
Credit: 4 hours.
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. Prerequisite: ECE 490 or IE 411; MATH 416; MATH 444.
Section Status updates every 10 minutes.
| Status | CRN | Type | Section | Time | Day | Location | Instructor | Section Details |
|---|