2022 Fall
ELENG 227BT 001 - LEC 001
Convex Optimization
Somayeh Sojoudi
Class #:27822
Units:4
Instruction Mode:
In-Person Instruction
Offered through
Electrical Engineering and Computer Sciences
Current Enrollment
Total Open Seats:
18
Enrolled: 42
Waitlisted: 0
Capacity: 60
Waitlist Max: 20
Open Reserved Seats:
17 unreserved seats
1 reserved for Electrical Engineering and Computer Sciences - Master of Engineering Students
Hours & Workload
3 hours of instructor presentation of course materials, 8 hours of outside work hours, and 1 hours of the exchange of opinions or questions on course material.
Other classes by Somayeh Sojoudi
Course Catalog Description
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.
Rules & Requirements
Repeat Rules
Course is not repeatable for credit.
Reserved Seats
Current Enrollment
Open Reserved Seats:
17 unreserved seats
1 reserved for Electrical Engineering and Computer Sciences - Master of Engineering Students
Textbooks & Materials
See class syllabus or https://calstudentstore.berkeley.edu/textbooks for the most current information.
Guide to Open, Free, & Affordable Course Materials