Mathematical Optimization II

1 Unit · Graduate

Constrained and unconstrained nonlinear optimization: Optimality conditions; linesearch and trust-region methods; Newton and quasi-Newton methods; active-set methods; augmented Lagrangian, sequential quadratic programming and interior point methods; convergence theory for numerical algorithm.