Catalog Description: The course covers some convex optimization theory and algorithms, and describes various applications arising in engineering design, machine learning and statistics, finance, and operations research. The course includes laboratory assignments, which consist of hands-on experience.

Units: 4

Formats:
Fall: 3.0 hours of lecture, 1.0 hours of discussion, and 2.0 hours of laboratory per week
Spring: 3.0 hours of lecture, 1.0 hours of discussion, and 2.0 hours of laboratory per week

Grading basis: letter

Final exam status: No final exam

Also listed as: IND ENG C227A

---

Class homepage on inst.eecs