ECGR 5115

Convex Optimization and AI Applications

3credits
About this course

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, we�will discuss non-convex optimization problems.�Throughout this course, we will discuss applications of the materials to engineering topics (as time�permits) such as signal processing, control, robotics, machine learning, statistics, and related engineering�problems.�Credit will not be given for ECGR 5115 where credit has been given for ECGR 4115.

All available terms

4 terms

Avg. GPA
3.79
Grades
32

Other grades

W12.5%
More course details

University of North Carolina, Charlotte

ECGR 5115 at UNC Charlotte: average GPA 3.79 across 32 students. Grade distribution by term. This course focuses on the theory and the algorithmic aspects of…

Average GPA: 3.79

Grade distribution records: 32 students across 4 terms.

Grade distribution

GradeStudentsPercent
A2371.9%
B412.5%
C13.1%
W412.5%

Based on 32 student grade records across 4 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