This course covers fundamental theory, algorithms, and applications for convex and nonconvex optimization, including: 1) Theory: convex sets, convex functions, optimization problems and optimality conditions, convex optimization problems, geometric programming, duality, Lagrange multiplier theory; 2) Algorithms: disciplined convex programming, numerical linear algebra, unconstrained minimization, minimization over a convex set, equality constrained minimization, inequality constrained minimization; 3) Applications: approximation (regression), statistical estimation, geometric problems, classification, etc.
Unlock more information by signing in with your HKUST account.