The university continues to monitor the circumstances related to the pandemic. As such, course delivery methods and locations for the Spring 2021 semester will be finalized and published in the Schedule of Classes by December 4, 2020.
Hide Advanced Options
Courses - Fall 2020
ENEE
Electrical & Computer Engineering Department Site
ENEE662
Convex Optimization
Credits: 3
Grad Meth: Reg, Aud
Recommended: MATH410.
Credit only granted for: ENEE759F or ENEE662.
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.