Answers are grounded in this paper and cite their sources.
This paper considers sparse polynomial optimization with unbounded sets. When the problem possesses correlative sparsity, we propose a sparse homogenized moment-SOS hierarchy with perturbations to solve it. The new hierarchy introduces one extra auxiliary variable for each variable clique according to the correlative sparsity pattern. Under the running intersection property, we prove that this hierarchy asymptotically converges to a value close to the optimum. Furthermore, we also provide two sparse homogenized moment-SOS hierarchies without perturbations, each having asymptotic convergence to the exact optimum. As by-products, new Positivstellensätze are obtained for sparse positive polynomials on unbounded sets. Extensive numerical experiments demonstrate the power of our approaches in solving sparse polynomial optimization problems on unbounded sets with up to thousands of variables. Finally, we apply our approaches to tackle two trajectory optimization problems: block-moving with minimum work, and optimal control of Van der Pol.
No takes yet. Share an insight, caveat, or question.
Huang et al. (2025) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: