Convergence rates of moment-sum-of-squares hierarchies for optimal control problems

We study the convergence rate of moment-sum-of-squares hierarchies of semidefinite programs for optimal control problems with polynomial data. It is known that these hierarchies generate polynomial under-approximations to the value function of the optimal control problem and that these under-approximations converge in the L1 norm to the value function as their degree d tends to infinity. We show that the rate of this convergence is O(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.

[1]  Markus Schweighofer,et al.  On the complexity of Putinar's Positivstellensatz , 2005, J. Complex..

[2]  J. Lasserre,et al.  Optimisation globale et théorie des moments , 2000 .

[3]  Moritz Diehl,et al.  Discrete-time stochastic optimal control via occupation measures and moment relaxations , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[4]  Didier Henrion,et al.  Approximate Volume and Integration for Basic Semialgebraic Sets , 2009, SIAM Rev..

[5]  Didier Henrion,et al.  Linear conic optimization for nonlinear optimal control , 2014, 1407.1650.

[6]  Didier Henrion,et al.  Convex Computation of the Region of Attraction of Polynomial Control Systems , 2012, IEEE Transactions on Automatic Control.

[7]  Etienne de Klerk,et al.  Improved Convergence Rates for Lasserre-Type Hierarchies of Upper Bounds for Box-Constrained Polynomial Optimization , 2016, SIAM J. Optim..

[8]  Colin Neil Jones,et al.  Convex Computation of the Maximum Controlled Invariant Set For Polynomial Control Systems , 2013, SIAM J. Control. Optim..

[9]  G. Chesi,et al.  LMI Techniques for Optimization Over Polynomials in Control: A Survey , 2010, IEEE Transactions on Automatic Control.

[10]  Benjamin Van Roy,et al.  The Linear Programming Approach to Approximate Dynamic Programming , 2003, Oper. Res..

[11]  V. I. Skalyga.  Analogs of the Markov and Schaeffer–Duffin inequalities for convex bodies , 2000 .

[12]  J. Lasserre.  Moments, Positive Polynomials And Their Applications , 2009 .

[13]  R. Vinter.  Convex duality and nonlinear optimal control , 1993 .

[14]  M. Laurent.  Sums of Squares, Moment Matrices and Optimization Over Polynomials , 2009 .

[15]  Emmanuel Trélat,et al.  Nonlinear Optimal Control via Occupation Measures and LMI-Relaxations , 2007, SIAM J. Control. Optim..

[16]  G. Chesi.  Domain of Attraction: Analysis and Control via SOS Programming , 2011 .

[17]  N. Levenberg,et al.  Multivariate simultaneous approximation , 2002 .