University of Calgary
MATH 661.01 - Convex Optimization - Winter 2017
The Convex Optimization: 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.SyllabusThis course will be offered next in Fall 2019.
This course may not be repeated for credit.
Hours
- H(3-0)
Notes
- Mathematics 603 is recommended as preparation for Mathematics 661.01.
Prerequisite(s)
- Consent of the Department.
Sections
LEC 1 MWF 12:00 - 12:50 Yuriy Zinchenko Outline
Powered by UNITIS. More features.