ECGR 4115

Convex Optimization and AI Applications

3credits
About this course

Focuses on the theory and the algorithmic aspects of convex optimization. Topics include: convex sets, convex functions, and convex optimization problems; duality theory and optimality conditions; algorithms for solving convex problems; use of numerical tools to solve problems; and, if time permits, non-convex optimization problems.� Also� discussed are applications of the materials to engineering topics such as signal processing, control, robotics, machine learning, statistics, and related engineering problems.

All available terms

5 terms

Avg. GPA
2.78
Grades
129

Other grades

W9.3%
More course details

University of North Carolina, Charlotte

ECGR 4115 at UNC Charlotte: average GPA 2.78 across 129 students. Grade distribution by term. Focuses on the theory and the algorithmic aspects of convex…

Average GPA: 2.78

Grade distribution records: 129 students across 5 terms.

Grade distribution

GradeStudentsPercent
A4131.8%
B3023.3%
C2821.7%
D129.3%
F53.9%
W129.3%

Based on 129 student grade records across 5 terms and 2 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