EC ENGR 236B
Convex Optimization
Description: Lecture, four hours; discussion, one hour; outside study, seven hours. Requisite: course 236A. Introduction to convex optimization and its applications. Convex sets, functions, and basics of convex analysis. Convex optimization problems (linear and quadratic programming, second-order cone and semidefinite programming, geometric programming). Lagrange duality and optimality conditions. Applications of convex optimization. Unconstrained minimization methods. Interior-point and cutting-plane algorithms. Introduction to nonlinear programming. Letter grading.
Units: 4.0
Units: 4.0
1 of 1
Most Helpful Review
Winter 2023 - - Very good class - 8-9 homeworks that take 25-40 hours each depending on how smart you are - difficult material - disgustingly hard final that everyone thinks they failed on, only to end up with an B to an A in the class - if you put genuine effort into the homeworks and at least try to write something for each question on the final you'll get at least a B in the class - lecturer speaks quietly and monotonously but the explanations make a lot of sense if you can pay attention
Winter 2023 - - Very good class - 8-9 homeworks that take 25-40 hours each depending on how smart you are - difficult material - disgustingly hard final that everyone thinks they failed on, only to end up with an B to an A in the class - if you put genuine effort into the homeworks and at least try to write something for each question on the final you'll get at least a B in the class - lecturer speaks quietly and monotonously but the explanations make a lot of sense if you can pay attention
1 of 1
