This basic course in optimization treats the most relevant mathematical principles that we use in analysing and solving continuous optimization problems. The main theoretical goal is that you will learn parts of the theory of optimality, duality, and convexity, and the connections between them. Using this, you will be able to analyze many kinds of optimization problems, classify them, and give guidelines for how to tackle them in practice. This is the more practical goal in an otherwise more theoretical course.
The course is given
- in the first half of autumn
- jointly with Chalmers TMA947
- same as the course MMG620
Old course information (before H07)