EE364b: Course Information

Professor Stephen Boyd, Stanford University, Spring Quarter 2013–14

Lectures

Lectures: Tuesdays and Thursdays, 9:30–10:45 am, Gates B1.

Course requirements and grading

Requirements:

  • Attendance.

  • Some homework assignments, assigned asynchronously, as we create new exercises.

  • Either a project or a final exam. If you're registered Cr/NCr, you can just do the homework assignments.

  • Numbering of section 2 of the homework document has changed. Please refresh to make sure you are attempting the correct problem. Grading: Homework 30%, project/final 70%.

Prerequisites

EE364a.

Catalog description

3 units.

Continuation of 364a. Subgradient, cutting-plane, and ellipsoid methods. Decentralized convex optimization via primal and dual decomposition. Alternating projections. Exploiting problem structure in implementation. Convex relaxations of hard problems, and global optimization via branch & bound. Robust optimization. Selected applications in areas such as control, circuit design, signal processing, and communications. Course requirements include a project.