IE 521
Fall 2023 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.
4 graduate hours. No professional credit. Prerequisite: ECE 490 or IE 411; MATH 416; MATH 444.
Section Status updates every 10 minutes.
| CRN | Type | Section | Time | Day | Location | Instructor | Section Details | |
|---|---|---|---|---|---|---|---|---|
|
60067
|
Lecture-Discussion
|
A
|
1:00PM
-2:20PM
|
MW
|
218 Ceramics Building
|
Dong, R
|
|