Electrical Engineering 227B

Title	Convex Optimization and Approximation
Units	3
Prerequisites	227A or consent of instructor.
Description	Convex optimization as a systematic approximation tool for hard decision problems. Approximations of combinatorial optimization problems, of stochastic programming problems, of robust optimization problems (i.e., with optimization problems with unknown but bounded data), of optimal control problems. Quality estimates of the resulting approximation. Applications in robust engineering design, statistics, control, finance, data mining, operations research.

Sections	Instructor	Teaching Effectiveness			How worthwhile was this course?
Spring 2007	Laurent El Ghaoui	5.1	/ 7 ± 1.1		5.1	/ 7 ± 1.0
Spring 2004	Polak	6.3	/ 7 ± 0.6		5.6	/ 7 ± 0.6
Fall 1991	Polak	5.2	/ 7 ± 0.4		6.0	/ 7 ± 0.6
Fall 1989	Polak	4.4	/ 7 ± 0.9		5.1	/ 7 ± 1.1
Overall Rating		Teaching Effectiveness			How worthwhile was this course?
Electrical Engineering 227B		5.5	/ 7 ± 0.3		5.4	/ 7 ± 0.2

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