Convex Optimization and Applications

4 credits

This course covers some convex optimization theory and algorithms. It will mainly focus on recognizing and formulating convex problems, duality, and applications in a variety of fields (system design, pattern recognition, combinatorial optimization, financial engineering, etc.). Prerequisites: ECE 269 with a grade of B– or above; graduate standing.