Course unit: Optimization

Brief description

This course is an elective course aimed at anyone interested in optimization.

Learning outcomes

Course content

  1. Gâteaux and Fréchet derivatives, Euler inequations, Taylor formula, Farkas lemma, Local inversion and Lagrange multiplier.
  2. Convex programs (up to Kuhn & Tucker), application to the quadratic case and to the equivalence with the symmetric variational formulation.
  3. Algorithms: relaxation and the four gradients; convergence rate
  4. Introduction to optimal control