Optimization

Program

Optimality conditions and duality theory for conic, convex, non-linear, non-differentiable and multi-objective optimization. Depending on the approach to the course, other topics might be considered, such as numerical methods for continuous optimization, algebraic methods and representability in polynomial optimization and semi-definite programming, or continuous relaxations for combinatorial problems.

Research and Events