EE392o: Optimization Projects

Stanford University, Autumn Quarter 2003-2004

Professor Stephen Boyd and Professor Z.-Q. Luo

In 2006-07, EE392 was turned into a permanent course, EE364b: Convex Optimization II.

Lecture topics and notes

top of EE392o page

Project topics

top of EE392o page

Project presentation schedule (Tentative)

Dec. 4th, Thursday:

Dec. 11th, Thursday, Session 1 (Packard 277):

Dec. 11th, Thursday, Session 2 (Packard 277):

Dec. 12th, Friday, Session 1 (Packard 277) :

Dec. 11th, Friday, Session 2 (Packard 277):

top of EE392o page

Basic course information

Course description: EE392o is a new advanced project-based course that follows EE364. Some lectures will be on topics not covered in EE364, including subgradient methods, decomposition and decentralized convex optimization, exploiting problem structure in implementation, global optimization via branch & bound, and convex-optimization based relaxations. Other lectures will cover applications in areas such as control, circuit design, signal processing, and communications in more depth. The main course requirement is a substantial project, carried out in small groups.

Credit: 3 units.

Lectures: Tuesdays and Thursdays, 1:15-2:30, location 380-380D.


Administrative assistant: Denise Murphy, Packard 267, 723-4731, Fax 723-8473,

Teaching Assistants:

TA office hours & location: Monday 4pm to 6pm and Friday 5pm to 6pm in Packard 242

Textbook: Convex Optimization, S. Boyd and L. Vandenberghe, Cambridge University Press 2003.

Course requirements: There will be no homework or exams; the only formal requirement is a substantial class project. Class attendance (within reason) is also required.

Prerequisite: EE364 or consent of instructor.