After successful completion of the course, students are able to solve constrained and unconstrained optimisation problem numerically. We discuss several classes of minimisation problems, such as,
the minimisation of quadratic cost functionals.
Unconstrained optimization: gradient methods, classicalNewton method, quasiNewton method. Constrained optimization: trust region methods, linear programming, (sequential) quadratic programming
Blackboard presentation.
12.5. and 9.6 we stop the lecture 13:30
Oral exam.
Analysis and linear algebra