Sujet : Algorithmic advances for nonsmooth and nonconvex constrained optimization

Sous la direction de :  Welington DE OLIVEIRA

Résumé : This thesis explores how to solve complex decision-making problems that arise in fields like engineering, data science, and risk analysis. These problems often involve conflicting goals, uncertainty, and difficult mathematical structures that make them hard to solve with standard tools. We develop new algorithms that can handle these challenges by breaking problems into simpler parts and using smart strategies to find good solutions. Our methods are tested on real-world examples, such as designing safer infrastructure and improving image processing. The results show that these techniques are both practical and reliable, opening new possibilities for solving difficult problems in science and industry.

Mots clés : nonsmooth optimization, nonconvex optimization, constrained optimization

• Rapporteur : Francisco J. ARAGON ARTACHO, Universidad de Alicante
• Rapporteur : Wim VAN ACKOOIJ, Electricite de France
• Examinatrice : Sophie DEMASSEY, CMA, Mines Paris – PSL
• Examinateur : Robin GIRARD, PERSEE, Mines Paris – PSL
• Examinateur: Yunier BELLO-CRUZ, Northern Illinois University

La soutenance se tiendra en anglais et sera également retransmise en direct. Pour recevoir le lien de connexion, merci de nous contacter.