Optimization : Nonlinear programming

linma2460  2025-2026  Louvain-la-Neuve

Optimization : Nonlinear programming
5.00 crédits
30.0 h + 22.5 h
Q2
> Horaire
Enseignants
Nunes Grapiglia Geovani;
Langue
d'enseignement
Anglais
> Facilités pour suivre le cours en français
Préalables
Basic knowledge of nonlinear analysis and linear algebra.
The target audience is the students interested in scientific computing, machine learning and optimization in engineering.
Thèmes abordés
  • General nonlinear optimization.
  • Smooth and non-smooth convex optimization.
  • Interior-point methods.
Acquis
d'apprentissage

A la fin de cette unité d’enseignement, l’étudiant est capable de :

Learning outcomes:
  • AA1.1, AA1.2, AA1.3
  • AA2.1
  • AA5.2, AA5.3
After this course, the student will be able to :
  • estimate the actual complexity of Nonlinear Optimization problems;
  • apply lower complexity bounds, which establish the limits of performance of optimization method;
  • explain the main principles for constructing the optimal methods for solving different types of minimization problems;
  • use the main problem classes (general nonlinear problems, smooth convex problems, nonsmooth convex problems, structural optimization, polynomial-time interior-point methods);
  • understand the rate of convergence of the main optimization methods;
  • two testing computer projects give a possibility to compare the theoretical conclusions and predictions with real performance of minimization methods.
Additional benefits :
  • Training in scientific English.
  • Experience in solving difficult nonlinear optimization problems.
 
Contenu
  • General problem of nonlinear optimization. Black-box concept. Iterative methods and analytical complexity. Gradient method and Newton method. Local complexity analysis.
  • Convex optimization: convex sets and functions; minimization of differentiable and non-differentiable convex functions; lower complexity bounds; optimal methods.
  • Interior-point methods: notion of self-concordant functions and barriers; path-following methods; structural optimization.
Méthodes d'enseignement
The course is given in 12-15 lectures. The computer projects are implemented by the students themselves with supporting consultations.
Modes d'évaluation
des acquis des étudiants
75% de la note finale est déterminée par un examen écrit, et 25% par un devoir.
Ressources
en ligne
https://moodle.uclouvain.be/course/view.php?id=5537
The full syllabus (in English) can be downloaded from the web page of the course.
Bibliographie
  • Yu.Nesterov. "Introductory lectures on convex optimization. Basic course", Kluwer 2004
  • P. Polyak, « Introduction in optimization », J. Willey & Sons, 1989
  • Yu. Nesterov, A. Nemirovsky, « Interior-point polynomial algorithms in nonlinear optimization », SIAM, Philadelphia, 1994.
Faculté ou entité
en charge
> MAP


Programmes / formations proposant cette unité d'enseignement (UE)

Intitulé du programme
Sigle
Crédits
Prérequis
Acquis
d'apprentissage
Master [120] : ingénieur civil en mathématiques appliquées
MAP2M
5
Master [120] : ingénieur civil en science des données
DATE2M
5
Master [120] en science des données, orientation technologies de l'information
DATI2M
5