Optimization@MIT

Mathematics 116 -- Convexity and Optimization with Applications
Course Description: Introduction to real and functional analysis through topics such as convex programming, duality theory, linear and non-linear programming, calculus of variations, and the maximum principle of optimal control theory.

Instructor: Paul G. Bamberg
Prerequisites: At least one course beyond Mathematics 21.

Back to Classes

Suggestions, feedback? Please send your thoughts to optimization-www@mit.edu.