Continuous Optimization

3 Credits

Theoretical principles underlying continuous (nonlinear) optimization problems and the numerical methods that are available to solve them. Topics include the steepest descent method, Newton's method for unconstrained optimization, necessary and sufficient optimality conditions, duality, line search and trust region methods for unconstrained optimization, derivative-free and quasi-Newton techniques, and other numerical methods relevant for solving continuous optimization problems.