Electrical Engineering 227A

Title	Introduction to Convex Optimization
Units	3
Description	Convex optimization is a class of nonlinear optimization problems where the objective to be minimized, and the constraints, are both convex. Contrarily to the more classical linear programming framework, convex programs often go unrecognized, and this is a pity since a large class of convex optimization problems can now be efficiently solved. In addition, it is possible to address hard, nonconvex problems (such as "combinatorial optimization" problems) using convex approximations that are more efficient than classical linear ones. The 3-unit course covers some convex optimization theory and algorithms, and describes various applications arising in engineering design, modelling and estimation, finance, and operations resesrch.

Sections Instructor Teaching Effectiveness How worthwhile was this course?

Fall 2007 El Ghaoui 4.7 / 7 ± 0.4
5.5 / 7 ± 0.4

Fall 2006 El Ghaoui 5.7 / 7 ± 0.4
6.0 / 7 ± 0.3

Fall 2005 El Ghaoui 5.2 / 7 ± 0.6
5.8 / 7 ± 0.5

Fall 2004 Wainwright 6.2 / 7 ± 0.2
6.0 / 7 ± 0.3

Spring 2003 El Ghaoui 5.8 / 7 ± 1.2
6.2 / 7 ± 1.0

Fall 2001 El Ghaoui 5.5 / 7 ± 0.9
5.6 / 7 ± 0.9

Fall 2000 El Ghaoui 5.6 / 7 ± 0.4
6.0 / 7 ± 0.4

Fall 1998 Polak 5.3 / 7 ± 1.3
5.4 / 7 ± 1.9

Spring 1995 Polak 4.0 / 7 ± 1.8
3.8 / 7 ± 1.7

Spring 1994 Polak 5.0 / 7 ± 7.0
6.0 / 7 ± 0.0

Spring 1993 Section 1 Ren 3.5 / 7 ± 0.7
4.8 / 7 ± 0.5

Spring 1993 Section 2 Polak 5.0 / 7 ± 1.1
5.1 / 7 ± 0.6

Spring 1992 Sheikholeslam 6.0 / 7 ± 0.6
5.4 / 7 ± 0.7

Spring 1991 Polak 5.9 / 7 ± 1.0
6.1 / 7 ± 0.6

Spring 1990 Polak 5.0 / 7 ± 1.3
5.8 / 7 ± 1.5

Overall Rating Teaching Effectiveness How worthwhile was this course?

Electrical Engineering 227A 5.3 / 7 ± 0.0
5.7 / 7 ± 0.0

Hint: You can click on the colored rating bars to see detailed statistics on a particular rating.