Optimal sets for a class of minimization problems with convex constraints - INRIA - Institut National de Recherche en Informatique et en Automatique Accéder directement au contenu
Article Dans Une Revue Journal of Convex Analysis Année : 2012

Optimal sets for a class of minimization problems with convex constraints

Résumé

We look for the minimizers of the functional $J_\lambda(\Omega) = \lambda|\Omega|-P(\Omega)$ among planar convex domains constrained to lie into a given ring. We prove that, according to the values of the parameter $\lambda$, the solutions are either a disc or a polygon. In this last case, we describe completely the polygonal solutions by reducing the problem to a finite dimensional optimization problem. We recover classical inequalities for convex sets involving area, perimeter and inradius or circumradius and find a new one.
Fichier principal
Vignette du fichier
BianchiniHenrot10.pdf (338.8 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00549131 , version 1 (21-12-2010)

Identifiants

Citer

Chiara Bianchini, Antoine Henrot. Optimal sets for a class of minimization problems with convex constraints. Journal of Convex Analysis, 2012, 19 (3), pp.725-758. ⟨hal-00549131⟩
259 Consultations
138 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More