EC ENGR 236B: Convex Optimization
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.
4 units, lecture, discussion
Loading...
| LIEVEN VANDENBERGHE | Winter 2026 | 46 | 76.1% (35) |
|---|
A-range % and grade counts cover only each instructor’s latest recorded term, shown in the "Latest Data From" column, combining all sections for the course. A-range % is the share of recorded letter grades (A+ through F) that are A+, A, or A−. Parentheses show the A-range count over the total letter-grade count. P/NP and incompletes are excluded. Records may be incomplete.
- Available Academic Terms
- Winter 2022 · Winter 2023 · Winter 2024 · Winter 2025 · Winter 2026