Korda, MilanHenrion, DidierJones, Colin N.2017-05-012017-05-012017-05-01201710.1016/j.sysconle.2016.11.010https://infoscience.epfl.ch/handle/20.500.14299/136632WOS:000394190900001We study the convergence rate of the moment-sum-of-squares hierarchy of semidefinite programs for optimal control problems with polynomial data. It is known that this hierarchy generates polynomial under-approximations to the value function of the optimal control problem and that these under approximations converge in the L-1 norm to the value function as their degree d tends to infinity. We show that the rate of this convergence is 0(1/log log d). We treat in detail the continuous-time infinite-horizon-discounted problem and describe in brief how the same rate can be obtained for the finite-horizon continuous-time problem and for the discrete-time counterparts of both problems. (C) 2016 Elsevier B.V. All rights reserved.Optimal controlMoment relaxationsPolynomial sums of squaresConvergence rateSemidefinite programmingApproximation theorytext::journal::journal article::research article