Fundamentals of Mathematical Programming

3 Credits

Introducing mathematical programming with an emphasis on classical optimization concepts, models and solution techniques. Focus on convex analysis (convex sets, separation theorems, convex functions), optimality conditions (Fritz-John Karush-Kuhn-Tucker), Lagrangian duality and iterative solution methods 9gradient, conjugate gradients barrier methods.