Syllabus academic year 2010/2011
(Created 2010-07-25.)
Credits: 6. Grading scale: TH. Cycle: A (Second Cycle). Main field: Technology. Language of instruction: The course will be given in English on demand. Alternative for: I3. Optional for: D4, E4, E4pe, E4ra, F4, F4bm, F4bs, F4fm, F4ssr, Pi3, Pi3bm, Pi3bs, Pi3fm, Pi3mrk, Pi3pv, Pi3ssr. Course coordinator: Director of Studies, Anders Holst,, Mathematics. Recommended prerequisits: Basic university studies in calculus and linear algebra. Assessment: Written test comprising theory and problems. Two computer exercises and one project. Home page:

The aim of the course is to present basic optimization theory, and to give an overview of the most important methods and their practical use.

Knowledge and understanding
For a passing grade the student must

be familiar with and, in his/her own words, be able to describe the optimization algorithms encountered in the course, with and without constraints, and their properties.

be familiar with the theory of convex sets and convex functions, and be able to state and derive the most important theorems on convexity.

be familiar with Kuhn-Tucker Theory and be able to state and derive the most important theorems therein.

Skills and abilities
For a passing grade the student must

be able to show capability to solve optimization problems within the framework of the course.

be able to show capability to handle optimization problems using a computer.

be able to show capability to, in the context of problem solving, develop the theory somewhat further.

with proper terminology, well structured and with clear logic, be able to describe the connections between different concepts in the course.

with proper terminology, suitable notation, in a well structured way and with clear logic be able to describe the solution to a mathematical problem and the theory within the framework of the course.

Quadratic forms and matrix factorisation. Convexity. The theory of optimization with and without constraints: Lagrange functions, Kuhn-Tucker theory. Duality. Methods of optimization without constraints: line search, steepest descent, Newton methods, conjugate directions, non-linear least squares optimisation. Methods of optimization with constraints: linear optimization, the simplex method, quadratic programming, penalty and barrier methods.

Böiers, L-C: Lectures on Optimization. KF-Sigma 2009.
Department of Mathematics: Exercises in Optimization. KF-Sigma 2009.
Department of Mathematics: Computer Laboratory Exercises in Optimization.