COMP 5700
Introduction to Convex Optimization
Linear, nonlinear and convex problems. Convex 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.
Sources
- Course catalogue ↗2026–2027