Global minimization of polynomial integral functionals

MaRDI QIDQ6510339arXivFDO

Authors Giovanni Fantuzzi, Federico Fuentes

Published in arXiv

Has companion code repository https://github.com/giofantuzzi/fe-sos

Mathematics Subject Classification ID

Numerical methods of relaxation type (49M20) Numerical mathematical programming methods (65K05) Polynomial optimization (90C23)

Abstract: We describe a `discretize-then-relax' strategy to globally minimize integral functionals over functions $u$ in a Sobolev space satisfying prescribed Dirichlet boundary conditions. The strategy applies whenever the integral functional depends polynomially on $u$ and its derivatives, even if it is nonconvex. The `discretize' step uses a bounded finite-element scheme to approximate the integral minimization problem with a convergent hierarchy of polynomial optimization problems over a compact feasible set, indexed by the decreasing size $h$ of the finite-element mesh. The `relax' step employs sparse moment-SOS relaxations to approximate each polynomial optimization problem with a hierarchy of convex semidefinite programs, indexed by an increasing relaxation order $omega$. We prove that, as $omegaoinfty$ and $ho0$, solutions of such semidefinite programs provide approximate minimizers that converge in $L^p$ to the global minimizer of the original integral functional if this is unique. We also report computational experiments that show our numerical strategy works well even when technical conditions required by our theoretical analysis are not satisfied.

This page was built for publication: Global minimization of polynomial integral functionals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6510339)