ENEE 662

Convex Optimization

3credits
About this course

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.

All available terms

11 terms

Avg. GPA
3.39
Grades
316

Other grades

W7.0%
More course details

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 distribution

GradeStudentsPercent
A+216.6%
A5617.7%
A-6319.9%
B+4213.3%
B4514.2%
B-196.0%
C+51.6%
C72.2%
D+20.6%
D30.9%
F20.6%
W227.0%

Based on 316 student grade records across 11 terms and 5 professors.

Instructors

Related courses

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