Numerical Optimization

3 credits

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. Offered: jointly with AMATH 516.