MWF 9:30am - 10:20am
IND E 515 A, MATH 515 A, AMATH 515 B
Maximization and minimization of functions of finitely many variables subject to constraints. Basic problem types and examples of applications; linear, convex, smooth, and nonsmooth programming. Optimality conditions. Saddlepoints and dual problems. Penalties, decomposition. Overview of computational approaches. Prerequisite: linear algebra and advanced calculus. Offered: jointly with IND E 515/MATH 515.
January 10, 2018 - 9:20pm