

Sketching semidefinite programs for super-resolution problems
By Irène Waldspurger


Exploiting sparsity in polynomial optimization - lecture 1
By Victor Magron


Exploiting sparsity in polynomial optimization - lecture 2
By Victor Magron
Appears in collection : Jean-Baptiste Caillau: Geometric and Numerical Methods in Optimal Control I
After introducing a optimal control problems of Mayer type with general constraints, we detail a simple discretisation in terms of nonlinear mathematical program. We recall Runge-Kutta methods for ODE’s and treat Goddard problem as an example for the hands-on sessions.