Solving unbounded optimal control problems with the moment-SOS hierarchy *

The behaviour of the moment-sums-of-squares (moment-SOS) hierarchy for polynomial optimal control problems on compact sets has been explored to a large extent. Our contribution focuses on the case of non-compact control sets. We describe a new approach to optimal control problems with unbounded controls, using compactification by partial homogenization, leading to an equivalent infinite dimensional linear program with compactly supported measures. Our results are closely related to the results of a previous approach using DiPerna-Majda measures. However, our work provides a sound proof of the absence of relaxation gap, which was conjectured in the previous work, and thereby enables the design of a moment-sum-of-squares relaxation with guaranteed convergence.

Publication Details

Journal
ArXiv.org
Published
2025-03-17
Primary Topic
Advanced Optimization Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Solving unbounded optimal control problems with the moment-SOS hierarchy *

ArXiv.org
Advanced Optimization Algorithms Research
article

Solving unbounded optimal control problems with the moment-SOS hierarchy *

article en

Abstract

The behaviour of the moment-sums-of-squares (moment-SOS) hierarchy for polynomial optimal control problems on compact sets has been explored to a large extent. Our contribution focuses on the case of non-compact control sets. We describe a new approach to optimal control problems with unbounded controls, using compactification by partial homogenization, leading to an equivalent infinite dimensional linear program with compactly supported measures. Our results are closely related to the results of a previous approach using DiPerna-Majda measures. However, our work provides a sound proof of the absence of relaxation gap, which was conjectured in the previous work, and thereby enables the design of a moment-sum-of-squares relaxation with guaranteed convergence.

ArXiv.org
Reduced inequalities
Openalex Percentile: Top 37%
Advanced Optimization Algorithms Research
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Solving unbounded optimal control problems with the moment-SOS hierarchy * · ArXiv.org (2025) | TGRS Research Map | TGRS