Explore the background on convex sets and functions, linear programming, convex programming, and iterative first-order and second-order methods. Three lecture hours a week for one semester. Computer Science 388J and 395T (Topic: Optimization) may not both be counted. Prerequisite: Graduate standing.