University of Calgary

MATH 661.01 - Convex Optimization - Fall 2019

An introduction to modern convex optimization, including basics of convex analysis and duality, linear conic programming, robust optimization, and applications.
This course may not be repeated for credit.

Hours

  • H(3-0)

Prerequisite(s)

  • Admission to a graduate program in Mathematics and Statistics or consent of the Department.

Sections

Powered by UNITIS. More features.