Applied Convex Optimization

Catalog description

Credits 3. 3 Lecture Hours. Introduction to convex optimization including convex set, convex functions, convex optimization problems, KKT conditions and duality, unconstrained optimization, and interior-point methods for constrained optimization; applications in information science, digital systems, networks and learning. Prerequisites: ECEN 601 or equivalent.