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? |
|---|---|---|---|
| Fall 2015 | Laurent El Ghaoui | ||
| Fall 2014 | Laurent El Ghaoui | ||
| Spring 2007 | Laurent El Ghaoui | ||
| Spring 2004 | Elijah Polak | ||
| Fall 1991 | Elijah Polak | ||
| Fall 1989 | Elijah Polak | ||
| Overall Rating | Teaching Effectiveness | How worthwhile was this course? | |