Orateur
Barton Zwiebach
Description
We define convex programs and describe the construction of dual programs. After explaining the key results of this theory (max-flow min-cut, strong duality, complementary slackness, etc) we apply the methods to find unknown genus one minimal area surfaces.
