Course Offered:
Spring
Course Description
Methods of solving optimization problems in finitely many variables, with or without constraints. Steepest descent, quasi-Newton methods. Quadratic programming and complementarity. Exact penalty methods, multiplier methods. Sequential quadratic programming. Cutting planes and nonsmooth optimization. Prerequisite: AMATH 515. Offered: jointly with MATH 516.