EE364b: Course Information

Professor John Duchi (originally developed by Stephen Boyd), Stanford University


Lectures: Mondays and Wednesdays, 3:00pm–4:30pm, Herrin T175

Course requirements and grading


  • Attendance (since the class is not televised).

  • Weekly homework assignments.

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

Grading: Homework 30%, project/final 70%.



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 or final exam (chosen individually as desired).