Continuous Optimization [C]: 2009-2010
Information
|
Lecturer |
|
|
Degrees |
2009: Hilary Term — MSc in Mathematical Modelling and Scientific Computing |
|
Term |
Hilary Term 2010 (16 lectures) |
Overview
Optimization deals with the problem of minimising or maximising a mathematical model of an objective function such as cost, fuel consumption etc. under a set of side constraints on the domain of definition of this function. Optimization theory is the study of the mathematical properties of optimization problems and the analysis of algorithms for their solution. The aim of this course is to provide an introduction to nonlinear continuous optimization specifically tailored to the background of mathematics students.The major pre-requisites for the course will be some knowledge of both linear algebra and real analysis, while an appreciation of methods for the numerical solution of linear systems of equations will be helpful.
Synopsis
Part 1: Unconstrained Optimization
Optimality conditions, Newton's method for nonlinear systems,
Convergence rates, Steepest descent method, General line search methods (alternative search directions, e.g. Newton, CG, BFGS,
...), Trust region methods, Inexact evaluation of linear systems, iterative methods and the role of preconditioners.
Part 2: Constrained Optimization
Optimality/KKT conditions, Lagrange Multipliers, Penalty methods and
SQP for equality constrained optimization, Interior penalty / barrier methods for inequality constrained optimization.