EE364b: Course Information

Lectures & section

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

Project sessions: Thursdays 3:15–4:05 pm, Hewlett 102.

Course requirements and grading

Requirements:

• Attendance.

• Some homework assignments, assigned asynchronously, as we create new exercises. Homework is due on Friday by 5 pm in the inbox outside Denise’s office, Packard 267.

• 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%.

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.