Modern Convex Optimization
Course Number: 47851
This course will cover the main foundations of convex optimization. The goal is to develop solid command of the foundational blocks of this discipline at the highest possible level. The course topics will include a thorough treatment of duality, optimality conditions, conic optimization, and general algorithmic templates for first-order, second- and higher-order algorithms.
Concentration: Operations Research
Academic Year: 2022-2023
Semester(s): Mini 4