Global Minimization of Polynomial Integral Functionals
- 1 July 2024
- journal article
- research article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Scientific Computing
- Vol. 46 (4) , A2123-A2149
Abstract
We describe a “discretize-then-relax” strategy to globally minimize integral functionals over functions [Formula: see text] in a Sobolev space subject to Dirichlet boundary conditions. The strategy applies whenever the integral functional depends polynomially on [Formula: see text] 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 [Formula: see text] of the finite element mesh. The “relax” step employs sparse moment-sum-of-squares relaxations to approximate each polynomial optimization problem with a hierarchy of convex semidefinite programs, indexed by an increasing relaxation order [Formula: see text]. We prove that, as [Formula: see text] and [Formula: see text], solutions of such semidefinite programs provide approximate minimizers that converge in a suitable sense (including in certain [Formula: see text] norms) to the global minimizer of the original integral functional if it is unique. We also report computational experiments showing that our numerical strategy works well even when technical conditions required by our theoretical analysis are not satisfied.Keywords
All Related Versions
Funding Information
- National Center For Artificial Intelligence (CENIA FB210017)
- Imperial College London
- National Science Foundation (2012658)
- ONR (N62909-23-1-2098)
This publication has 56 references indexed in Scilit:
- Deterministic Guarantees for Burer‐Monteiro Factorizations of Smooth Semidefinite ProgramsCommunications on Pure and Applied Mathematics, 2019
- A Brief Introduction to PDE-Constrained Optimization2018
- Linear Functional Analysis2016
- Bilayer Plates: Model Reduction, Γ‐Convergent Finite Element Approximation, and Discrete Gradient FlowCommunications on Pure and Applied Mathematics, 2015
- Sums of Squares, Moment Matrices and Optimization Over Polynomials2008
- The Mathematical Theory of Finite Element Methods2008
- Theory and Practice of Finite Elements2004
- Path-Following Methods2000
- Interior Point Algorithms1997
- An Introduction to Chordal Graphs and Clique Trees1993