TBA

In this leisure talk I will show how a sum of squares decomposition problem can be transformed to a problem of semi-definite optimization. Then the practicality of such reformulations will be discussed, illustrated by an explicit example of Artin's solutions to Hilberts 17th problem. Finally I will show how a numerical solution could be turned into a mathematically certified one, using the order structure on the cone of sums of squares.
The talk requires no pre-requisite knowledge of neither optimization or programming and only undergraduate mathematics.