ECGR 4115 - Convex Optimization and AI Applications

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.

Credit Hours: (3)
Restriction(s): Junior standing or above, or permission of instructor
Prerequisite(s): ECGR 2103 or ECGR 2105 or ITSC 1212, and MATH 2164, or equivalent courses
Cross-listed Course(s): ECGR 5115

Schedule of Classes