Infinite-Dimensional Sums-of-Squares for Optimal Control
Not on the map. Why?
Abstract (arXiv)
We introduce an approximation method to solve an optimal control problem via the Lagrange dual of its weak formulation. It is based on a sum-of-squares representation of the Hamiltonian, and extends a previous method from polynomial optimization to the generic case of smooth problems. Such a representation is infinite-dimensional and relies on a particular space of functions-a reproducing kernel Hilbert space-chosen to fit the structure of the control problem. After subsampling, it leads to a practical method that amounts to solving a semi-definite program. We illustrate our approach by a numerical application on a simple low-dimensional control problem.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 14 Oct 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 2; 2023: 3.
6 papers.
- 2022Information Theory with Kernel Methodscited by 37
- 2021Learning PSD-valued functions using kernel sums-of-squarescited by 5
- 2022Non-Convex Optimization with Certificates and Fast Rates Through Kernel Sums of Squarescited by 2
- 2023Approximation of optimization problems with constraints through kernel Sum-Of-Squarescited by 2
- 2023Efficient Sampling of Stochastic Differential Equations with Positive Semi-Definite Modelscited by 1
- 2023GloptiNets: Scalable Non-Convex Optimization with Certificatescited by 0
- 2023GloptiNets: Scalable Non-Convex Optimization with Certificates26 Jun 2023
- 2023Efficient Sampling of Stochastic Differential Equations with Positive Semi-Definite Models30 Mar 2023
- 2023Approximation of optimization problems with constraints through kernel Sum-Of-Squares16 Jan 2023
- 2022Non-Convex Optimization with Certificates and Fast Rates Through Kernel Sums of Squares11 Apr 2022
- 2022Information Theory with Kernel Methods17 Feb 2022
- 2021Learning PSD-valued functions using kernel sums-of-squares22 Nov 2021