In this course we discuss about approaching best approximation problems by means of Optimization. The course will be held in English.
content of the course:
1. Best approximation problems: examples, necessary preliminaries, projections, proximinal sets, Chebyshev sets
2. Existence and uniqueness in best approximation problems
3. Necessary elements of convex optimization: separations, Fenchel duality, subdifferential,...
4. Dual characterizations of best approximation problems
5. Special cases: (the involved set is a) cone, linear subspace, hyperplane
6. Metric projection
- Enseignant: Mélanie LIMACHE GOMEZ
- Enseignant: Alejandro REYMOND
- Enseignant: Sophie ROUX
- Enseignant responsable de l'UE: Sorin-mihai GRAD
- Enseignant responsable de l'UE: Andrea SIMONETTO