Polygons as optimal shapes with convexity constraint

Simple item page
dc.creatorLamboley, Jimmy
dc.creatorNovruzi, Arian
dc.date2009-02-18
dc.date.accessioned2026-07-07T12:43:28Z
dc.date.available2026-07-07T12:43:28Z
dc.descriptionIn this paper, we focus on the following general shape optimization problem: $$ \min\{J(\Om), \Om convex, \Om\in\mathcal S_{ad}\}, $$ where $\mathcal S_{ad}$ is a set of 2-dimensional admissible shapes and $J:\mathcal{S}_{ad}\to\R$ is a shape functional. Using a specific parameterization of the set of convex domains, we derive some extremality conditions (first and second order) for this kind of problem. Moreover, we use these optimality conditions to prove that, for a large class of functionals (satisfying a concavity like property), any solution to this shape optimization problem is a polygon.
dc.identifierhttps://arxiv.org/abs/0902.3062
dc.identifierhttp://arxiv.org/abs/0902.3062
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/220434
dc.subjectOptimization and Control
dc.titlePolygons as optimal shapes with convexity constraint
dc.typetext

Files

Collections

arXiv