Focuses on recognizing, solving, and analyzing convex optimization problems. Convex sets, convex functions, convex and quasi-convex optimization problems. Duality theory and optimality conditions. Specific classes of problems including linear optimization (LP), semi-definite optimization (SDP), geometric programming. Algorithms for unconstrained and constrained optimization; interior-point methods. Applications in controls, communications, signal processing, statistics, and other areas.
11 terms
Other grades
University of Maryland
ENEE 662 at UMD: average GPA 3.39 across 316 students. Grade distribution by term. Focuses on recognizing, solving, and analyzing convex optimization problems…
Average GPA: 3.39
Grade distribution records: 316 students across 11 terms.
| Grade | Students | Percent |
|---|---|---|
| A+ | 21 | 6.6% |
| A | 56 | 17.7% |
| A- | 63 | 19.9% |
| B+ | 42 | 13.3% |
| B | 45 | 14.2% |
| B- | 19 | 6.0% |
| C+ | 5 | 1.6% |
| C | 7 | 2.2% |
| D+ | 2 | 0.6% |
| D | 3 | 0.9% |
| F | 2 | 0.6% |
| W | 22 | 7.0% |
Based on 316 student grade records across 11 terms and 5 professors.
Related topic in ENEE
Also in ENEE
Also in ENEE
Also in ENEE
Also in ENEE
Also in ENEE
The course page is taking longer to load. This summary is still available.
We could not load the full course details. This summary is still available.
Still loading. This can take a moment on a slow connection.
Loading My Class Grades