This is an introductory-level course on optimization. Topics include convex sets and functions, optimization problems, convex problems, duality, numerical linear algebra, gradient methods, Newton's methods, conjugate gradient method, gradient projection method, block coordinate descent method, penalty methods, interior-point methods, software, and applications. Students learn to analyze and solve optimization problems theoretically and numerically using appropriate methods.
Unlock more information by signing in with your HKUST account.