EE 194-16 Convex Optimization

This course focuses on convex optimization theory and algorithms. Topics include convex sets, convex functions and convex optimization problems; duality theory and optimality conditions; algorithms for solving convex problems including descend, Newton and interior point methods. Examples of application are taken from communications, signal processing and other fields. Students will do a project as part of the course credit.

Prerequisites: None.

Back to Courses