ELG 6108 Introduction to Convex Optimization

3 units
Electrical Engineering
Faculty of Engineering
Mathematics of optimization: linear, nonlinear and convex problems. Convex and affine sets. Convex, quasiconvex and log-convex functions. Operations preserving convexity. Recognizing and formulating convex optimization problems. The Lagrange function, optimality conditions, duality, geometric and saddle-point interpretations. Least-norm, regularized and robust approximations. Statistical estimation, detector design. Adaptive antennas. Geometric problems (networks). Algorithms.

Components:

Lecture

Previously Offered Terms:

Winter
Siarhei Loika

2 sections from Winter 2019 to Winter 2024

No grade data available for this course.