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?
Spring 2016 Johannes Royset 6.0 / 7 6.0 / 7
Spring 2015 Laurent El Ghaoui 5.7 / 7 6.3 / 7
Spring 2013 Suvrit Sra 5.6 / 7 6.0 / 7
Spring 2012 Laurent El Ghaoui 4.8 / 7 5.5 / 7
Fall 2010 Laurent El Ghaoui 5.5 / 7 6.2 / 7
Fall 2009 Martin J. Wainwright 6.3 / 7 6.1 / 7
Fall 2008 Laurent El Ghaoui 6.0 / 7 6.2 / 7
Fall 2008 Laurent El Ghaoui 6.0 / 7 6.2 / 7
Fall 2007 Laurent El Ghaoui 4.7 / 7 5.5 / 7
Fall 2006 Laurent El Ghaoui 5.7 / 7 6.0 / 7
Fall 2005 Laurent El Ghaoui 5.2 / 7 5.8 / 7
Fall 2004 Martin J. Wainwright 6.2 / 7 6.0 / 7
Spring 2003 Laurent El Ghaoui 5.8 / 7 6.2 / 7
Fall 2001 Laurent El Ghaoui 5.5 / 7 5.6 / 7
Fall 2000 Laurent El Ghaoui 5.6 / 7 6.0 / 7
Fall 1998 Elijah Polak 5.3 / 7 5.4 / 7
Spring 1995 Elijah Polak 4.0 / 7 3.8 / 7
Spring 1994 Elijah Polak 5.0 / 7 6.0 / 7
Spring 1993 Elijah Polak 5.0 / 7 5.1 / 7
Spring 1993 Wei Ren 3.5 / 7 4.8 / 7
Spring 1992 Sheikholeslam 6.0 / 7 5.4 / 7
Spring 1991 Elijah Polak 5.9 / 7 6.1 / 7
Spring 1990 Elijah Polak 5.0 / 7 5.8 / 7
Overall Rating Teaching Effectiveness How worthwhile was this course?
5.4 / 7 5.7 / 7
[Email HKN about this data] [Info about this page]