Description
Date depot: 19 mars 2020
Titre: Exact algorithms for structured polynomial optimization
Directeur de thèse:
Mohab SAFEY EL DIN (LIP6)
Directeur de thèse:
Jérémy BERTHOMIEU (LIP6)
Domaine scientifique: Sciences et technologies de l'information et de la communication
Thématique CNRS : Non defini
Resumé:
Polynomial optimization, i.e. the problem of computing the infimum of a polynomial under polynomial constraints, arises in many areas of engineering sciences. This problem is algebraic and because of its natural non-linearity, is difficult to handle with purely numerical methods when one wants some warranties on the output. In this PhD project, one will focus on the development of computer algebra algorithms to tackle such problems. The research which will be carried on there will encompass the design of new algorithms for computing generalized critical values (to tackle situations where the infimum is not reached), complexity studies and the development of dedicated algorithms for polynomial optimization problems which enjoy some geometric/algebraic structure.
Doctorant.e: Ferguson Andrew