NONLINEAR OPTIMIZATION

Undergraduate

This course is a study of unconstrained optimization, optimality conditions (necessary, sufficient and Karush-Kuhn-Tucker), penalty functions, convex functions, and convex programming. PREREQUISITE: MATH 2910 and AMS 2940 Three lecture hours per week