2023 Fall
ELENG 227BT 201 - DIS 201
Convex Optimization
Somayeh Sojoudi
Class #:28253
Units: 4
Instruction Mode:
In-Person Instruction
Offered through
Electrical Engineering and Computer Sciences
Current Enrollment
Total Open Seats:
6
Enrolled: 19
Waitlisted: 0
Capacity: 25
Waitlist Max: 10
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 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
No Reserved Seats
Textbooks & Materials
See class syllabus or https://calstudentstore.berkeley.edu/textbooks for the most current information.
Guide to Open, Free, & Affordable Course Materials