|
|
Mar 28, 2024
|
|
ORIE 6326 - [Convex Optimization] Spring. Next Offered: 2019-2020. 3 credits. Student option grading.
Staff.
Convex optimization generalizes least-squares, linear and quadratic programming, and semidefinite programming, and forms the basis of many methods for non-convex optimization. This course focuses on recognizing and solving convex optimization problems that arise in applications, and introduces a few algorithms for convex optimization. Topics include: Convex sets, functions, and optimization problems. Basics of convex analysis. Least-squares, linear and quadratic programs, semidefinite programming, minimax, extremal volume, and other problems. Optimality conditions, duality theory, theorems of alternative, and applications. Algorithms: interior-point, subgradient, proximal gradient, splitting methods such as ADMM. Applications to statistics and machine learning, signal processing, control and mechanical engineering, and finance.
Add to Favorites (opens a new window)
|
|
|