47-851 Modern Convex Optimization

6 units, Carnegie Mellon University

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.

Prerequisites: none listed

Offered: Fall 2026, Fall 2025

Courseweave needs JavaScript to show sections, workloads and planning tools.