DSC 388J
Optimization
Explore a background on convex sets and functions, linear programming, convex programming, and iterative first-order and second-order methods. Data Science 388J and 395T (Topic: Optimization) may not both be counted. The equivalent of three lecture hours a week for one semester.
Prerequisites & course information
Explore a background on convex sets and functions, linear programming, convex programming, and iterative first-order and second-order methods. Data Science 388J and 395T (Topic: Optimization) may not both be counted. The equivalent of three lecture hours a week for one semester.
Sources
- Course catalogue ↗2026-2027