| |
Sep 28, 2024
|
|
|
|
|
ECGR 5115 - Convex Optimization and AI Applications
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.
Credit Hours:
Prerequisite(s): MATH 2164, ECGR 2103, or equivalent courses.
Cross-listed Course(s): ECGR 4115
Schedule of Classes
Add to Catalog Bookmarks (opens a new window)
|
|
