EC ENGR 236B
Nonlinear Programming
Description: (Formerly numbered Electrical Engineering 236B.) 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
Most Helpful Review
Vandenberghe is a co-author of the Nonlinear Programming book so he lectures pretty much straight off slides based off of the textbook. HWs were difficult and fairly time-consuming with both written and MATLAB questions, but if you read the material from the textbook, there are many similar examples that are helpful. The final exam is worth 75% of the overall grade but its difficulty is on par with the HWs. He's very helpful at his office hours, and also provides HW help during class. Goes fairly quickly in lecture over course material, but he does go through almost all the proofs/examples step-by-step. Overall a very good professor, I would definitely recommend him.
Vandenberghe is a co-author of the Nonlinear Programming book so he lectures pretty much straight off slides based off of the textbook. HWs were difficult and fairly time-consuming with both written and MATLAB questions, but if you read the material from the textbook, there are many similar examples that are helpful. The final exam is worth 75% of the overall grade but its difficulty is on par with the HWs. He's very helpful at his office hours, and also provides HW help during class. Goes fairly quickly in lecture over course material, but he does go through almost all the proofs/examples step-by-step. Overall a very good professor, I would definitely recommend him.