dibs

EC ENGR 236B: Convex Optimization

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.

4 units, graduate

Offered Winter quarters

Predicted GPA
3.71
A or A minus
79%
D, F or withdrew
1%
Lec 1
Tue/Thu 6:00-7:50 PM
Boelter Hall 2760
Vandenberghe, L.
Dis 1A
Fri 3:00-3:50 PM
Online - Asynchronous
By instructor
Winter 2022 to Winter 2025
All instructors
3.71 GPA
79% A
1% DFW
201 grades
VANDENBERGHE
3.71 GPA
79% A
1% DFW
201 grades
Prerequisites
Requisite: course 236A.
Restrictions
Graduate Students
Grading
Letter only
Final exam
Tue Mar 16, 6:30 PM

What past students say about VANDENBERGHE in this class

Read from 2 reviews of VANDENBERGHE

Recommend
1 recommends it
Teaching
2 say clear
Exams
1 says moderate

Each figure counts the reviews that say so. Most reviews skip most topics.