Verimag

Seminar details

salle A. Turing CE4
13 November 2014 - 13h30
New applications of moment-SOS hierarchies
by Victor Magron from Imperial College



Abstract: Semidefinite programming is relevant to a wide range of mathematic fields, including combinatorial optimization, control theory, matrix completion. In 2001, Lasserre introduced a hierarchy of semidefinite relaxations for particular polynomial instances of the Generalized Moment Problem (GMP). My talk emphasizes new applications of this moment-SOS hierarchy, investigated during my PhD and Postdoc research.

In the context of formal proofs for nonlinear optimization, one can combine the moment-SOS hierarchy with maxplus approximation of semiconvex functions. Such a framework is mandatory for formal certification of nonlinear inequalities, occurring by thousands in the proof of Kepler Conjecture by Hales.

I also present how to approximate, as closely as desired, the Pareto curve associated with bicriteria polynomial optimization problems or the projections of semialgebraic sets. For each problem, one builds a hierarchy of semidefinite programs, so that the sequence of bounds converges in L1 norm.

Finally, this hierarchy allows to analyze programs containing loop invariants with polynomial assignments.




Contact | Site Map | Site powered by SPIP 3.0.26 + AHUNTSIC [CC License]

info visites 876685