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. Only one of the following may be counted: Artificial Intelligence 388J, Computer Science 388J, 395T (Topic: Optimization). Prerequisite: Graduate standing.