Shape optimization of polytopes and application to the polyhedral Saint–Venant inequality

Abstract We introduce a framework for shape optimization in the class of simple polytopes in arbitrary dimensions. We use a parametrization via hyperplanes and provide conditions for stability of simple polytopes under small perturbations of the hyperplanes. Next, we construct a mapping based on barycentric coordinates between the perturbed and reference polytopes. This allows us to use a transport theorem to compute the derivative of integrals defined on the polytope and perform the sensitivity analysis of shape functionals. This framework is applied to a numerical study of the polygonal and polyhedral Saint–Venant inequality. We solve an optimization problem that maximizes the torsion functional over polytopes with a fixed number of facets and equal volume. Using the previously defined parametrization via hyperplanes, the problem is reduced to a finite-dimensional optimization problem. A Proximal-Perturbed Lagrangian functional is employed to handle the volume constraint. In two dimensions, our numerical results support the conjecture stating that the solution is a regular polygon. In three dimensions, the numerical solutions converge towards either regular polyhedra or irregular polyhedra, depending on the number of faces.

Authors

Institutions

Publication Details

Journal
Computational Optimization and Applications
Published
2025-12-31
DOI
https://doi.org/10.1007/s10589-025-00756-y
Primary Topic
Topology Optimization in Engineering
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Shape optimization of polytopes and application to the polyhedral Saint–Venant inequality

Antoine Laurain, Josué D. Díaz-Avalos
Computational Optimization and Applications
Topology Optimization in Engineering
article

Shape optimization of polytopes and application to the polyhedral Saint–Venant inequality

Antoine Laurain, Josué D. Díaz-Avalos
article en

Abstract

Abstract We introduce a framework for shape optimization in the class of simple polytopes in arbitrary dimensions. We use a parametrization via hyperplanes and provide conditions for stability of simple polytopes under small perturbations of the hyperplanes. Next, we construct a mapping based on barycentric coordinates between the perturbed and reference polytopes. This allows us to use a transport theorem to compute the derivative of integrals defined on the polytope and perform the sensitivity analysis of shape functionals. This framework is applied to a numerical study of the polygonal and polyhedral Saint–Venant inequality. We solve an optimization problem that maximizes the torsion functional over polytopes with a fixed number of facets and equal volume. Using the previously defined parametrization via hyperplanes, the problem is reduced to a finite-dimensional optimization problem. A Proximal-Perturbed Lagrangian functional is employed to handle the volume constraint. In two dimensions, our numerical results support the conjecture stating that the solution is a regular polygon. In three dimensions, the numerical solutions converge towards either regular polyhedra or irregular polyhedra, depending on the number of faces.

Computational Optimization and ApplicationsVol. 93(3)
University of Duisburg-Essen (DE)
Reduced inequalities
Openalex Percentile: Top 35%
Topology Optimization in Engineering
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Shape optimization of polytopes and application to the polyhedral Saint–Venant inequality — Antoine Laurain, Josué D. Díaz-Avalos · Computational Optimization and Applications (2025) | TGRS Research Map | TGRS