Hours:
12 hours (3 credits)

Room:

Aula Riunioni del Dipartimento di Ingegneria dell’Informazione, Via G. Caruso 16, Pisa - Ground Floor

To register to the course, click here

Short Abstract:

The aim of the course is to provide a comprehensive understanding of the most commonly used optimization methods and algorithms in the field of information engineering research. The course will include practical exercises using MATLAB.

Course Contents in brief:

1. Mathematical optimization
2. LS and linear programming
3. Combinatorial optimization
4. Convex optimization
5. Geometric optimization
6. Approximation algorithms for NP-hard problems

Schedule:

1. March 11, 2025, h. 14.30-17.30, Mathematical optimization and LS and linear programming (3 hours).
2. March 12, 2025, h. 14.30-17.30, Combinatorial optimization (3 hours)
3. March 13, 2025, h. 14.30-17.30, Convex and geometric optimization (3 hour)
4. March 14, 2025, h. 14.30-17.30, Approximation algorithms for NP-hard problems (3 hours)