Metraipolis › archive › dc_7f53bfae0ad5
Supermodularity and robust optimization in elliptic PDEs — arXiv:2611.02573
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.02573
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:32:27.373Z
- SHA-256 of the archived text
5f934a1a9c9dc5dd511573089a32580d21925f32317d32726ed7b77e407f5905- Stable URL of this page
https://metraipolis.com/documento/dc_7f53bfae0ad5
How to cite
Supermodularity and robust optimization in elliptic PDEs — arXiv:2611.02573 — arXiv (en), https://arxiv.org/abs/2611.02573 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7f53bfae0ad5 (Metraipolis archive dc_7f53bfae0ad5, sha256 5f934a1a9c9dc5dd511573089a32580d21925f32317d32726ed7b77e407f5905)
BibTeX
@misc{dc7f53bfae0ad5,
title = {Supermodularity and robust optimization in elliptic PDEs — arXiv:2611.02573},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.02573},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7f53bfae0ad5; sha256 5f934a1a9c9dc5dd511573089a32580d21925f32317d32726ed7b77e407f5905},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02573. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study distributionally robust optimization problems constrained by semilinear elliptic PDEs. Uncertain nonnegative loads enter the PDE through $m$ intensity parameters, and damage is measured by integrating a nondecreasing convex function of the solution. We prove that, for coercive operators satisfying a positivity-preserving lattice condition, a nondecreasing concave reaction $g$ makes the damage nondecreasing, convex, and supermodular in the load intensities. Under nonnegative loading and $g(0)=0$, concavity is also necessary for these properties to hold for all admissible operators and damage functions. For Wasserstein uncertainty sets based on a weighted $\ell_1$ distance and $N$ observations, we show that at most $m+1$ nested stress corners are needed per observation. These corners form a set of at most $N(m+1)$ points that does not depend on the Wasserstein radius and supports a worst-case distribution for every radius. We compute the exact robust value by checking $\lambda=0$ and at most $Nm$ positive breakpoints, and we construct a worst-case distribution that moves each observation to a chain corner and splits at most one observation between two adjacent corners. We apply the results to a convex remediation-planning problem with Monod biodegradation. Numerical experiments show that the method requires far fewer PDE solves than enumerating all corners. Finally, a counterexample shows that supermodularity can fail for the fractional $p$-Laplacian when $p>2$. Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno). Categorie arXiv: Optimization and Control (math.OC) ; Analysis of PDEs (math.AP). Pagina del lavoro: https://arxiv.org/abs/2611.02573 — 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-11-03T11:04:22.267Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).