Conditional Remix & Share Permitted
CC BY-NC-SA
This course will focus on fundamental subjects in convexity, duality, and convex optimization algorithms. The aim is to develop the core analytical and algorithmic issues of continuous optimization, duality, and saddle point theory using a handful of unifying principles that can be easily visualized and readily understood.
- Subject:
- Applied Science
- Computer Science
- Engineering
- Mathematics
- Material Type:
- Full Course
- Provider:
- MIT
- Provider Set:
- MIT OpenCourseWare
- Author:
- Bertsekas, Dimitri
- Date Added:
- 02/01/2012