C S 388J
Optimization
Explore the background on convex sets and functions, linear programming, convex programming, and iterative first-order and second-order methods. Only one of the following may be counted: Artificial Intelligence 388J, Computer Science 388J, 395T (Topic: Optimization). Three lecture hours a week for one semester.
Prerequisites & course information
Explore the background on convex sets and functions, linear programming, convex programming, and iterative first-order and second-order methods. Only one of the following may be counted: Artificial Intelligence 388J, Computer Science 388J, 395T (Topic: Optimization). Three lecture hours a week for one semester.
Sources
- Course catalogue ↗2026-2027