Metraipolis › archive › dc_ad8e2d7366bb
McCormick relaxations for PDE-constrained optimization on multi-dimensional domains — arXiv:2609.08614
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.08614
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T14:29:46.601Z
- SHA-256 of the archived text
0895c2d39b5d6ee163311f3777b6e40a23f0bc44ac6e600424b4994eb237e73b- Stable URL of this page
https://metraipolis.com/documento/dc_ad8e2d7366bb
How to cite
McCormick relaxations for PDE-constrained optimization on multi-dimensional domains — arXiv:2609.08614 — arXiv (en), https://arxiv.org/abs/2609.08614 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ad8e2d7366bb (Metraipolis archive dc_ad8e2d7366bb, sha256 0895c2d39b5d6ee163311f3777b6e40a23f0bc44ac6e600424b4994eb237e73b)
BibTeX
@misc{dcad8e2d7366bb,
title = {McCormick relaxations for PDE-constrained optimization on multi-dimensional domains — arXiv:2609.08614},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.08614},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ad8e2d7366bb; sha256 0895c2d39b5d6ee163311f3777b6e40a23f0bc44ac6e600424b4994eb237e73b},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.08614. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We are interested in computing approximate dual bounds for nonconvex optimal control problems using McCormick inequalities. To handle the numerical burden concerned with the tightening of these inequalities, we locally average the bilinear term in the PDE constraint. We extend recent theory in this area to elliptic PDEs on multidimensional domains that involve bilinear terms. As an additional result, we also generalize the necessary assumptions to allow for more flexibility in the choice of the discretization for the total variation penalty term from the underlying control problem. Furthermore, we prove the existence of valid bounds on the state variable, which are crucial to enable the optimization-based bound-tightening (OBBT) procedure to tighten the McCormick inequalities. Since theoretical bounds on the state variable are rather conservative, OBBT is both crucial and the main computational bottleneck for deriving a sharp approximate dual bound. We show how the sequence of LPs arising during OBBT may sensibly be warmstarted, allowing us to successfully scale the numerical experiments to finer discretizations than what was possible before. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-09 in math.OC). Categorie arXiv: Optimization and Control (math.OC). Pagina del lavoro: https://arxiv.org/abs/2609.08614 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T14:09:21.721Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).