2020 Fall

ELENG 227BT 001 - LEC 001

Convex Optimization

Laurent El Ghaoui, Somayeh Sojoudi

Aug 26, 2020 - Dec 11, 2020

Tu, Th

11:00 am - 12:29 pm

Internet/Online

Class #:27829

Units: 4

Instruction Mode: Remote Instruction
Time Conflict Enrollment Allowed

Offered through Electrical Engineering and Computer Sciences

Current Enrollment

Total Open Seats: 0

Enrolled:

Waitlisted:

Capacity:

Waitlist Max:

No Reserved Seats

Hours & Workload

3 hours of instructor presentation of course materials per week, 8 hours of outside work hours per week, and 1 hours of the exchange of opinions or questions on course material per week.

Other classes by Laurent El Ghaoui

UGIS 192D 010 010TUT

Other classes by Somayeh Sojoudi

+ 1 Independent Study

MECENG 299 040 040IND

Convex optimization is a class of nonlinear optimization problems where the objective to be minimized, and the constraints, are both convex. 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 experiments with the optimization software CVX, and a discussion section.

Class Notes

Synchronous.

MENG students are blocked from enrolling in this class because they will be enrolled by their advisor. Please contact your advisor for more information.